About the Execution of LTSMin+red for FireWire-PT-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1946.052 | 1800000.00 | 2393941.00 | 4708.50 | [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/mcc2024-input.r564-tall-171734907800203.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FireWire-PT-20, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r564-tall-171734907800203
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 247K Jun 2 16:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1717363094239
Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 21:18:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 21:18:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:18:15] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2024-06-02 21:18:15] [INFO ] Transformed 626 places.
[2024-06-02 21:18:15] [INFO ] Transformed 1031 transitions.
[2024-06-02 21:18:15] [INFO ] Found NUPN structural information;
[2024-06-02 21:18:15] [INFO ] Parsed PT model containing 626 places and 1031 transitions and 3196 arcs in 211 ms.
Graph (trivial) has 458 edges and 626 vertex of which 12 / 626 are part of one of the 3 SCC in 5 ms
Free SCC test removed 9 places
Structural test allowed to assert that 93 places are NOT stable. Took 24 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
RANDOM walk for 40000 steps (458 resets) in 2510 ms. (15 steps per ms) remains 385/533 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 22 ms. (17 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 28 ms. (13 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 21 ms. (18 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 385/385 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 385/385 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 385/385 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 385/385 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 385/385 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 385/385 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 385/385 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 385/385 properties
[2024-06-02 21:18:16] [INFO ] Flow matrix only has 1019 transitions (discarded 2 similar events)
// Phase 1: matrix 1019 rows 617 cols
[2024-06-02 21:18:16] [INFO ] Computed 13 invariants in 29 ms
[2024-06-02 21:18:16] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 385/385 constraints. Problems are: Problem set: 0 solved, 385 unsolved
Error getting values : (error "ParserException while parsing response: ((s4 (/ 1.0 2.0))
(s7 (/ 1.0 2.0))
(s8 (/ 1.0 2.0))
(s9 (/ 1.0 2.0))
(s11 (/ 1.0 2.0))
(s29 (/ 1.0 2.0))
(s57 (/ 1.0 2.0))
(s58 (/ 1.0 2.0))
(s59 (/ 1.0 2.0))
(s60 (/ 1.0 2.0))
(s61 (/ 1.0 2.0))
(s62 (/ 1.0 2.0))
(s63 (/ 1.0 2.0))
(s81 (/ 1.0 2.0))
(s82 (/ 1.0 2.0))
(s83 (/ 1.0 2.0))
(s84 (/ 1.0 2.0))
(s85 (/ 1.0 2.0))
(s86 (/ 1.0 2.0))
(s87 (/ 1.0 2.0))
(s88 (/ 1.0 2.0))
(s89 (/ 1.0 2.0))
(s90 (/ 1.0 2.0))
(s93 (/ 1.0 2.0))
(s94 (/ 1.0 2.0))
(s97 (/ 1.0 2.0))
(s101 (/ 1.0 2.0))
(s110 (/ 1.0 2.0))
(s111 (/ 1.0 2.0))
(s112 (/ 1.0 2.0))
(s113 (/ 1.0 2.0))
(s114 (/ 1.0 2.0))
(s115 (/ 1.0 2.0))
(s116 (/ 1.0 2.0))
(s117 (/ 1.0 2.0))
(s118 (/ 1.0 2.0))
(s119 (/ 1.0 2.0))
(s120 (/ 1.0 2.0))
(s121 (/ 1.0 2.0))
(s122 (/ 1.0 2.0))
(s123 (/ 1.0 2.0))
(s124 (/ 1.0 2.0))
(s125 (/ 1.0 2.0))
(s126 (/ 1.0 2.0))
(s127 (/ 1.0 2.0))
(s128 (/ 1.0 2.0))
(s129 (/ 1.0 2.0))
(s130 (/ 1.0 2.0))
(s131 (/ 1.0 2.0))
(s132 (/ 1.0 2.0))
(s133 (/ 1.0 2.0))
(s134 (/ 1.0 2.0))
(s135 (/ 1.0 2.0))
(s136 (/ 1.0 2.0))
(s137 (/ 1.0 2.0))
(s138 (/ 1.0 2.0))
(s139 (/ 1.0 2.0))
(s140 (/ 1.0 2.0))
(s141 (/ 1.0 2.0))
(s142 (/ 1.0 2.0))
(s143 (/ 1.0 2.0))
(s144 (/ 1.0 2.0))
(s145 (/ 1.0 2.0))
(s146 (/ 1.0 2.0))
(s147 (/ 1.0 2.0))
(s148 (/ 1.0 2.0))
(s149 (/ 1.0 2.0))
(s150 (/ 1.0 2.0))
(s151 (/ 1.0 2.0))
(s152 (/ 1.0 2.0))
(s153 (/ 1.0 2.0))
(s154 (/ 1.0 2.0))
(s155 (/ 1.0 2.0))
(s156 (/ 1.0 2.0))
(s157 (/ 1.0 2.0))
(s158 (/ 1.0 2.0))
(s159 (/ 1.0 2.0))
(s160 (/ 1.0 2.0))
(s161 (/ 1.0 2.0))
(s162 (/ 1.0 2.0))
(s163 (/ 1.0 2.0))
(s164 (/ 1.0 2.0))
(s165 (/ 1.0 2.0))
(s166 (/ 1.0 2.0))
(s167 (/ 1.0 2.0))
(s168 (/ 1.0 2.0))
(s169 (/ 1.0 2.0))
(s170 (/ 1.0 2.0))
(s171 (/ 1.0 2.0))
(s184 (/ 1.0 2.0))
(s185 (/ 1.0 2.0))
(s186 (/ 1.0 2.0))
(s187 (/ 1.0 2.0))
(s188 (/ 1.0 2.0))
(s189 (/ 1.0 2.0))
(s190 (/ 1.0 2.0))
(s191 (/ 1.0 2.0))
(s192 (/ 1.0 2.0))
(s193 (/ 1.0 2.0))
(s194 (/ 1.0 2.0))
(s195 (/ 1.0 2.0))
(s196 (/ 1.0 2.0))
(s197 (/ 1.0 2.0))
(s198 (/ 1.0 2.0))
(s202 (/ 1.0 2.0))
(s206 (/ 1.0 2.0))
(s207 (/ 1.0 2.0))
(s208 (/ 1.0 2.0))
(s209 (/ 1.0 2.0))
(s210 (/ 1.0 2.0))
(s211 (/ 1.0 2.0))
(s212 (/ 1.0 2.0))
(s213 (/ 1.0 2.0))
(s214 (/ 1.0 2.0))
(s215 (/ 1.0 2.0))
(s216 (/ 1.0 2.0))
(s217 (/ 1.0 2.0))
(s218 (/ 1.0 2.0))
(s219 (/ 1.0 2.0))
(s220 (/ 1.0 2.0))
(s221 (/ 1.0 2.0))
(s222 (/ 1.0 2.0))
(s223 (/ 1.0 2.0))
(s224 (/ 1.0 2.0))
(s225 (/ 1.0 2.0))
(s226 (/ 1.0 2.0))
(s227 (/ 1.0 2.0))
(s245 (/ 1.0 2.0))
(s246 (/ 1.0 2.0))
(s247 (/ 1.0 2.0))
(s248 (/ 1.0 2.0))
(s249 (/ 1.0 2.0))
(s250 (/ 1.0 2.0))
(s251 (/ 1.0 2.0))
(s269 (/ 1.0 2.0))
(s270 (/ 1.0 2.0))
(s271 (/ 1.0 2.0))
(s272 (/ 1.0 2.0))
(s273 (/ 1.0 2.0))
(s274 (/ 1.0 2.0))
(s275 (/ 1.0 2.0))
(s276 (/ 1.0 2.0))
(s277 (/ 1.0 2.0))
(s278 (/ 1.0 2.0))
(s281 (/ 1.0 2.0))
(s282 (/ 1.0 2.0))
(s285 (/ 1.0 2.0))
(s289 (/ 1.0 2.0))
(s294 (/ 1.0 2.0))
(s295 (/ 1.0 2.0))
(s296 (/ 1.0 2.0))
(s298 (/ 1.0 2.0))
(s299 (/ 1.0 2.0))
(s300 (/ 1.0 2.0))
(s301 (/ 1.0 2.0))
(s302 (/ 1.0 2.0))
(s303 (/ 1.0 2.0))
(s304 (/ 1.0 2.0))
(s305 (/ 1.0 2.0))
(s306 (/ 1.0 2.0))
(s307 (/ 1.0 2.0))
(s308 (/ 1.0 2.0))
(s309 (/ 1.0 2.0))
(s310 (/ 1.0 2.0))
(s311 (/ 1.0 2.0))
(s312 (/ 1.0 2.0))
(s313 (/ 1.0 2.0))
(s314 (/ 1.0 2.0))
(s315 (/ 1.0 2.0))
(s316 (/ 1.0 2.0))
(s317 (/ 1.0 2.0))
(s318 (/ 1.0 2.0))
(s319 (/ 1.0 2.0))
(s320 (/ 1.0 2.0))
(s321 (/ 1.0 2.0))
(s322 (/ 1.0 2.0))
(s323 (/ 1.0 2.0))
(s324 (/ 1.0 2.0))
(s325 (/ 1.0 2.0))
(s326 (/ 1.0 2.0))
(s327 (/ 1.0 2.0))
(s328 (/ 1.0 2.0))
(s329 (/ 1.0 2.0))
(s330 (/ 1.0 2.0))
(s331 (/ 1.0 2.0))
(s332 (/ 1.0 2.0))
(s333 (/ 1.0 2.0))
(s334 (/ 1.0 2.0))
(s335 (/ 1.0 2.0))
(s336 (/ 1.0 2.0))
(s337 (/ 1.0 2.0))
(s338 (/ 1.0 2.0))
(s339 (/ 1.0 2.0))
(s340 (/ 1.0 2.0))
(s341 (/ 1.0 2.0))
(s342 (/ 1.0 2.0))
(s343 (/ 1.0 2.0))
(s344 (/ 1.0 2.0))
(s345 (/ 1.0 2.0))
(s346 (/ 1.0 2.0))
(s347 (/ 1.0 2.0))
(s348 (/ 1.0 2.0))
(s349 (/ 1.0 2.0))
(s350 (/ 1.0 2.0))
(s351 (/ 1.0 2.0))
(s352 (/ 1.0 2.0))
(s353 (/ 1.0 2.0))
(s354 (/ 1.0 2.0))
(s355 (/ 1.0 2.0))
(s356 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 385/1636 variables, and 385 constraints, problems are : Problem set: 0 solved, 385 unsolved in 5147 ms.
Refiners :[Domain max(s): 385/617 constraints, Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/617 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 385/385 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 385 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 385/385 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 2 (OVERLAPS) 232/617 variables, 13/398 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 232/630 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-06-02 21:18:25] [INFO ] Deduced a trap composed of 55 places in 356 ms of which 42 ms to minimize.
[2024-06-02 21:18:25] [INFO ] Deduced a trap composed of 358 places in 277 ms of which 5 ms to minimize.
[2024-06-02 21:18:25] [INFO ] Deduced a trap composed of 187 places in 260 ms of which 4 ms to minimize.
[2024-06-02 21:18:26] [INFO ] Deduced a trap composed of 182 places in 236 ms of which 4 ms to minimize.
[2024-06-02 21:18:26] [INFO ] Deduced a trap composed of 115 places in 89 ms of which 2 ms to minimize.
[2024-06-02 21:18:26] [INFO ] Deduced a trap composed of 128 places in 240 ms of which 4 ms to minimize.
[2024-06-02 21:18:26] [INFO ] Deduced a trap composed of 20 places in 232 ms of which 4 ms to minimize.
[2024-06-02 21:18:26] [INFO ] Deduced a trap composed of 127 places in 237 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1636 variables, and 638 constraints, problems are : Problem set: 0 solved, 385 unsolved in 5012 ms.
Refiners :[Domain max(s): 617/617 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/617 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/385 constraints, Known Traps: 8/8 constraints]
After SMT, in 10364ms problems are : Problem set: 0 solved, 385 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 385 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.7 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 611 transition count 958
Reduce places removed 60 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 62 rules applied. Total rules applied 126 place count 551 transition count 956
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 127 place count 550 transition count 956
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 127 place count 550 transition count 946
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 147 place count 540 transition count 946
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 163 place count 524 transition count 929
Iterating global reduction 3 with 16 rules applied. Total rules applied 179 place count 524 transition count 929
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 182 place count 524 transition count 926
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 185 place count 521 transition count 836
Iterating global reduction 4 with 3 rules applied. Total rules applied 188 place count 521 transition count 836
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 190 place count 521 transition count 834
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 244 place count 494 transition count 807
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 268 place count 482 transition count 824
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 271 place count 482 transition count 821
Free-agglomeration rule applied 21 times.
Iterating global reduction 5 with 21 rules applied. Total rules applied 292 place count 482 transition count 800
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 316 place count 461 transition count 797
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 320 place count 461 transition count 793
Applied a total of 320 rules in 196 ms. Remains 461 /617 variables (removed 156) and now considering 793/1021 (removed 228) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 461/617 places, 793/1021 transitions.
RANDOM walk for 4000000 steps (131542 resets) in 48269 ms. (82 steps per ms) remains 124/385 properties
BEST_FIRST walk for 40004 steps (263 resets) in 93 ms. (425 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (264 resets) in 87 ms. (454 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (258 resets) in 83 ms. (476 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (266 resets) in 87 ms. (454 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (257 resets) in 86 ms. (459 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (268 resets) in 83 ms. (476 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (257 resets) in 86 ms. (459 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (259 resets) in 86 ms. (459 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (263 resets) in 87 ms. (454 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (263 resets) in 84 ms. (470 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (250 resets) in 81 ms. (487 steps per ms) remains 123/124 properties
BEST_FIRST walk for 40003 steps (249 resets) in 84 ms. (470 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (260 resets) in 84 ms. (470 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (252 resets) in 86 ms. (459 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (261 resets) in 82 ms. (481 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (264 resets) in 84 ms. (470 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (265 resets) in 83 ms. (476 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (250 resets) in 85 ms. (465 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (276 resets) in 86 ms. (459 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (258 resets) in 85 ms. (465 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (249 resets) in 85 ms. (465 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (272 resets) in 86 ms. (459 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (259 resets) in 84 ms. (470 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (260 resets) in 84 ms. (470 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (263 resets) in 88 ms. (449 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (261 resets) in 83 ms. (476 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (253 resets) in 84 ms. (470 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (261 resets) in 86 ms. (459 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (249 resets) in 86 ms. (459 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (260 resets) in 86 ms. (459 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (275 resets) in 85 ms. (465 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (248 resets) in 81 ms. (487 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (263 resets) in 86 ms. (459 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (248 resets) in 83 ms. (476 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (248 resets) in 89 ms. (444 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (246 resets) in 84 ms. (470 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (255 resets) in 86 ms. (459 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (250 resets) in 84 ms. (470 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (255 resets) in 81 ms. (487 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (251 resets) in 84 ms. (470 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (258 resets) in 85 ms. (465 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (256 resets) in 84 ms. (470 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (267 resets) in 83 ms. (476 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (269 resets) in 113 ms. (350 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (251 resets) in 94 ms. (421 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (264 resets) in 87 ms. (454 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (253 resets) in 84 ms. (470 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (254 resets) in 81 ms. (487 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (249 resets) in 81 ms. (487 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (249 resets) in 81 ms. (487 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (255 resets) in 85 ms. (465 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (252 resets) in 82 ms. (481 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (274 resets) in 81 ms. (487 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (266 resets) in 83 ms. (476 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (273 resets) in 85 ms. (465 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (255 resets) in 88 ms. (449 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (262 resets) in 82 ms. (481 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (257 resets) in 83 ms. (476 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (251 resets) in 87 ms. (454 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (244 resets) in 115 ms. (344 steps per ms) remains 123/123 properties
[2024-06-02 21:18:40] [INFO ] Flow matrix only has 791 transitions (discarded 2 similar events)
// Phase 1: matrix 791 rows 461 cols
[2024-06-02 21:18:40] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 21:18:40] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 298/421 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 19/440 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 782/1222 variables, 440/450 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1222 variables, 38/488 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1222 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 27/1249 variables, 18/506 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1249 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 3/1252 variables, 3/509 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1252 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/1252 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1252/1252 variables, and 509 constraints, problems are : Problem set: 0 solved, 123 unsolved in 13456 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 461/461 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 298/421 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-02 21:18:54] [INFO ] Deduced a trap composed of 114 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:18:54] [INFO ] Deduced a trap composed of 100 places in 53 ms of which 1 ms to minimize.
[2024-06-02 21:18:55] [INFO ] Deduced a trap composed of 88 places in 53 ms of which 1 ms to minimize.
[2024-06-02 21:18:55] [INFO ] Deduced a trap composed of 98 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:18:55] [INFO ] Deduced a trap composed of 106 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:18:55] [INFO ] Deduced a trap composed of 121 places in 59 ms of which 1 ms to minimize.
[2024-06-02 21:18:55] [INFO ] Deduced a trap composed of 104 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:18:55] [INFO ] Deduced a trap composed of 124 places in 54 ms of which 2 ms to minimize.
[2024-06-02 21:18:56] [INFO ] Deduced a trap composed of 104 places in 60 ms of which 1 ms to minimize.
[2024-06-02 21:18:56] [INFO ] Deduced a trap composed of 106 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:18:56] [INFO ] Deduced a trap composed of 94 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:18:56] [INFO ] Deduced a trap composed of 104 places in 60 ms of which 1 ms to minimize.
[2024-06-02 21:18:57] [INFO ] Deduced a trap composed of 105 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-02 21:18:57] [INFO ] Deduced a trap composed of 106 places in 49 ms of which 1 ms to minimize.
[2024-06-02 21:18:58] [INFO ] Deduced a trap composed of 106 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/421 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 19/440 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-02 21:19:01] [INFO ] Deduced a trap composed of 111 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 782/1222 variables, 440/466 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1222 variables, 38/504 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1222 variables, 123/627 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-02 21:19:03] [INFO ] Deduced a trap composed of 94 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:19:03] [INFO ] Deduced a trap composed of 104 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:19:04] [INFO ] Deduced a trap composed of 110 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:19:05] [INFO ] Deduced a trap composed of 110 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1222 variables, 4/631 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1222 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 13 (OVERLAPS) 27/1249 variables, 18/649 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1249 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 15 (OVERLAPS) 3/1252 variables, 3/652 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1252 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1252/1252 variables, and 652 constraints, problems are : Problem set: 0 solved, 123 unsolved in 45014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 461/461 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 20/20 constraints]
After SMT, in 58504ms problems are : Problem set: 0 solved, 123 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 123 out of 461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 793/793 transitions.
Graph (complete) has 1497 edges and 461 vertex of which 458 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 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 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 458 transition count 732
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 120 place count 400 transition count 732
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 120 place count 400 transition count 729
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 126 place count 397 transition count 729
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 155 place count 368 transition count 696
Iterating global reduction 2 with 29 rules applied. Total rules applied 184 place count 368 transition count 696
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 184 place count 368 transition count 695
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 186 place count 367 transition count 695
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 198 place count 355 transition count 680
Iterating global reduction 2 with 12 rules applied. Total rules applied 210 place count 355 transition count 680
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 213 place count 352 transition count 677
Iterating global reduction 2 with 3 rules applied. Total rules applied 216 place count 352 transition count 677
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 222 place count 352 transition count 671
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 225 place count 349 transition count 671
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 287 place count 318 transition count 640
Performed 30 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 347 place count 288 transition count 710
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 353 place count 288 transition count 704
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 379 place count 288 transition count 678
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 380 place count 288 transition count 677
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 381 place count 287 transition count 677
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 383 place count 287 transition count 775
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 385 place count 285 transition count 775
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 390 place count 285 transition count 775
Applied a total of 390 rules in 155 ms. Remains 285 /461 variables (removed 176) and now considering 775/793 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 285/461 places, 775/793 transitions.
RANDOM walk for 4000000 steps (137828 resets) in 35377 ms. (113 steps per ms) remains 78/123 properties
BEST_FIRST walk for 400003 steps (2636 resets) in 671 ms. (595 steps per ms) remains 77/78 properties
BEST_FIRST walk for 400003 steps (2666 resets) in 654 ms. (610 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2695 resets) in 669 ms. (597 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400002 steps (2681 resets) in 667 ms. (598 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2688 resets) in 672 ms. (594 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2623 resets) in 666 ms. (599 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2662 resets) in 671 ms. (595 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2636 resets) in 662 ms. (603 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2643 resets) in 664 ms. (601 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400002 steps (2744 resets) in 659 ms. (606 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2651 resets) in 656 ms. (608 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2627 resets) in 662 ms. (603 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2665 resets) in 665 ms. (600 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2666 resets) in 670 ms. (596 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2695 resets) in 666 ms. (599 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2685 resets) in 666 ms. (599 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400002 steps (2697 resets) in 664 ms. (601 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2664 resets) in 657 ms. (607 steps per ms) remains 76/77 properties
BEST_FIRST walk for 400003 steps (2643 resets) in 661 ms. (604 steps per ms) remains 73/76 properties
BEST_FIRST walk for 400004 steps (2674 resets) in 640 ms. (624 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (2735 resets) in 651 ms. (613 steps per ms) remains 70/73 properties
BEST_FIRST walk for 400003 steps (2682 resets) in 646 ms. (618 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (2716 resets) in 652 ms. (612 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (2650 resets) in 641 ms. (623 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (2648 resets) in 645 ms. (619 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (2706 resets) in 639 ms. (625 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (2692 resets) in 637 ms. (626 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (2595 resets) in 649 ms. (615 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (2668 resets) in 643 ms. (621 steps per ms) remains 67/70 properties
BEST_FIRST walk for 400003 steps (2694 resets) in 627 ms. (636 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (2641 resets) in 630 ms. (633 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (2674 resets) in 629 ms. (634 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400002 steps (2660 resets) in 630 ms. (633 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (2673 resets) in 631 ms. (632 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400002 steps (2673 resets) in 632 ms. (631 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400002 steps (2665 resets) in 631 ms. (632 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400003 steps (2686 resets) in 623 ms. (641 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (2625 resets) in 626 ms. (637 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400003 steps (2641 resets) in 633 ms. (630 steps per ms) remains 66/67 properties
BEST_FIRST walk for 400003 steps (2637 resets) in 629 ms. (634 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2678 resets) in 628 ms. (635 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2688 resets) in 620 ms. (644 steps per ms) remains 65/66 properties
BEST_FIRST walk for 400002 steps (2631 resets) in 615 ms. (649 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400003 steps (2630 resets) in 624 ms. (640 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400003 steps (2645 resets) in 613 ms. (651 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (2688 resets) in 623 ms. (641 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400003 steps (2667 resets) in 620 ms. (644 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (2682 resets) in 615 ms. (649 steps per ms) remains 63/65 properties
BEST_FIRST walk for 400004 steps (2644 resets) in 612 ms. (652 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (2716 resets) in 600 ms. (665 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (2663 resets) in 609 ms. (655 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (2636 resets) in 600 ms. (665 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400002 steps (2687 resets) in 605 ms. (660 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (2731 resets) in 610 ms. (654 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400002 steps (2699 resets) in 606 ms. (658 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (2670 resets) in 628 ms. (635 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (2635 resets) in 604 ms. (661 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (2693 resets) in 607 ms. (657 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (2652 resets) in 615 ms. (649 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (2629 resets) in 611 ms. (653 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (2652 resets) in 609 ms. (655 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400002 steps (2680 resets) in 610 ms. (654 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (2680 resets) in 595 ms. (671 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400000 steps (2681 resets) in 600 ms. (665 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (2602 resets) in 599 ms. (666 steps per ms) remains 63/63 properties
[2024-06-02 21:19:59] [INFO ] Flow matrix only has 764 transitions (discarded 11 similar events)
// Phase 1: matrix 764 rows 285 cols
[2024-06-02 21:19:59] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:19:59] [INFO ] State equation strengthened by 111 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 161/224 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 46/270 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 764/1034 variables, 270/280 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1034 variables, 111/391 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1034 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 15/1049 variables, 15/406 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1049 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/1049 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1049/1049 variables, and 406 constraints, problems are : Problem set: 0 solved, 63 unsolved in 3404 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 285/285 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 161/224 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 46/270 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-06-02 21:20:03] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:20:03] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-06-02 21:20:03] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-06-02 21:20:04] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 2 ms to minimize.
[2024-06-02 21:20:04] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 1 ms to minimize.
[2024-06-02 21:20:04] [INFO ] Deduced a trap composed of 64 places in 128 ms of which 2 ms to minimize.
[2024-06-02 21:20:04] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 2 ms to minimize.
[2024-06-02 21:20:04] [INFO ] Deduced a trap composed of 58 places in 136 ms of which 2 ms to minimize.
[2024-06-02 21:20:04] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 2 ms to minimize.
[2024-06-02 21:20:04] [INFO ] Deduced a trap composed of 60 places in 41 ms of which 0 ms to minimize.
[2024-06-02 21:20:05] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 1 ms to minimize.
[2024-06-02 21:20:05] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-06-02 21:20:05] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 764/1034 variables, 270/293 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1034 variables, 111/404 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1034 variables, 63/467 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-06-02 21:20:06] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1034 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1034 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (OVERLAPS) 15/1049 variables, 15/483 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-06-02 21:20:12] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1049 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1049 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 14 (OVERLAPS) 0/1049 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1049/1049 variables, and 484 constraints, problems are : Problem set: 0 solved, 63 unsolved in 14088 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 285/285 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 15/15 constraints]
After SMT, in 17520ms problems are : Problem set: 0 solved, 63 unsolved
Fused 63 Parikh solutions to 62 different solutions.
Parikh walk visited 0 properties in 12459 ms.
Support contains 63 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 775/775 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 285 transition count 774
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 284 transition count 774
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 9 place count 277 transition count 767
Iterating global reduction 0 with 7 rules applied. Total rules applied 16 place count 277 transition count 767
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 16 place count 277 transition count 766
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 276 transition count 766
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 274 transition count 762
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 274 transition count 762
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 58 place count 256 transition count 744
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 70 place count 244 transition count 720
Iterating global reduction 0 with 12 rules applied. Total rules applied 82 place count 244 transition count 720
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 88 place count 241 transition count 720
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 94 place count 241 transition count 714
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 95 place count 241 transition count 713
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 96 place count 240 transition count 713
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 101 place count 240 transition count 713
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 103 place count 238 transition count 709
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 238 transition count 709
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 107 place count 238 transition count 707
Applied a total of 107 rules in 90 ms. Remains 238 /285 variables (removed 47) and now considering 707/775 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 238/285 places, 707/775 transitions.
RANDOM walk for 4000000 steps (137884 resets) in 27370 ms. (146 steps per ms) remains 60/63 properties
BEST_FIRST walk for 400004 steps (2637 resets) in 597 ms. (668 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (2647 resets) in 576 ms. (693 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (2665 resets) in 578 ms. (690 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (2628 resets) in 590 ms. (676 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (2660 resets) in 629 ms. (634 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (2653 resets) in 581 ms. (687 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (2629 resets) in 572 ms. (698 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (2697 resets) in 575 ms. (694 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (2650 resets) in 577 ms. (692 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (2649 resets) in 577 ms. (692 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (2644 resets) in 591 ms. (675 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (2654 resets) in 583 ms. (684 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (2630 resets) in 584 ms. (683 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (2686 resets) in 577 ms. (692 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (2654 resets) in 578 ms. (690 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (2655 resets) in 576 ms. (693 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (2634 resets) in 587 ms. (680 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (2659 resets) in 956 ms. (417 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (2685 resets) in 848 ms. (471 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (2713 resets) in 594 ms. (672 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (2649 resets) in 584 ms. (683 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (2715 resets) in 586 ms. (681 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (2698 resets) in 594 ms. (672 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (2609 resets) in 580 ms. (688 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (2674 resets) in 581 ms. (687 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (2683 resets) in 578 ms. (690 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (2664 resets) in 581 ms. (687 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (2638 resets) in 582 ms. (686 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (2672 resets) in 581 ms. (687 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (2698 resets) in 586 ms. (681 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (2647 resets) in 575 ms. (694 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (2656 resets) in 573 ms. (696 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (2677 resets) in 582 ms. (686 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (2636 resets) in 585 ms. (682 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (2628 resets) in 592 ms. (674 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (2702 resets) in 586 ms. (681 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (2630 resets) in 583 ms. (684 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (2638 resets) in 583 ms. (684 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (2645 resets) in 586 ms. (681 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (2613 resets) in 589 ms. (677 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (2690 resets) in 581 ms. (687 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (2633 resets) in 575 ms. (694 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (2731 resets) in 580 ms. (688 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (2714 resets) in 573 ms. (696 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (2625 resets) in 584 ms. (683 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (2725 resets) in 586 ms. (681 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (2706 resets) in 594 ms. (672 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (2727 resets) in 585 ms. (682 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (2704 resets) in 587 ms. (680 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (2636 resets) in 580 ms. (688 steps per ms) remains 60/60 properties
Interrupted probabilistic random walk after 4644178 steps, run timeout after 48001 ms. (steps per millisecond=96 ) properties seen :18 out of 60
Probabilistic random walk after 4644178 steps, saw 1443339 distinct states, run finished after 48014 ms. (steps per millisecond=96 ) properties seen :18
[2024-06-02 21:21:33] [INFO ] Flow matrix only has 696 transitions (discarded 11 similar events)
// Phase 1: matrix 696 rows 238 cols
[2024-06-02 21:21:33] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:21:33] [INFO ] State equation strengthened by 104 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 85/127 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 93/220 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 696/916 variables, 220/230 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/916 variables, 104/334 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/916 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 18/934 variables, 18/352 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/934 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 0/934 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 934/934 variables, and 352 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1951 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 238/238 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 85/127 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 93/220 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-06-02 21:21:36] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 1 ms to minimize.
[2024-06-02 21:21:36] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 1 ms to minimize.
[2024-06-02 21:21:36] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 1 ms to minimize.
[2024-06-02 21:21:36] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:21:36] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 696/916 variables, 220/235 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/916 variables, 104/339 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/916 variables, 42/381 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/916 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 18/934 variables, 18/399 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/934 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 0/934 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 934/934 variables, and 399 constraints, problems are : Problem set: 0 solved, 42 unsolved in 4629 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 238/238 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 5/5 constraints]
After SMT, in 6604ms problems are : Problem set: 0 solved, 42 unsolved
Fused 42 Parikh solutions to 41 different solutions.
Parikh walk visited 0 properties in 2929 ms.
Support contains 42 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 707/707 transitions.
Graph (complete) has 1217 edges and 238 vertex of which 236 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 236 transition count 706
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 235 transition count 706
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5 place count 233 transition count 704
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 233 transition count 704
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 13 place count 230 transition count 701
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 16 place count 227 transition count 695
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 227 transition count 695
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 21 place count 226 transition count 698
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 225 transition count 688
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 225 transition count 688
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 224 transition count 686
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 224 transition count 686
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 223 transition count 681
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 223 transition count 681
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 222 transition count 679
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 222 transition count 679
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 221 transition count 674
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 221 transition count 674
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 220 transition count 672
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 220 transition count 672
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 219 transition count 667
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 219 transition count 667
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 218 transition count 665
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 218 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 217 transition count 660
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 217 transition count 660
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 216 transition count 658
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 216 transition count 658
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 215 transition count 655
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 215 transition count 655
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 214 transition count 653
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 214 transition count 653
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 214 transition count 652
Applied a total of 46 rules in 81 ms. Remains 214 /238 variables (removed 24) and now considering 652/707 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 214/238 places, 652/707 transitions.
RANDOM walk for 4000000 steps (137946 resets) in 24353 ms. (164 steps per ms) remains 40/42 properties
BEST_FIRST walk for 400003 steps (2652 resets) in 535 ms. (746 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2628 resets) in 518 ms. (770 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (2658 resets) in 525 ms. (760 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400001 steps (2665 resets) in 530 ms. (753 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2685 resets) in 522 ms. (764 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (2658 resets) in 511 ms. (781 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2644 resets) in 520 ms. (767 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (2726 resets) in 524 ms. (761 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (2662 resets) in 524 ms. (761 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (2649 resets) in 526 ms. (759 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (2672 resets) in 520 ms. (767 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2567 resets) in 525 ms. (760 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (2681 resets) in 521 ms. (766 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2669 resets) in 517 ms. (772 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (2679 resets) in 515 ms. (775 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400001 steps (2636 resets) in 514 ms. (776 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2660 resets) in 530 ms. (753 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (2634 resets) in 523 ms. (763 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2652 resets) in 517 ms. (772 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (2694 resets) in 524 ms. (761 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2689 resets) in 517 ms. (772 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2643 resets) in 518 ms. (770 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400000 steps (2662 resets) in 522 ms. (764 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (2676 resets) in 517 ms. (772 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (2698 resets) in 520 ms. (767 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2650 resets) in 522 ms. (764 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2684 resets) in 529 ms. (754 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2686 resets) in 520 ms. (767 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (2677 resets) in 514 ms. (776 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2638 resets) in 520 ms. (767 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400002 steps (2723 resets) in 521 ms. (766 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2647 resets) in 523 ms. (763 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400002 steps (2645 resets) in 515 ms. (775 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2695 resets) in 510 ms. (782 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2682 resets) in 515 ms. (775 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2669 resets) in 523 ms. (763 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400002 steps (2701 resets) in 517 ms. (772 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2649 resets) in 529 ms. (754 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2687 resets) in 520 ms. (767 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (2700 resets) in 515 ms. (775 steps per ms) remains 40/40 properties
Interrupted probabilistic random walk after 3955227 steps, run timeout after 39001 ms. (steps per millisecond=101 ) properties seen :3 out of 40
Probabilistic random walk after 3955227 steps, saw 1224096 distinct states, run finished after 39001 ms. (steps per millisecond=101 ) properties seen :3
[2024-06-02 21:22:35] [INFO ] Flow matrix only has 641 transitions (discarded 11 similar events)
// Phase 1: matrix 641 rows 214 cols
[2024-06-02 21:22:35] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 21:22:35] [INFO ] State equation strengthened by 98 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 85/122 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 75/197 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 641/838 variables, 197/207 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/838 variables, 98/305 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/838 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 17/855 variables, 17/322 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/855 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 0/855 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 855/855 variables, and 322 constraints, problems are : Problem set: 0 solved, 37 unsolved in 1566 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 214/214 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 85/122 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 75/197 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-02 21:22:37] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 2 ms to minimize.
[2024-06-02 21:22:37] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:22:37] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-02 21:22:37] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 1 ms to minimize.
[2024-06-02 21:22:37] [INFO ] Deduced a trap composed of 61 places in 40 ms of which 0 ms to minimize.
[2024-06-02 21:22:38] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 641/838 variables, 197/213 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/838 variables, 98/311 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/838 variables, 37/348 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/838 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 17/855 variables, 17/365 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-02 21:22:39] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/855 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/855 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (OVERLAPS) 0/855 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 855/855 variables, and 366 constraints, problems are : Problem set: 0 solved, 37 unsolved in 4233 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 214/214 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 7/7 constraints]
After SMT, in 5817ms problems are : Problem set: 0 solved, 37 unsolved
Fused 37 Parikh solutions to 36 different solutions.
Parikh walk visited 0 properties in 2857 ms.
Support contains 37 out of 214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 652/652 transitions.
Graph (complete) has 1115 edges and 214 vertex of which 212 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 212 transition count 651
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 211 transition count 651
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 209 transition count 649
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 209 transition count 649
Applied a total of 7 rules in 30 ms. Remains 209 /214 variables (removed 5) and now considering 649/652 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 209/214 places, 649/652 transitions.
RANDOM walk for 4000000 steps (137638 resets) in 24054 ms. (166 steps per ms) remains 29/37 properties
BEST_FIRST walk for 400004 steps (2662 resets) in 511 ms. (781 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (2708 resets) in 495 ms. (806 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2621 resets) in 508 ms. (785 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2670 resets) in 508 ms. (785 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2688 resets) in 497 ms. (803 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2688 resets) in 498 ms. (801 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2655 resets) in 499 ms. (800 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2663 resets) in 502 ms. (795 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2645 resets) in 499 ms. (800 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (2675 resets) in 500 ms. (798 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2696 resets) in 497 ms. (803 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2693 resets) in 498 ms. (801 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2649 resets) in 503 ms. (793 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2647 resets) in 496 ms. (804 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2708 resets) in 509 ms. (784 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (2681 resets) in 505 ms. (790 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2682 resets) in 495 ms. (806 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2683 resets) in 505 ms. (790 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2673 resets) in 497 ms. (803 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2646 resets) in 487 ms. (819 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2640 resets) in 519 ms. (769 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2629 resets) in 490 ms. (814 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2682 resets) in 483 ms. (826 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2662 resets) in 488 ms. (818 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2625 resets) in 488 ms. (818 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2661 resets) in 494 ms. (808 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2639 resets) in 499 ms. (800 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2682 resets) in 484 ms. (824 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2688 resets) in 485 ms. (823 steps per ms) remains 29/29 properties
[2024-06-02 21:22:57] [INFO ] Flow matrix only has 638 transitions (discarded 11 similar events)
// Phase 1: matrix 638 rows 209 cols
[2024-06-02 21:22:57] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 21:22:57] [INFO ] State equation strengthened by 98 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 92/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 75/196 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 638/834 variables, 196/206 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/834 variables, 98/304 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/834 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 13/847 variables, 13/317 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/847 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/847 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 847/847 variables, and 317 constraints, problems are : Problem set: 0 solved, 29 unsolved in 1232 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 209/209 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 92/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 75/196 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 21:22:59] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-02 21:22:59] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 4 ms to minimize.
[2024-06-02 21:22:59] [INFO ] Deduced a trap composed of 115 places in 101 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 638/834 variables, 196/209 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/834 variables, 98/307 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/834 variables, 29/336 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/834 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 13/847 variables, 13/349 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/847 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/847 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 847/847 variables, and 349 constraints, problems are : Problem set: 0 solved, 29 unsolved in 2811 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 209/209 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 3/3 constraints]
After SMT, in 4058ms problems are : Problem set: 0 solved, 29 unsolved
Parikh walk visited 0 properties in 3931 ms.
Support contains 29 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 649/649 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 209 transition count 648
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 208 transition count 648
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 0 with 2 rules applied. Total rules applied 4 place count 207 transition count 647
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 206 transition count 644
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 206 transition count 644
Applied a total of 6 rules in 16 ms. Remains 206 /209 variables (removed 3) and now considering 644/649 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 206/209 places, 644/649 transitions.
RANDOM walk for 4000000 steps (137918 resets) in 21629 ms. (184 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (2671 resets) in 490 ms. (814 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2667 resets) in 492 ms. (811 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2661 resets) in 499 ms. (800 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2667 resets) in 497 ms. (803 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2669 resets) in 491 ms. (813 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2676 resets) in 493 ms. (809 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2679 resets) in 489 ms. (816 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2613 resets) in 486 ms. (821 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2714 resets) in 499 ms. (800 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2681 resets) in 493 ms. (809 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2686 resets) in 492 ms. (811 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2639 resets) in 497 ms. (803 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2646 resets) in 499 ms. (800 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (2651 resets) in 496 ms. (804 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2636 resets) in 489 ms. (816 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2681 resets) in 497 ms. (803 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2665 resets) in 494 ms. (808 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (2652 resets) in 497 ms. (803 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (2637 resets) in 500 ms. (798 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2658 resets) in 494 ms. (808 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2691 resets) in 498 ms. (801 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2628 resets) in 504 ms. (792 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2678 resets) in 490 ms. (814 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2681 resets) in 507 ms. (787 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2636 resets) in 500 ms. (798 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2703 resets) in 493 ms. (809 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2600 resets) in 489 ms. (816 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (2637 resets) in 498 ms. (801 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (2716 resets) in 490 ms. (814 steps per ms) remains 29/29 properties
Interrupted probabilistic random walk after 3269822 steps, run timeout after 33001 ms. (steps per millisecond=99 ) properties seen :0 out of 29
Probabilistic random walk after 3269822 steps, saw 1025478 distinct states, run finished after 33001 ms. (steps per millisecond=99 ) properties seen :0
[2024-06-02 21:23:50] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
// Phase 1: matrix 633 rows 206 cols
[2024-06-02 21:23:50] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:23:50] [INFO ] State equation strengthened by 98 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 89/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 75/193 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 633/826 variables, 193/203 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/826 variables, 98/301 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/826 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 13/839 variables, 13/314 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 839/839 variables, and 314 constraints, problems are : Problem set: 0 solved, 29 unsolved in 1213 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 89/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 75/193 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 21:23:51] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:23:52] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-06-02 21:23:52] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
[2024-06-02 21:23:52] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:23:52] [INFO ] Deduced a trap composed of 113 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 633/826 variables, 193/208 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/826 variables, 98/306 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/826 variables, 29/335 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/826 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 13/839 variables, 13/348 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/839 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/839 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 839/839 variables, and 348 constraints, problems are : Problem set: 0 solved, 29 unsolved in 2981 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints]
After SMT, in 4211ms problems are : Problem set: 0 solved, 29 unsolved
Fused 29 Parikh solutions to 28 different solutions.
Parikh walk visited 0 properties in 1973 ms.
Support contains 29 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 644/644 transitions.
Applied a total of 0 rules in 7 ms. Remains 206 /206 variables (removed 0) and now considering 644/644 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 206/206 places, 644/644 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 644/644 transitions.
Applied a total of 0 rules in 7 ms. Remains 206 /206 variables (removed 0) and now considering 644/644 (removed 0) transitions.
[2024-06-02 21:23:56] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
[2024-06-02 21:23:56] [INFO ] Invariant cache hit.
[2024-06-02 21:23:56] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-02 21:23:56] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
[2024-06-02 21:23:56] [INFO ] Invariant cache hit.
[2024-06-02 21:23:56] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-06-02 21:23:57] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 784 ms to find 0 implicit places.
[2024-06-02 21:23:57] [INFO ] Redundant transitions in 36 ms returned []
Running 636 sub problems to find dead transitions.
[2024-06-02 21:23:57] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
[2024-06-02 21:23:57] [INFO ] Invariant cache hit.
[2024-06-02 21:23:57] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 636 unsolved
[2024-06-02 21:24:02] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-06-02 21:24:02] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2024-06-02 21:24:03] [INFO ] Deduced a trap composed of 56 places in 106 ms of which 1 ms to minimize.
[2024-06-02 21:24:03] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 1 ms to minimize.
[2024-06-02 21:24:03] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 0 ms to minimize.
[2024-06-02 21:24:03] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-02 21:24:03] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 0 ms to minimize.
[2024-06-02 21:24:03] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2024-06-02 21:24:03] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2024-06-02 21:24:03] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 0 ms to minimize.
[2024-06-02 21:24:04] [INFO ] Deduced a trap composed of 156 places in 92 ms of which 2 ms to minimize.
[2024-06-02 21:24:06] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 636 unsolved
[2024-06-02 21:24:10] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 5 (OVERLAPS) 633/837 variables, 204/227 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 98/325 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 8 (OVERLAPS) 2/839 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 839/839 variables, and 327 constraints, problems are : Problem set: 0 solved, 636 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 636/636 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 636 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 4 (OVERLAPS) 633/837 variables, 204/227 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/837 variables, 98/325 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 627/952 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 837/839 variables, and 952 constraints, problems are : Problem set: 0 solved, 636 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 204/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 627/636 constraints, Known Traps: 13/13 constraints]
After SMT, in 61045ms problems are : Problem set: 0 solved, 636 unsolved
Search for dead transitions found 0 dead transitions in 61052ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61890 ms. Remains : 206/206 places, 644/644 transitions.
RANDOM walk for 400000 steps (13827 resets) in 3417 ms. (117 steps per ms) remains 29/29 properties
Running SMT prover for 29 properties.
[2024-06-02 21:24:59] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
[2024-06-02 21:24:59] [INFO ] Invariant cache hit.
[2024-06-02 21:24:59] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:24:59] [INFO ] After 135ms SMT Verify possible using state equation in real domain returned unsat :0 sat :29
[2024-06-02 21:24:59] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-06-02 21:24:59] [INFO ] After 106ms SMT Verify possible using 98 Read/Feed constraints in real domain returned unsat :0 sat :29
TRAPS : Iteration 0
[2024-06-02 21:25:00] [INFO ] After 1126ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:29
[2024-06-02 21:25:00] [INFO ] After 1325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:29
[2024-06-02 21:25:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 21:25:01] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :29
[2024-06-02 21:25:01] [INFO ] After 128ms SMT Verify possible using 98 Read/Feed constraints in natural domain returned unsat :0 sat :29
TRAPS : Iteration 0
[2024-06-02 21:25:01] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-02 21:25:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
TRAPS : Iteration 1
[2024-06-02 21:25:02] [INFO ] After 1843ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :29
[2024-06-02 21:25:03] [INFO ] After 2096ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :29
RANDOM walk for 4000000 steps (138253 resets) in 20614 ms. (194 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2696 resets) in 487 ms. (819 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2636 resets) in 462 ms. (863 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2650 resets) in 468 ms. (852 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2702 resets) in 470 ms. (849 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (2666 resets) in 469 ms. (851 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2679 resets) in 464 ms. (860 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2690 resets) in 474 ms. (842 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (2641 resets) in 466 ms. (856 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2667 resets) in 473 ms. (843 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2644 resets) in 468 ms. (852 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (2740 resets) in 470 ms. (849 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (2667 resets) in 481 ms. (829 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (2612 resets) in 467 ms. (854 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2642 resets) in 472 ms. (845 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2602 resets) in 467 ms. (854 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2630 resets) in 473 ms. (843 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2667 resets) in 473 ms. (843 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2635 resets) in 463 ms. (862 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2687 resets) in 471 ms. (847 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (2700 resets) in 471 ms. (847 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (2626 resets) in 468 ms. (852 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2628 resets) in 464 ms. (860 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2689 resets) in 458 ms. (871 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2664 resets) in 464 ms. (860 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2629 resets) in 473 ms. (843 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2645 resets) in 704 ms. (567 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2632 resets) in 475 ms. (840 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2673 resets) in 466 ms. (856 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2686 resets) in 467 ms. (854 steps per ms) remains 29/29 properties
Interrupted probabilistic random walk after 3187599 steps, run timeout after 27001 ms. (steps per millisecond=118 ) properties seen :0 out of 29
Probabilistic random walk after 3187599 steps, saw 997079 distinct states, run finished after 27002 ms. (steps per millisecond=118 ) properties seen :0
[2024-06-02 21:25:39] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
[2024-06-02 21:25:39] [INFO ] Invariant cache hit.
[2024-06-02 21:25:39] [INFO ] State equation strengthened by 98 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 89/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 75/193 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 633/826 variables, 193/203 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/826 variables, 98/301 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/826 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 13/839 variables, 13/314 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 839/839 variables, and 314 constraints, problems are : Problem set: 0 solved, 29 unsolved in 1247 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 89/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 75/193 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 21:25:41] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 2 ms to minimize.
[2024-06-02 21:25:41] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
[2024-06-02 21:25:41] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2024-06-02 21:25:41] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 633/826 variables, 193/207 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/826 variables, 98/305 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/826 variables, 29/334 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/826 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 13/839 variables, 13/347 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/839 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/839 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 839/839 variables, and 347 constraints, problems are : Problem set: 0 solved, 29 unsolved in 2814 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 4/4 constraints]
After SMT, in 4085ms problems are : Problem set: 0 solved, 29 unsolved
Parikh walk visited 0 properties in 4807 ms.
Support contains 29 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 644/644 transitions.
Applied a total of 0 rules in 8 ms. Remains 206 /206 variables (removed 0) and now considering 644/644 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 206/206 places, 644/644 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 644/644 transitions.
Applied a total of 0 rules in 7 ms. Remains 206 /206 variables (removed 0) and now considering 644/644 (removed 0) transitions.
[2024-06-02 21:25:48] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
[2024-06-02 21:25:48] [INFO ] Invariant cache hit.
[2024-06-02 21:25:48] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-02 21:25:48] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
[2024-06-02 21:25:48] [INFO ] Invariant cache hit.
[2024-06-02 21:25:48] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-06-02 21:25:49] [INFO ] Implicit Places using invariants and state equation in 669 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
[2024-06-02 21:25:49] [INFO ] Redundant transitions in 13 ms returned []
Running 636 sub problems to find dead transitions.
[2024-06-02 21:25:49] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
[2024-06-02 21:25:49] [INFO ] Invariant cache hit.
[2024-06-02 21:25:49] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 636 unsolved
[2024-06-02 21:25:54] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:25:54] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-06-02 21:25:54] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 2 ms to minimize.
[2024-06-02 21:25:54] [INFO ] Deduced a trap composed of 60 places in 40 ms of which 0 ms to minimize.
[2024-06-02 21:25:54] [INFO ] Deduced a trap composed of 60 places in 40 ms of which 1 ms to minimize.
[2024-06-02 21:25:54] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-02 21:25:54] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2024-06-02 21:25:55] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 2 ms to minimize.
[2024-06-02 21:25:55] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 2 ms to minimize.
[2024-06-02 21:25:55] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
[2024-06-02 21:25:55] [INFO ] Deduced a trap composed of 156 places in 92 ms of which 1 ms to minimize.
[2024-06-02 21:25:58] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 636 unsolved
[2024-06-02 21:26:02] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 5 (OVERLAPS) 633/837 variables, 204/227 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 98/325 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 8 (OVERLAPS) 2/839 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 839/839 variables, and 327 constraints, problems are : Problem set: 0 solved, 636 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 636/636 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 636 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 4 (OVERLAPS) 633/837 variables, 204/227 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/837 variables, 98/325 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 627/952 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 837/839 variables, and 952 constraints, problems are : Problem set: 0 solved, 636 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 204/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 627/636 constraints, Known Traps: 13/13 constraints]
After SMT, in 60872ms problems are : Problem set: 0 solved, 636 unsolved
Search for dead transitions found 0 dead transitions in 60878ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61693 ms. Remains : 206/206 places, 644/644 transitions.
RANDOM walk for 400000 steps (13893 resets) in 3280 ms. (121 steps per ms) remains 29/29 properties
Running SMT prover for 29 properties.
[2024-06-02 21:26:51] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
[2024-06-02 21:26:51] [INFO ] Invariant cache hit.
[2024-06-02 21:26:51] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:26:51] [INFO ] After 134ms SMT Verify possible using state equation in real domain returned unsat :0 sat :29
[2024-06-02 21:26:51] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-06-02 21:26:51] [INFO ] After 103ms SMT Verify possible using 98 Read/Feed constraints in real domain returned unsat :0 sat :29
TRAPS : Iteration 0
[2024-06-02 21:26:52] [INFO ] After 1048ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:29
[2024-06-02 21:26:52] [INFO ] After 1239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:29
[2024-06-02 21:26:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:26:52] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :29
[2024-06-02 21:26:52] [INFO ] After 119ms SMT Verify possible using 98 Read/Feed constraints in natural domain returned unsat :0 sat :29
TRAPS : Iteration 0
[2024-06-02 21:26:53] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 0 ms to minimize.
[2024-06-02 21:26:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
TRAPS : Iteration 1
[2024-06-02 21:26:54] [INFO ] After 1928ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :29
[2024-06-02 21:26:54] [INFO ] After 2176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :29
RANDOM walk for 40000 steps (1375 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (279 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 941734 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :0 out of 1
Probabilistic random walk after 941734 steps, saw 294384 distinct states, run finished after 3001 ms. (steps per millisecond=313 ) properties seen :0
[2024-06-02 21:26:57] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
[2024-06-02 21:26:57] [INFO ] Invariant cache hit.
[2024-06-02 21:26:57] [INFO ] State equation strengthened by 98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 633/823 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 98/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/839 variables, 16/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 839/839 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:26:58] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:26:58] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:26:58] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 633/823 variables, 190/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 98/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/823 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/839 variables, 16/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/839 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/839 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 839/839 variables, and 318 constraints, problems are : Problem set: 0 solved, 1 unsolved in 398 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 583ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 644/644 transitions.
Graph (complete) has 1097 edges and 206 vertex of which 204 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 204 transition count 643
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 203 transition count 643
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5 place count 201 transition count 641
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 201 transition count 641
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 199 transition count 639
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 197 transition count 637
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 197 transition count 637
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 17 place count 196 transition count 640
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 195 transition count 630
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 195 transition count 630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 194 transition count 628
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 194 transition count 628
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 193 transition count 623
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 193 transition count 623
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 192 transition count 621
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 192 transition count 621
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 191 transition count 616
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 191 transition count 616
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 190 transition count 614
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 190 transition count 614
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 189 transition count 609
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 189 transition count 609
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 188 transition count 607
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 188 transition count 607
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 187 transition count 602
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 187 transition count 602
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 186 transition count 600
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 186 transition count 600
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 185 transition count 597
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 185 transition count 597
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 184 transition count 595
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 184 transition count 595
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 42 place count 184 transition count 595
Applied a total of 42 rules in 45 ms. Remains 184 /206 variables (removed 22) and now considering 595/644 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 184/206 places, 595/644 transitions.
RANDOM walk for 40000 steps (1373 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (270 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1270001 steps, run timeout after 3001 ms. (steps per millisecond=423 ) properties seen :0 out of 1
Probabilistic random walk after 1270001 steps, saw 287597 distinct states, run finished after 3001 ms. (steps per millisecond=423 ) properties seen :0
[2024-06-02 21:27:01] [INFO ] Flow matrix only has 584 transitions (discarded 11 similar events)
// Phase 1: matrix 584 rows 184 cols
[2024-06-02 21:27:01] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 21:27:01] [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) 55/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 116/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 584/756 variables, 172/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 93/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/768 variables, 12/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/768 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/768 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 768/768 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 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) 55/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 116/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:27:01] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-06-02 21:27:01] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 1 ms to minimize.
[2024-06-02 21:27:01] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 584/756 variables, 172/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 93/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/756 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/756 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/768 variables, 12/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/768 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/768 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 768/768 variables, and 291 constraints, problems are : Problem set: 0 solved, 1 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 641ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 595/595 transitions.
Applied a total of 0 rules in 7 ms. Remains 184 /184 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 184/184 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 595/595 transitions.
Applied a total of 0 rules in 13 ms. Remains 184 /184 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-06-02 21:27:02] [INFO ] Flow matrix only has 584 transitions (discarded 11 similar events)
[2024-06-02 21:27:02] [INFO ] Invariant cache hit.
[2024-06-02 21:27:02] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 21:27:02] [INFO ] Flow matrix only has 584 transitions (discarded 11 similar events)
[2024-06-02 21:27:02] [INFO ] Invariant cache hit.
[2024-06-02 21:27:02] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-06-02 21:27:02] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2024-06-02 21:27:02] [INFO ] Redundant transitions in 7 ms returned []
Running 587 sub problems to find dead transitions.
[2024-06-02 21:27:02] [INFO ] Flow matrix only has 584 transitions (discarded 11 similar events)
[2024-06-02 21:27:02] [INFO ] Invariant cache hit.
[2024-06-02 21:27:02] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 587 unsolved
[2024-06-02 21:27:07] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
[2024-06-02 21:27:07] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-06-02 21:27:07] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 0 ms to minimize.
[2024-06-02 21:27:07] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:27:07] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2024-06-02 21:27:07] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-06-02 21:27:08] [INFO ] Deduced a trap composed of 138 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:27:09] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 1 ms to minimize.
[2024-06-02 21:27:10] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 4 (OVERLAPS) 584/768 variables, 184/203 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/768 variables, 93/296 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/768 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 7 (OVERLAPS) 0/768 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 587 unsolved
No progress, stopping.
After SMT solving in domain Real declared 768/768 variables, and 296 constraints, problems are : Problem set: 0 solved, 587 unsolved in 27017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 587/587 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 587 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 4 (OVERLAPS) 584/768 variables, 184/203 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/768 variables, 93/296 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/768 variables, 587/883 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/768 variables, and 883 constraints, problems are : Problem set: 0 solved, 587 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 587/587 constraints, Known Traps: 9/9 constraints]
After SMT, in 57818ms problems are : Problem set: 0 solved, 587 unsolved
Search for dead transitions found 0 dead transitions in 57825ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58353 ms. Remains : 184/184 places, 595/595 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 114 edges and 184 vertex of which 29 / 184 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 145 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 153 transition count 420
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 153 transition count 420
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 153 transition count 414
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 21 place count 152 transition count 413
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 54 place count 152 transition count 380
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 152 transition count 374
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 69 place count 146 transition count 371
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 69 place count 146 transition count 368
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 143 transition count 368
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 142 transition count 367
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 142 transition count 366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 141 transition count 365
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 140 transition count 326
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 140 transition count 326
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 140 transition count 323
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 88 place count 137 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 94 place count 137 transition count 317
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 137 transition count 314
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 100 place count 134 transition count 314
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 105 place count 134 transition count 314
Applied a total of 105 rules in 43 ms. Remains 134 /184 variables (removed 50) and now considering 314/595 (removed 281) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:28:00] [INFO ] Flow matrix only has 310 transitions (discarded 4 similar events)
// Phase 1: matrix 310 rows 134 cols
[2024-06-02 21:28:00] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 21:28:00] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:28:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-02 21:28:00] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:28:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:28:00] [INFO ] After 10ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:28:00] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:28:00] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 225 ms.
RANDOM walk for 40000 steps (1386 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (256 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 936228 steps, run timeout after 3001 ms. (steps per millisecond=311 ) properties seen :0 out of 1
Probabilistic random walk after 936228 steps, saw 293035 distinct states, run finished after 3001 ms. (steps per millisecond=311 ) properties seen :0
[2024-06-02 21:28:03] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
// Phase 1: matrix 633 rows 206 cols
[2024-06-02 21:28:03] [INFO ] Computed 10 invariants in 10 ms
[2024-06-02 21:28:03] [INFO ] State equation strengthened by 98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 633/823 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 98/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/839 variables, 16/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 839/839 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:28:04] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 633/823 variables, 190/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 98/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/823 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:28:04] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/823 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/839 variables, 16/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/839 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/839 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 839/839 variables, and 317 constraints, problems are : Problem set: 0 solved, 1 unsolved in 406 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 606ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 644/644 transitions.
Graph (complete) has 1097 edges and 206 vertex of which 204 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 204 transition count 642
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 202 transition count 642
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 7 place count 200 transition count 640
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 200 transition count 640
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 2 with 2 rules applied. Total rules applied 11 place count 199 transition count 639
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 198 transition count 638
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 198 transition count 638
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 196 transition count 644
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 195 transition count 634
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 195 transition count 634
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 194 transition count 632
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 194 transition count 632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 193 transition count 627
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 193 transition count 627
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 192 transition count 625
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 192 transition count 625
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 191 transition count 620
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 191 transition count 620
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 190 transition count 618
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 190 transition count 618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 189 transition count 613
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 189 transition count 613
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 188 transition count 611
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 188 transition count 611
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 187 transition count 606
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 187 transition count 606
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 186 transition count 604
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 186 transition count 604
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 185 transition count 601
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 185 transition count 601
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 184 transition count 599
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 184 transition count 599
Applied a total of 41 rules in 40 ms. Remains 184 /206 variables (removed 22) and now considering 599/644 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 184/206 places, 599/644 transitions.
RANDOM walk for 40000 steps (1403 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (276 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1230345 steps, run timeout after 3001 ms. (steps per millisecond=409 ) properties seen :0 out of 1
Probabilistic random walk after 1230345 steps, saw 278679 distinct states, run finished after 3001 ms. (steps per millisecond=409 ) properties seen :0
[2024-06-02 21:28:07] [INFO ] Flow matrix only has 588 transitions (discarded 11 similar events)
// Phase 1: matrix 588 rows 184 cols
[2024-06-02 21:28:07] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:28:07] [INFO ] State equation strengthened by 94 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) 55/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 116/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 588/760 variables, 172/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/760 variables, 94/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/760 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/772 variables, 12/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/772 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/772 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 772/772 variables, and 288 constraints, problems are : Problem set: 0 solved, 1 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 94/94 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) 55/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 116/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:28:07] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2024-06-02 21:28:07] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 588/760 variables, 172/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/760 variables, 94/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:28:08] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/760 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/760 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/772 variables, 12/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/772 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/772 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 772/772 variables, and 292 constraints, problems are : Problem set: 0 solved, 1 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 647ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 599/599 transitions.
Applied a total of 0 rules in 7 ms. Remains 184 /184 variables (removed 0) and now considering 599/599 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 184/184 places, 599/599 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 599/599 transitions.
Applied a total of 0 rules in 6 ms. Remains 184 /184 variables (removed 0) and now considering 599/599 (removed 0) transitions.
[2024-06-02 21:28:08] [INFO ] Flow matrix only has 588 transitions (discarded 11 similar events)
[2024-06-02 21:28:08] [INFO ] Invariant cache hit.
[2024-06-02 21:28:08] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-02 21:28:08] [INFO ] Flow matrix only has 588 transitions (discarded 11 similar events)
[2024-06-02 21:28:08] [INFO ] Invariant cache hit.
[2024-06-02 21:28:08] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 21:28:08] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2024-06-02 21:28:08] [INFO ] Redundant transitions in 12 ms returned []
Running 591 sub problems to find dead transitions.
[2024-06-02 21:28:08] [INFO ] Flow matrix only has 588 transitions (discarded 11 similar events)
[2024-06-02 21:28:08] [INFO ] Invariant cache hit.
[2024-06-02 21:28:08] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-02 21:28:13] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-06-02 21:28:13] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 1 ms to minimize.
[2024-06-02 21:28:13] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-06-02 21:28:13] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2024-06-02 21:28:13] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 2 ms to minimize.
[2024-06-02 21:28:13] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-06-02 21:28:14] [INFO ] Deduced a trap composed of 138 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:28:15] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 4 (OVERLAPS) 588/772 variables, 184/202 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/772 variables, 94/296 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/772 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 7 (OVERLAPS) 0/772 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 591 unsolved
No progress, stopping.
After SMT solving in domain Real declared 772/772 variables, and 296 constraints, problems are : Problem set: 0 solved, 591 unsolved in 25802 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 4 (OVERLAPS) 588/772 variables, 184/202 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/772 variables, 94/296 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/772 variables, 591/887 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-02 21:28:50] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/772 variables, 1/888 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 772/772 variables, and 888 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 9/9 constraints]
After SMT, in 56563ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 56568ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57073 ms. Remains : 184/184 places, 599/599 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 115 edges and 184 vertex of which 29 / 184 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 145 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 153 transition count 424
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 153 transition count 424
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 153 transition count 418
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 21 place count 152 transition count 417
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 54 place count 152 transition count 384
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 152 transition count 378
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 69 place count 146 transition count 375
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 69 place count 146 transition count 372
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 143 transition count 372
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 142 transition count 371
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 142 transition count 370
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 141 transition count 369
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 140 transition count 329
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 140 transition count 329
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 140 transition count 326
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 88 place count 137 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 94 place count 137 transition count 320
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 137 transition count 317
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 100 place count 134 transition count 317
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 107 place count 134 transition count 317
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 108 place count 134 transition count 316
Applied a total of 108 rules in 46 ms. Remains 134 /184 variables (removed 50) and now considering 316/599 (removed 283) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:29:05] [INFO ] Flow matrix only has 312 transitions (discarded 4 similar events)
// Phase 1: matrix 312 rows 134 cols
[2024-06-02 21:29:05] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 21:29:05] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:29:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:29:05] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:29:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:29:05] [INFO ] After 11ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:29:05] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:29:05] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 241 ms.
RANDOM walk for 40000 steps (1386 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (256 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 941203 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :0 out of 1
Probabilistic random walk after 941203 steps, saw 294260 distinct states, run finished after 3001 ms. (steps per millisecond=313 ) properties seen :0
[2024-06-02 21:29:08] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
// Phase 1: matrix 633 rows 206 cols
[2024-06-02 21:29:08] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 21:29:08] [INFO ] State equation strengthened by 98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 633/823 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 98/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/839 variables, 16/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 839/839 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:29:08] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:29:08] [INFO ] Deduced a trap composed of 44 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 633/823 variables, 190/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 98/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/823 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:29:09] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/823 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/839 variables, 16/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/839 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/839 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 839/839 variables, and 318 constraints, problems are : Problem set: 0 solved, 1 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 670ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 644/644 transitions.
Graph (complete) has 1097 edges and 206 vertex of which 204 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 204 transition count 642
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 202 transition count 642
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 7 place count 200 transition count 640
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 200 transition count 640
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 13 place count 198 transition count 638
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 197 transition count 637
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 197 transition count 637
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 17 place count 196 transition count 640
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 195 transition count 630
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 195 transition count 630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 194 transition count 628
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 194 transition count 628
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 193 transition count 623
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 193 transition count 623
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 192 transition count 621
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 192 transition count 621
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 191 transition count 616
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 191 transition count 616
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 190 transition count 614
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 190 transition count 614
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 189 transition count 609
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 189 transition count 609
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 188 transition count 607
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 188 transition count 607
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 187 transition count 602
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 187 transition count 602
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 186 transition count 600
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 186 transition count 600
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 185 transition count 597
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 185 transition count 597
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 184 transition count 595
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 184 transition count 595
Applied a total of 41 rules in 40 ms. Remains 184 /206 variables (removed 22) and now considering 595/644 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 184/206 places, 595/644 transitions.
RANDOM walk for 40000 steps (1398 resets) in 208 ms. (191 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (274 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1313600 steps, run timeout after 3001 ms. (steps per millisecond=437 ) properties seen :0 out of 1
Probabilistic random walk after 1313600 steps, saw 300241 distinct states, run finished after 3001 ms. (steps per millisecond=437 ) properties seen :0
[2024-06-02 21:29:12] [INFO ] Flow matrix only has 584 transitions (discarded 11 similar events)
// Phase 1: matrix 584 rows 184 cols
[2024-06-02 21:29:12] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 21:29:12] [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) 55/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 116/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 584/756 variables, 172/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 93/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/768 variables, 12/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/768 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/768 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 768/768 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 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) 55/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 116/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:29:12] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2024-06-02 21:29:12] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:29:12] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 584/756 variables, 172/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 93/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/756 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/756 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/768 variables, 12/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/768 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/768 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 768/768 variables, and 291 constraints, problems are : Problem set: 0 solved, 1 unsolved in 389 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 582ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 595/595 transitions.
Applied a total of 0 rules in 6 ms. Remains 184 /184 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 184/184 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 595/595 transitions.
Applied a total of 0 rules in 6 ms. Remains 184 /184 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-06-02 21:29:12] [INFO ] Flow matrix only has 584 transitions (discarded 11 similar events)
[2024-06-02 21:29:12] [INFO ] Invariant cache hit.
[2024-06-02 21:29:13] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 21:29:13] [INFO ] Flow matrix only has 584 transitions (discarded 11 similar events)
[2024-06-02 21:29:13] [INFO ] Invariant cache hit.
[2024-06-02 21:29:13] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-06-02 21:29:13] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
[2024-06-02 21:29:13] [INFO ] Redundant transitions in 7 ms returned []
Running 587 sub problems to find dead transitions.
[2024-06-02 21:29:13] [INFO ] Flow matrix only has 584 transitions (discarded 11 similar events)
[2024-06-02 21:29:13] [INFO ] Invariant cache hit.
[2024-06-02 21:29:13] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 587 unsolved
[2024-06-02 21:29:17] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-02 21:29:17] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:29:17] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-02 21:29:17] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 0 ms to minimize.
[2024-06-02 21:29:18] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 1 ms to minimize.
[2024-06-02 21:29:18] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 1 ms to minimize.
[2024-06-02 21:29:18] [INFO ] Deduced a trap composed of 138 places in 88 ms of which 1 ms to minimize.
[2024-06-02 21:29:18] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-06-02 21:29:20] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 4 (OVERLAPS) 584/768 variables, 184/203 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/768 variables, 93/296 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/768 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 7 (OVERLAPS) 0/768 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 587 unsolved
No progress, stopping.
After SMT solving in domain Real declared 768/768 variables, and 296 constraints, problems are : Problem set: 0 solved, 587 unsolved in 24383 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 587/587 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 587 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 4 (OVERLAPS) 584/768 variables, 184/203 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/768 variables, 93/296 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/768 variables, 587/883 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/768 variables, and 883 constraints, problems are : Problem set: 0 solved, 587 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 587/587 constraints, Known Traps: 9/9 constraints]
After SMT, in 55055ms problems are : Problem set: 0 solved, 587 unsolved
Search for dead transitions found 0 dead transitions in 55060ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55692 ms. Remains : 184/184 places, 595/595 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 115 edges and 184 vertex of which 29 / 184 are part of one of the 4 SCC in 4 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 145 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 153 transition count 420
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 153 transition count 420
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 153 transition count 414
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 21 place count 152 transition count 413
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 54 place count 152 transition count 380
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 152 transition count 374
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 69 place count 146 transition count 371
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 69 place count 146 transition count 368
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 143 transition count 368
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 142 transition count 367
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 142 transition count 366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 141 transition count 365
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 140 transition count 326
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 140 transition count 326
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 140 transition count 323
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 88 place count 137 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 94 place count 137 transition count 317
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 137 transition count 314
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 100 place count 134 transition count 314
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 106 place count 134 transition count 314
Applied a total of 106 rules in 48 ms. Remains 134 /184 variables (removed 50) and now considering 314/595 (removed 281) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:30:08] [INFO ] Flow matrix only has 310 transitions (discarded 4 similar events)
// Phase 1: matrix 310 rows 134 cols
[2024-06-02 21:30:08] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 21:30:08] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:30:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:30:08] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:30:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:30:08] [INFO ] After 11ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:30:08] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:30:08] [INFO ] After 134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 227 ms.
RANDOM walk for 40000 steps (1396 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (265 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 963589 steps, run timeout after 3001 ms. (steps per millisecond=321 ) properties seen :0 out of 1
Probabilistic random walk after 963589 steps, saw 300270 distinct states, run finished after 3001 ms. (steps per millisecond=321 ) properties seen :0
[2024-06-02 21:30:11] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
// Phase 1: matrix 633 rows 206 cols
[2024-06-02 21:30:11] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 21:30:11] [INFO ] State equation strengthened by 98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 633/823 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 98/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/839 variables, 16/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 839/839 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:30:12] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:30:12] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 633/823 variables, 190/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 98/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/823 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/839 variables, 16/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/839 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/839 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 839/839 variables, and 317 constraints, problems are : Problem set: 0 solved, 1 unsolved in 344 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 540ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 644/644 transitions.
Graph (complete) has 1097 edges and 206 vertex of which 204 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 204 transition count 643
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 203 transition count 642
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 202 transition count 642
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 7 place count 200 transition count 640
Iterating global reduction 3 with 2 rules applied. Total rules applied 9 place count 200 transition count 640
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 3 with 4 rules applied. Total rules applied 13 place count 198 transition count 638
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 15 place count 196 transition count 636
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 196 transition count 636
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 195 transition count 639
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 194 transition count 629
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 194 transition count 629
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 22 place count 193 transition count 627
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 193 transition count 627
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 192 transition count 622
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 192 transition count 622
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 191 transition count 620
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 191 transition count 620
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 190 transition count 615
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 190 transition count 615
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 189 transition count 613
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 189 transition count 613
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 188 transition count 608
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 188 transition count 608
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 187 transition count 606
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 187 transition count 606
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 186 transition count 601
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 186 transition count 601
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 185 transition count 599
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 185 transition count 599
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 184 transition count 596
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 184 transition count 596
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 42 place count 183 transition count 594
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 183 transition count 594
Applied a total of 43 rules in 35 ms. Remains 183 /206 variables (removed 23) and now considering 594/644 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 183/206 places, 594/644 transitions.
RANDOM walk for 40000 steps (1345 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (263 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1305445 steps, run timeout after 3001 ms. (steps per millisecond=435 ) properties seen :0 out of 1
Probabilistic random walk after 1305445 steps, saw 297992 distinct states, run finished after 3001 ms. (steps per millisecond=435 ) properties seen :0
[2024-06-02 21:30:15] [INFO ] Flow matrix only has 583 transitions (discarded 11 similar events)
// Phase 1: matrix 583 rows 183 cols
[2024-06-02 21:30:15] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 21:30:15] [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) 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) 116/171 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 583/754 variables, 171/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/754 variables, 93/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/754 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/766 variables, 12/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/766 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/766 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 766/766 variables, and 286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 183/183 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) 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) 116/171 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:30:15] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-06-02 21:30:15] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
[2024-06-02 21:30:15] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 583/754 variables, 171/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/754 variables, 93/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/754 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/754 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/766 variables, 12/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/766 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/766 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 766/766 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 183/183 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 585ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 594/594 transitions.
Applied a total of 0 rules in 6 ms. Remains 183 /183 variables (removed 0) and now considering 594/594 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 183/183 places, 594/594 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 594/594 transitions.
Applied a total of 0 rules in 6 ms. Remains 183 /183 variables (removed 0) and now considering 594/594 (removed 0) transitions.
[2024-06-02 21:30:16] [INFO ] Flow matrix only has 583 transitions (discarded 11 similar events)
[2024-06-02 21:30:16] [INFO ] Invariant cache hit.
[2024-06-02 21:30:16] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-02 21:30:16] [INFO ] Flow matrix only has 583 transitions (discarded 11 similar events)
[2024-06-02 21:30:16] [INFO ] Invariant cache hit.
[2024-06-02 21:30:16] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-06-02 21:30:16] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
[2024-06-02 21:30:16] [INFO ] Redundant transitions in 8 ms returned []
Running 586 sub problems to find dead transitions.
[2024-06-02 21:30:16] [INFO ] Flow matrix only has 583 transitions (discarded 11 similar events)
[2024-06-02 21:30:16] [INFO ] Invariant cache hit.
[2024-06-02 21:30:16] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-02 21:30:20] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-06-02 21:30:21] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-06-02 21:30:21] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-06-02 21:30:21] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:30:21] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2024-06-02 21:30:21] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2024-06-02 21:30:21] [INFO ] Deduced a trap composed of 137 places in 88 ms of which 1 ms to minimize.
[2024-06-02 21:30:23] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 2 ms to minimize.
[2024-06-02 21:30:24] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 4 (OVERLAPS) 583/766 variables, 183/202 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/766 variables, 93/295 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/766 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 7 (OVERLAPS) 0/766 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 586 unsolved
No progress, stopping.
After SMT solving in domain Real declared 766/766 variables, and 295 constraints, problems are : Problem set: 0 solved, 586 unsolved in 26122 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 183/183 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 586/586 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 586 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 4 (OVERLAPS) 583/766 variables, 183/202 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/766 variables, 93/295 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/766 variables, 586/881 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-02 21:31:07] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/766 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/766 variables, and 882 constraints, problems are : Problem set: 0 solved, 586 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 183/183 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 586/586 constraints, Known Traps: 10/10 constraints]
After SMT, in 56947ms problems are : Problem set: 0 solved, 586 unsolved
Search for dead transitions found 0 dead transitions in 56956ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57461 ms. Remains : 183/183 places, 594/594 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 113 edges and 183 vertex of which 29 / 183 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 145 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 152 transition count 419
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 152 transition count 419
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 152 transition count 413
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 21 place count 151 transition count 412
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 1 with 34 rules applied. Total rules applied 55 place count 151 transition count 378
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 61 place count 151 transition count 372
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 70 place count 145 transition count 369
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 70 place count 145 transition count 366
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 76 place count 142 transition count 366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 141 transition count 365
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 141 transition count 364
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 140 transition count 363
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 82 place count 139 transition count 324
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 139 transition count 324
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 86 place count 139 transition count 321
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 89 place count 136 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 95 place count 136 transition count 315
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 98 place count 136 transition count 312
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 101 place count 133 transition count 312
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 107 place count 133 transition count 312
Applied a total of 107 rules in 46 ms. Remains 133 /183 variables (removed 50) and now considering 312/594 (removed 282) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:31:13] [INFO ] Flow matrix only has 308 transitions (discarded 4 similar events)
// Phase 1: matrix 308 rows 133 cols
[2024-06-02 21:31:13] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 21:31:13] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:31:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:31:13] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:31:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:31:13] [INFO ] After 19ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:31:13] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:31:13] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 221 ms.
RANDOM walk for 40000 steps (1396 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (268 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 982673 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :0 out of 1
Probabilistic random walk after 982673 steps, saw 306162 distinct states, run finished after 3002 ms. (steps per millisecond=327 ) properties seen :0
[2024-06-02 21:31:16] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
// Phase 1: matrix 633 rows 206 cols
[2024-06-02 21:31:16] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 21:31:16] [INFO ] State equation strengthened by 98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 633/823 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 98/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/839 variables, 16/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 839/839 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:31:17] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:31:17] [INFO ] Deduced a trap composed of 44 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 633/823 variables, 190/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 98/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/823 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/839 variables, 16/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/839 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/839 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 839/839 variables, and 317 constraints, problems are : Problem set: 0 solved, 1 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 538ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 644/644 transitions.
Graph (complete) has 1097 edges and 206 vertex of which 204 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 204 transition count 642
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 202 transition count 642
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 7 place count 200 transition count 640
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 200 transition count 640
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 13 place count 198 transition count 638
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 196 transition count 636
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 196 transition count 636
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 21 place count 194 transition count 642
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 193 transition count 632
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 193 transition count 632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 192 transition count 630
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 192 transition count 630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 191 transition count 625
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 191 transition count 625
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 190 transition count 623
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 190 transition count 623
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 189 transition count 618
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 189 transition count 618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 188 transition count 616
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 188 transition count 616
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 187 transition count 611
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 187 transition count 611
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 186 transition count 609
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 186 transition count 609
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 185 transition count 604
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 185 transition count 604
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 184 transition count 602
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 184 transition count 602
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 183 transition count 599
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 183 transition count 599
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 182 transition count 597
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 182 transition count 597
Applied a total of 45 rules in 44 ms. Remains 182 /206 variables (removed 24) and now considering 597/644 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 182/206 places, 597/644 transitions.
RANDOM walk for 40000 steps (1342 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (261 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1320899 steps, run timeout after 3001 ms. (steps per millisecond=440 ) properties seen :0 out of 1
Probabilistic random walk after 1320899 steps, saw 302185 distinct states, run finished after 3001 ms. (steps per millisecond=440 ) properties seen :0
[2024-06-02 21:31:20] [INFO ] Flow matrix only has 586 transitions (discarded 11 similar events)
// Phase 1: matrix 586 rows 182 cols
[2024-06-02 21:31:20] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:31:20] [INFO ] State equation strengthened by 94 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) 116/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 586/756 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 94/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/768 variables, 12/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/768 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/768 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 768/768 variables, and 286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 94/94 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) 116/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:31:20] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2024-06-02 21:31:20] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 586/756 variables, 170/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 94/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/756 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/756 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/768 variables, 12/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/768 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/768 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 768/768 variables, and 289 constraints, problems are : Problem set: 0 solved, 1 unsolved in 389 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 586ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 597/597 transitions.
Applied a total of 0 rules in 6 ms. Remains 182 /182 variables (removed 0) and now considering 597/597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 182/182 places, 597/597 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 597/597 transitions.
Applied a total of 0 rules in 5 ms. Remains 182 /182 variables (removed 0) and now considering 597/597 (removed 0) transitions.
[2024-06-02 21:31:21] [INFO ] Flow matrix only has 586 transitions (discarded 11 similar events)
[2024-06-02 21:31:21] [INFO ] Invariant cache hit.
[2024-06-02 21:31:21] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 21:31:21] [INFO ] Flow matrix only has 586 transitions (discarded 11 similar events)
[2024-06-02 21:31:21] [INFO ] Invariant cache hit.
[2024-06-02 21:31:21] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 21:31:21] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2024-06-02 21:31:21] [INFO ] Redundant transitions in 8 ms returned []
Running 589 sub problems to find dead transitions.
[2024-06-02 21:31:21] [INFO ] Flow matrix only has 586 transitions (discarded 11 similar events)
[2024-06-02 21:31:21] [INFO ] Invariant cache hit.
[2024-06-02 21:31:21] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-02 21:31:26] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:31:26] [INFO ] Deduced a trap composed of 99 places in 88 ms of which 1 ms to minimize.
[2024-06-02 21:31:26] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-02 21:31:26] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:31:26] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-06-02 21:31:26] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2024-06-02 21:31:26] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:31:27] [INFO ] Deduced a trap composed of 136 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:31:28] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 4 (OVERLAPS) 586/768 variables, 182/201 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/768 variables, 94/295 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/768 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 7 (OVERLAPS) 0/768 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 589 unsolved
No progress, stopping.
After SMT solving in domain Real declared 768/768 variables, and 295 constraints, problems are : Problem set: 0 solved, 589 unsolved in 26006 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 589 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-02 21:31:50] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 5 (OVERLAPS) 586/768 variables, 182/202 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/768 variables, 94/296 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 589/885 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/768 variables, and 885 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 10/10 constraints]
After SMT, in 56855ms problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 56864ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57406 ms. Remains : 182/182 places, 597/597 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 113 edges and 182 vertex of which 29 / 182 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 145 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 151 transition count 422
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 151 transition count 422
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 151 transition count 416
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 21 place count 150 transition count 415
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 1 with 38 rules applied. Total rules applied 59 place count 150 transition count 377
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 65 place count 150 transition count 371
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 74 place count 144 transition count 368
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 74 place count 144 transition count 365
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 80 place count 141 transition count 365
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 140 transition count 364
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 140 transition count 363
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 139 transition count 362
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 138 transition count 323
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 138 transition count 323
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 138 transition count 320
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 93 place count 135 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 99 place count 135 transition count 314
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 102 place count 135 transition count 311
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 105 place count 132 transition count 311
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 111 place count 132 transition count 311
Applied a total of 111 rules in 35 ms. Remains 132 /182 variables (removed 50) and now considering 311/597 (removed 286) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:32:18] [INFO ] Flow matrix only has 307 transitions (discarded 4 similar events)
// Phase 1: matrix 307 rows 132 cols
[2024-06-02 21:32:18] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 21:32:18] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:32:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 21:32:18] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:32:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:32:18] [INFO ] After 18ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:32:18] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:32:18] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 216 ms.
RANDOM walk for 40000 steps (1404 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (259 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 970909 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :0 out of 1
Probabilistic random walk after 970909 steps, saw 302061 distinct states, run finished after 3001 ms. (steps per millisecond=323 ) properties seen :0
[2024-06-02 21:32:21] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
// Phase 1: matrix 633 rows 206 cols
[2024-06-02 21:32:21] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 21:32:21] [INFO ] State equation strengthened by 98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 633/823 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 98/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/839 variables, 16/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 839/839 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:32:22] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-02 21:32:22] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 633/823 variables, 190/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 98/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/823 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/839 variables, 16/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/839 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/839 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 839/839 variables, and 317 constraints, problems are : Problem set: 0 solved, 1 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 545ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 644/644 transitions.
Graph (complete) has 1097 edges and 206 vertex of which 204 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 204 transition count 642
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 202 transition count 642
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 7 place count 200 transition count 640
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 200 transition count 640
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 13 place count 198 transition count 638
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 196 transition count 636
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 196 transition count 636
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 21 place count 194 transition count 642
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 192 transition count 622
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 192 transition count 622
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 191 transition count 620
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 191 transition count 620
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 190 transition count 615
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 190 transition count 615
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 189 transition count 613
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 189 transition count 613
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 188 transition count 608
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 188 transition count 608
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 187 transition count 606
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 187 transition count 606
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 186 transition count 601
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 186 transition count 601
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 185 transition count 599
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 185 transition count 599
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 184 transition count 594
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 184 transition count 594
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 183 transition count 592
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 183 transition count 592
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 182 transition count 589
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 182 transition count 589
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 181 transition count 587
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 181 transition count 587
Applied a total of 47 rules in 35 ms. Remains 181 /206 variables (removed 25) and now considering 587/644 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 181/206 places, 587/644 transitions.
RANDOM walk for 40000 steps (1362 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (275 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1296501 steps, run timeout after 3001 ms. (steps per millisecond=432 ) properties seen :0 out of 1
Probabilistic random walk after 1296501 steps, saw 295828 distinct states, run finished after 3001 ms. (steps per millisecond=432 ) properties seen :0
[2024-06-02 21:32:25] [INFO ] Flow matrix only has 576 transitions (discarded 11 similar events)
// Phase 1: matrix 576 rows 181 cols
[2024-06-02 21:32:25] [INFO ] Computed 10 invariants in 7 ms
[2024-06-02 21:32:25] [INFO ] State equation strengthened by 92 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) 116/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) 576/745 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/745 variables, 92/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/745 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/757 variables, 12/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/757 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/757 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 757/757 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 92/92 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) 116/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:32:25] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-06-02 21:32:25] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2024-06-02 21:32:25] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:32:25] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 576/745 variables, 169/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/745 variables, 92/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:32:26] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/745 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/745 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/757 variables, 12/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/757 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/757 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 757/757 variables, and 289 constraints, problems are : Problem set: 0 solved, 1 unsolved in 591 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 760ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 587/587 transitions.
Applied a total of 0 rules in 6 ms. Remains 181 /181 variables (removed 0) and now considering 587/587 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 181/181 places, 587/587 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 587/587 transitions.
Applied a total of 0 rules in 6 ms. Remains 181 /181 variables (removed 0) and now considering 587/587 (removed 0) transitions.
[2024-06-02 21:32:26] [INFO ] Flow matrix only has 576 transitions (discarded 11 similar events)
[2024-06-02 21:32:26] [INFO ] Invariant cache hit.
[2024-06-02 21:32:26] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 21:32:26] [INFO ] Flow matrix only has 576 transitions (discarded 11 similar events)
[2024-06-02 21:32:26] [INFO ] Invariant cache hit.
[2024-06-02 21:32:26] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-06-02 21:32:26] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2024-06-02 21:32:26] [INFO ] Redundant transitions in 7 ms returned []
Running 579 sub problems to find dead transitions.
[2024-06-02 21:32:26] [INFO ] Flow matrix only has 576 transitions (discarded 11 similar events)
[2024-06-02 21:32:26] [INFO ] Invariant cache hit.
[2024-06-02 21:32:26] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 579 unsolved
[2024-06-02 21:32:30] [INFO ] Deduced a trap composed of 99 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:32:31] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:32:31] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
[2024-06-02 21:32:31] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2024-06-02 21:32:31] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 1 ms to minimize.
[2024-06-02 21:32:31] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2024-06-02 21:32:31] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 1 ms to minimize.
[2024-06-02 21:32:31] [INFO ] Deduced a trap composed of 135 places in 86 ms of which 1 ms to minimize.
[2024-06-02 21:32:33] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 579 unsolved
[2024-06-02 21:32:34] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 579 unsolved
[2024-06-02 21:32:41] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 6 (OVERLAPS) 576/757 variables, 181/202 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/757 variables, 92/294 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/757 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 757/757 variables, and 294 constraints, problems are : Problem set: 0 solved, 579 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 579/579 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 579 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (OVERLAPS) 576/757 variables, 181/202 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/757 variables, 92/294 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/757 variables, 579/873 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/757 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 757/757 variables, and 873 constraints, problems are : Problem set: 0 solved, 579 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 579/579 constraints, Known Traps: 11/11 constraints]
After SMT, in 60813ms problems are : Problem set: 0 solved, 579 unsolved
Search for dead transitions found 0 dead transitions in 60818ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61303 ms. Remains : 181/181 places, 587/587 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 112 edges and 181 vertex of which 29 / 181 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 145 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 150 transition count 412
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 150 transition count 412
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 150 transition count 406
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 21 place count 149 transition count 405
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 54 place count 149 transition count 372
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 149 transition count 366
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 69 place count 143 transition count 363
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 69 place count 143 transition count 360
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 140 transition count 360
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 139 transition count 359
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 139 transition count 358
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 138 transition count 357
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 137 transition count 319
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 137 transition count 319
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 137 transition count 316
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 88 place count 134 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 94 place count 134 transition count 310
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 134 transition count 307
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 100 place count 131 transition count 307
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 106 place count 131 transition count 307
Applied a total of 106 rules in 33 ms. Remains 131 /181 variables (removed 50) and now considering 307/587 (removed 280) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:33:27] [INFO ] Flow matrix only has 303 transitions (discarded 4 similar events)
// Phase 1: matrix 303 rows 131 cols
[2024-06-02 21:33:27] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 21:33:27] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:33:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:33:27] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:33:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:33:27] [INFO ] After 9ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:33:27] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:33:27] [INFO ] After 120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 190 ms.
RANDOM walk for 40000 steps (1384 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (246 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 982229 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :0 out of 1
Probabilistic random walk after 982229 steps, saw 305990 distinct states, run finished after 3001 ms. (steps per millisecond=327 ) properties seen :0
[2024-06-02 21:33:30] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
// Phase 1: matrix 633 rows 206 cols
[2024-06-02 21:33:30] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 21:33:30] [INFO ] State equation strengthened by 98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 633/823 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 98/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/839 variables, 16/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 839/839 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:33:31] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-02 21:33:31] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 1 ms to minimize.
[2024-06-02 21:33:31] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 633/823 variables, 190/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 98/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/823 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/839 variables, 16/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/839 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/839 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 839/839 variables, and 318 constraints, problems are : Problem set: 0 solved, 1 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 720ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 644/644 transitions.
Graph (complete) has 1097 edges and 206 vertex of which 204 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 204 transition count 642
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 202 transition count 642
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 7 place count 200 transition count 640
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 200 transition count 640
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 13 place count 198 transition count 638
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 196 transition count 636
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 196 transition count 636
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 21 place count 194 transition count 642
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 192 transition count 622
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 192 transition count 622
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 190 transition count 618
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 190 transition count 618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 189 transition count 613
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 189 transition count 613
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 188 transition count 611
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 188 transition count 611
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 187 transition count 606
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 187 transition count 606
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 186 transition count 604
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 186 transition count 604
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 185 transition count 599
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 185 transition count 599
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 184 transition count 597
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 184 transition count 597
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 183 transition count 592
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 183 transition count 592
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 182 transition count 590
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 182 transition count 590
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 181 transition count 587
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 181 transition count 587
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 180 transition count 585
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 180 transition count 585
Applied a total of 49 rules in 36 ms. Remains 180 /206 variables (removed 26) and now considering 585/644 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 180/206 places, 585/644 transitions.
RANDOM walk for 40000 steps (1401 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (267 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1285461 steps, run timeout after 3001 ms. (steps per millisecond=428 ) properties seen :0 out of 1
Probabilistic random walk after 1285461 steps, saw 292138 distinct states, run finished after 3001 ms. (steps per millisecond=428 ) properties seen :0
[2024-06-02 21:33:34] [INFO ] Flow matrix only has 574 transitions (discarded 11 similar events)
// Phase 1: matrix 574 rows 180 cols
[2024-06-02 21:33:34] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:33:34] [INFO ] State equation strengthened by 92 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) 116/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) 574/742 variables, 168/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/742 variables, 92/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/742 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/754 variables, 12/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/754 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/754 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 754/754 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 92/92 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) 116/168 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:33:34] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-06-02 21:33:34] [INFO ] Deduced a trap composed of 43 places in 29 ms of which 1 ms to minimize.
[2024-06-02 21:33:34] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 574/742 variables, 168/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/742 variables, 92/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/742 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/742 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/754 variables, 12/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/754 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/754 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 754/754 variables, and 286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 543ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 585/585 transitions.
Applied a total of 0 rules in 6 ms. Remains 180 /180 variables (removed 0) and now considering 585/585 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 180/180 places, 585/585 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 585/585 transitions.
Applied a total of 0 rules in 5 ms. Remains 180 /180 variables (removed 0) and now considering 585/585 (removed 0) transitions.
[2024-06-02 21:33:35] [INFO ] Flow matrix only has 574 transitions (discarded 11 similar events)
[2024-06-02 21:33:35] [INFO ] Invariant cache hit.
[2024-06-02 21:33:35] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 21:33:35] [INFO ] Flow matrix only has 574 transitions (discarded 11 similar events)
[2024-06-02 21:33:35] [INFO ] Invariant cache hit.
[2024-06-02 21:33:35] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-06-02 21:33:35] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2024-06-02 21:33:35] [INFO ] Redundant transitions in 9 ms returned []
Running 577 sub problems to find dead transitions.
[2024-06-02 21:33:35] [INFO ] Flow matrix only has 574 transitions (discarded 11 similar events)
[2024-06-02 21:33:35] [INFO ] Invariant cache hit.
[2024-06-02 21:33:35] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-06-02 21:33:39] [INFO ] Deduced a trap composed of 98 places in 82 ms of which 1 ms to minimize.
[2024-06-02 21:33:39] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 1 ms to minimize.
[2024-06-02 21:33:39] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
[2024-06-02 21:33:39] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 0 ms to minimize.
[2024-06-02 21:33:40] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:33:40] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:33:40] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-02 21:33:40] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-06-02 21:33:40] [INFO ] Deduced a trap composed of 134 places in 84 ms of which 1 ms to minimize.
[2024-06-02 21:33:42] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:33:42] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (OVERLAPS) 574/754 variables, 180/201 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/754 variables, 92/293 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/754 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 7 (OVERLAPS) 0/754 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 577 unsolved
No progress, stopping.
After SMT solving in domain Real declared 754/754 variables, and 293 constraints, problems are : Problem set: 0 solved, 577 unsolved in 24217 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (OVERLAPS) 574/754 variables, 180/201 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/754 variables, 92/293 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/754 variables, 577/870 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/754 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 754/754 variables, and 870 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 11/11 constraints]
After SMT, in 54974ms problems are : Problem set: 0 solved, 577 unsolved
Search for dead transitions found 0 dead transitions in 54979ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55459 ms. Remains : 180/180 places, 585/585 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 112 edges and 180 vertex of which 29 / 180 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 145 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 149 transition count 410
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 149 transition count 410
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 149 transition count 404
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 21 place count 148 transition count 403
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 54 place count 148 transition count 370
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 148 transition count 364
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 69 place count 142 transition count 361
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 69 place count 142 transition count 358
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 139 transition count 358
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 138 transition count 357
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 138 transition count 356
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 137 transition count 355
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 136 transition count 317
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 136 transition count 317
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 136 transition count 314
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 88 place count 133 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 94 place count 133 transition count 308
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 133 transition count 305
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 100 place count 130 transition count 305
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 106 place count 130 transition count 305
Applied a total of 106 rules in 35 ms. Remains 130 /180 variables (removed 50) and now considering 305/585 (removed 280) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:34:30] [INFO ] Flow matrix only has 301 transitions (discarded 4 similar events)
// Phase 1: matrix 301 rows 130 cols
[2024-06-02 21:34:30] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 21:34:30] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:34:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:34:30] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:34:30] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:34:30] [INFO ] After 30ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:34:30] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:34:30] [INFO ] After 159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 240 ms.
RANDOM walk for 40000 steps (1345 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (266 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1019758 steps, run timeout after 3001 ms. (steps per millisecond=339 ) properties seen :0 out of 1
Probabilistic random walk after 1019758 steps, saw 317039 distinct states, run finished after 3001 ms. (steps per millisecond=339 ) properties seen :0
[2024-06-02 21:34:33] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
// Phase 1: matrix 633 rows 206 cols
[2024-06-02 21:34:33] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:34:33] [INFO ] State equation strengthened by 98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 633/823 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 98/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/839 variables, 16/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 839/839 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:34:34] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:34:34] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 633/823 variables, 190/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 98/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/823 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/839 variables, 16/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/839 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/839 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 839/839 variables, and 317 constraints, problems are : Problem set: 0 solved, 1 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 577ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 644/644 transitions.
Graph (complete) has 1097 edges and 206 vertex of which 204 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 204 transition count 642
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 202 transition count 642
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 7 place count 200 transition count 640
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 200 transition count 640
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 13 place count 198 transition count 638
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 196 transition count 636
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 196 transition count 636
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 21 place count 194 transition count 642
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 192 transition count 622
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 192 transition count 622
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 190 transition count 618
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 190 transition count 618
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 31 place count 188 transition count 608
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 188 transition count 608
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 187 transition count 606
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 187 transition count 606
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 186 transition count 601
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 186 transition count 601
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 185 transition count 599
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 185 transition count 599
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 184 transition count 594
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 184 transition count 594
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 183 transition count 592
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 183 transition count 592
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 182 transition count 587
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 182 transition count 587
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 181 transition count 585
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 181 transition count 585
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 180 transition count 582
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 180 transition count 582
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 179 transition count 580
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 179 transition count 580
Applied a total of 51 rules in 36 ms. Remains 179 /206 variables (removed 27) and now considering 580/644 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 179/206 places, 580/644 transitions.
RANDOM walk for 40000 steps (1416 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (282 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1361210 steps, run timeout after 3001 ms. (steps per millisecond=453 ) properties seen :0 out of 1
Probabilistic random walk after 1361210 steps, saw 312410 distinct states, run finished after 3001 ms. (steps per millisecond=453 ) properties seen :0
[2024-06-02 21:34:37] [INFO ] Flow matrix only has 569 transitions (discarded 11 similar events)
// Phase 1: matrix 569 rows 179 cols
[2024-06-02 21:34:37] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:34:37] [INFO ] State equation strengthened by 91 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) 116/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) 569/736 variables, 167/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/736 variables, 91/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/736 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/748 variables, 12/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/748 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/748 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 748/748 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 179/179 constraints, ReadFeed: 91/91 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) 116/167 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:34:37] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2024-06-02 21:34:37] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 0 ms to minimize.
[2024-06-02 21:34:37] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 569/736 variables, 167/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/736 variables, 91/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/736 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/736 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/748 variables, 12/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/748 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/748 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 748/748 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 406 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 179/179 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 597ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 580/580 transitions.
Applied a total of 0 rules in 6 ms. Remains 179 /179 variables (removed 0) and now considering 580/580 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 179/179 places, 580/580 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 580/580 transitions.
Applied a total of 0 rules in 5 ms. Remains 179 /179 variables (removed 0) and now considering 580/580 (removed 0) transitions.
[2024-06-02 21:34:38] [INFO ] Flow matrix only has 569 transitions (discarded 11 similar events)
[2024-06-02 21:34:38] [INFO ] Invariant cache hit.
[2024-06-02 21:34:38] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 21:34:38] [INFO ] Flow matrix only has 569 transitions (discarded 11 similar events)
[2024-06-02 21:34:38] [INFO ] Invariant cache hit.
[2024-06-02 21:34:38] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-06-02 21:34:38] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2024-06-02 21:34:38] [INFO ] Redundant transitions in 6 ms returned []
Running 572 sub problems to find dead transitions.
[2024-06-02 21:34:38] [INFO ] Flow matrix only has 569 transitions (discarded 11 similar events)
[2024-06-02 21:34:38] [INFO ] Invariant cache hit.
[2024-06-02 21:34:38] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-06-02 21:34:42] [INFO ] Deduced a trap composed of 98 places in 86 ms of which 2 ms to minimize.
[2024-06-02 21:34:42] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:34:42] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-02 21:34:42] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
[2024-06-02 21:34:43] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-06-02 21:34:43] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:34:43] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-02 21:34:43] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 1 ms to minimize.
[2024-06-02 21:34:43] [INFO ] Deduced a trap composed of 118 places in 84 ms of which 1 ms to minimize.
[2024-06-02 21:34:43] [INFO ] Deduced a trap composed of 133 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:34:45] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 4 (OVERLAPS) 569/748 variables, 179/200 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/748 variables, 91/291 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/748 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 7 (OVERLAPS) 0/748 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 572 unsolved
No progress, stopping.
After SMT solving in domain Real declared 748/748 variables, and 291 constraints, problems are : Problem set: 0 solved, 572 unsolved in 25293 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 179/179 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 572/572 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 572 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 4 (OVERLAPS) 569/748 variables, 179/200 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/748 variables, 91/291 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/748 variables, 572/863 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/748 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 748/748 variables, and 863 constraints, problems are : Problem set: 0 solved, 572 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 179/179 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 572/572 constraints, Known Traps: 11/11 constraints]
After SMT, in 55938ms problems are : Problem set: 0 solved, 572 unsolved
Search for dead transitions found 0 dead transitions in 55944ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56399 ms. Remains : 179/179 places, 580/580 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 111 edges and 179 vertex of which 29 / 179 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 145 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 148 transition count 405
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 148 transition count 405
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 148 transition count 399
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 21 place count 147 transition count 398
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 54 place count 147 transition count 365
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 147 transition count 359
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 69 place count 141 transition count 356
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 69 place count 141 transition count 353
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 138 transition count 353
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 137 transition count 352
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 137 transition count 351
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 136 transition count 350
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 135 transition count 313
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 135 transition count 313
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 135 transition count 310
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 88 place count 132 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 94 place count 132 transition count 304
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 132 transition count 301
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 100 place count 129 transition count 301
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 106 place count 129 transition count 301
Applied a total of 106 rules in 36 ms. Remains 129 /179 variables (removed 50) and now considering 301/580 (removed 279) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:35:34] [INFO ] Flow matrix only has 297 transitions (discarded 4 similar events)
// Phase 1: matrix 297 rows 129 cols
[2024-06-02 21:35:34] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 21:35:34] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:35:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:35:34] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:35:34] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:35:34] [INFO ] After 9ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:35:34] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:35:34] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 195 ms.
RANDOM walk for 40000 steps (1333 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (259 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1046918 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :0 out of 1
Probabilistic random walk after 1046918 steps, saw 326534 distinct states, run finished after 3001 ms. (steps per millisecond=348 ) properties seen :0
[2024-06-02 21:35:37] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
// Phase 1: matrix 633 rows 206 cols
[2024-06-02 21:35:37] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:35:37] [INFO ] State equation strengthened by 98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 633/823 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 98/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/839 variables, 16/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 839/839 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:35:38] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 0 ms to minimize.
[2024-06-02 21:35:38] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 1 ms to minimize.
[2024-06-02 21:35:38] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 633/823 variables, 190/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 98/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/823 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/839 variables, 16/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/839 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/839 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 839/839 variables, and 318 constraints, problems are : Problem set: 0 solved, 1 unsolved in 446 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 636ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 644/644 transitions.
Graph (complete) has 1097 edges and 206 vertex of which 204 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 204 transition count 642
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 202 transition count 642
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 7 place count 200 transition count 640
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 200 transition count 640
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 13 place count 198 transition count 638
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 196 transition count 636
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 196 transition count 636
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 21 place count 194 transition count 642
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 192 transition count 622
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 192 transition count 622
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 190 transition count 618
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 190 transition count 618
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 31 place count 188 transition count 608
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 188 transition count 608
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 35 place count 186 transition count 604
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 186 transition count 604
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 185 transition count 599
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 185 transition count 599
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 184 transition count 597
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 184 transition count 597
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 183 transition count 592
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 183 transition count 592
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 182 transition count 590
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 182 transition count 590
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 181 transition count 585
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 181 transition count 585
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 180 transition count 583
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 180 transition count 583
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 179 transition count 580
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 179 transition count 580
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 178 transition count 578
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 178 transition count 578
Applied a total of 53 rules in 40 ms. Remains 178 /206 variables (removed 28) and now considering 578/644 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 178/206 places, 578/644 transitions.
RANDOM walk for 40000 steps (1369 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (259 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1398306 steps, run timeout after 3001 ms. (steps per millisecond=465 ) properties seen :0 out of 1
Probabilistic random walk after 1398306 steps, saw 319931 distinct states, run finished after 3001 ms. (steps per millisecond=465 ) properties seen :0
[2024-06-02 21:35:41] [INFO ] Flow matrix only has 567 transitions (discarded 11 similar events)
// Phase 1: matrix 567 rows 178 cols
[2024-06-02 21:35:41] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:35:41] [INFO ] State equation strengthened by 91 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) 116/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) 567/733 variables, 166/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/733 variables, 91/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/733 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/745 variables, 12/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/745 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/745 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 745/745 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 91/91 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) 116/166 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:35:41] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:35:41] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 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) 567/733 variables, 166/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/733 variables, 91/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/733 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/733 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/745 variables, 12/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/745 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/745 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 745/745 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 429ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 578/578 transitions.
Applied a total of 0 rules in 5 ms. Remains 178 /178 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 178/178 places, 578/578 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 578/578 transitions.
Applied a total of 0 rules in 5 ms. Remains 178 /178 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2024-06-02 21:35:42] [INFO ] Flow matrix only has 567 transitions (discarded 11 similar events)
[2024-06-02 21:35:42] [INFO ] Invariant cache hit.
[2024-06-02 21:35:42] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 21:35:42] [INFO ] Flow matrix only has 567 transitions (discarded 11 similar events)
[2024-06-02 21:35:42] [INFO ] Invariant cache hit.
[2024-06-02 21:35:42] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-06-02 21:35:42] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2024-06-02 21:35:42] [INFO ] Redundant transitions in 4 ms returned []
Running 570 sub problems to find dead transitions.
[2024-06-02 21:35:42] [INFO ] Flow matrix only has 567 transitions (discarded 11 similar events)
[2024-06-02 21:35:42] [INFO ] Invariant cache hit.
[2024-06-02 21:35:42] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2024-06-02 21:35:46] [INFO ] Deduced a trap composed of 97 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:35:46] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:35:46] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 0 ms to minimize.
[2024-06-02 21:35:46] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2024-06-02 21:35:46] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-06-02 21:35:46] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-02 21:35:46] [INFO ] Deduced a trap composed of 43 places in 28 ms of which 1 ms to minimize.
[2024-06-02 21:35:47] [INFO ] Deduced a trap composed of 132 places in 85 ms of which 1 ms to minimize.
[2024-06-02 21:35:48] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 1 ms to minimize.
[2024-06-02 21:35:49] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 4 (OVERLAPS) 567/745 variables, 178/198 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/745 variables, 91/289 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/745 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 7 (OVERLAPS) 0/745 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 570 unsolved
No progress, stopping.
After SMT solving in domain Real declared 745/745 variables, and 289 constraints, problems are : Problem set: 0 solved, 570 unsolved in 25526 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 570/570 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 570 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2024-06-02 21:36:10] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 1 ms to minimize.
[2024-06-02 21:36:10] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 5 (OVERLAPS) 567/745 variables, 178/200 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/745 variables, 91/291 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/745 variables, 570/861 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 745/745 variables, and 861 constraints, problems are : Problem set: 0 solved, 570 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 570/570 constraints, Known Traps: 12/12 constraints]
After SMT, in 56189ms problems are : Problem set: 0 solved, 570 unsolved
Search for dead transitions found 0 dead transitions in 56193ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56653 ms. Remains : 178/178 places, 578/578 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 111 edges and 178 vertex of which 29 / 178 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 145 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 147 transition count 403
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 147 transition count 403
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 147 transition count 397
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 21 place count 146 transition count 396
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 54 place count 146 transition count 363
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 146 transition count 357
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 69 place count 140 transition count 354
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 69 place count 140 transition count 351
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 137 transition count 351
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 136 transition count 350
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 136 transition count 349
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 135 transition count 348
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 134 transition count 311
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 134 transition count 311
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 134 transition count 308
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 88 place count 131 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 94 place count 131 transition count 302
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 131 transition count 299
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 100 place count 128 transition count 299
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 106 place count 128 transition count 299
Applied a total of 106 rules in 28 ms. Remains 128 /178 variables (removed 50) and now considering 299/578 (removed 279) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:36:38] [INFO ] Flow matrix only has 295 transitions (discarded 4 similar events)
// Phase 1: matrix 295 rows 128 cols
[2024-06-02 21:36:38] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 21:36:38] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:36:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:36:38] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:36:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:36:38] [INFO ] After 9ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:36:38] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:36:38] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 176 ms.
RANDOM walk for 40000 steps (1416 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (273 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 924434 steps, run timeout after 3001 ms. (steps per millisecond=308 ) properties seen :0 out of 1
Probabilistic random walk after 924434 steps, saw 289795 distinct states, run finished after 3001 ms. (steps per millisecond=308 ) properties seen :0
[2024-06-02 21:36:41] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
// Phase 1: matrix 633 rows 206 cols
[2024-06-02 21:36:41] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:36:41] [INFO ] State equation strengthened by 98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 633/823 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 98/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/839 variables, 16/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 839/839 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:36:42] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-02 21:36:42] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 633/823 variables, 190/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 98/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/823 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/839 variables, 16/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/839 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/839 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 839/839 variables, and 317 constraints, problems are : Problem set: 0 solved, 1 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 559ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 644/644 transitions.
Graph (complete) has 1097 edges and 206 vertex of which 204 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 204 transition count 642
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 202 transition count 642
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 7 place count 200 transition count 640
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 200 transition count 640
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 13 place count 198 transition count 638
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 196 transition count 636
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 196 transition count 636
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 21 place count 194 transition count 642
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 192 transition count 622
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 192 transition count 622
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 190 transition count 618
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 190 transition count 618
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 31 place count 188 transition count 608
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 188 transition count 608
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 35 place count 186 transition count 604
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 186 transition count 604
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 184 transition count 594
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 184 transition count 594
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 183 transition count 592
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 183 transition count 592
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 182 transition count 587
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 182 transition count 587
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 181 transition count 585
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 181 transition count 585
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 180 transition count 580
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 180 transition count 580
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 179 transition count 578
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 179 transition count 578
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 178 transition count 575
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 178 transition count 575
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 177 transition count 573
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 177 transition count 573
Applied a total of 55 rules in 38 ms. Remains 177 /206 variables (removed 29) and now considering 573/644 (removed 71) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 177/206 places, 573/644 transitions.
RANDOM walk for 40000 steps (1375 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (266 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1428758 steps, run timeout after 3001 ms. (steps per millisecond=476 ) properties seen :0 out of 1
Probabilistic random walk after 1428758 steps, saw 327395 distinct states, run finished after 3001 ms. (steps per millisecond=476 ) properties seen :0
[2024-06-02 21:36:45] [INFO ] Flow matrix only has 562 transitions (discarded 11 similar events)
// Phase 1: matrix 562 rows 177 cols
[2024-06-02 21:36:45] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 21:36:45] [INFO ] State equation strengthened by 90 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) 116/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) 562/727 variables, 165/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/727 variables, 90/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/727 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/739 variables, 12/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/739 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/739 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 739/739 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 90/90 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) 116/165 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:36:45] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 0 ms to minimize.
[2024-06-02 21:36:45] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 562/727 variables, 165/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/727 variables, 90/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/727 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/727 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/739 variables, 12/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/739 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/739 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 739/739 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 492ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 573/573 transitions.
Applied a total of 0 rules in 5 ms. Remains 177 /177 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 177/177 places, 573/573 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 573/573 transitions.
Applied a total of 0 rules in 5 ms. Remains 177 /177 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2024-06-02 21:36:46] [INFO ] Flow matrix only has 562 transitions (discarded 11 similar events)
[2024-06-02 21:36:46] [INFO ] Invariant cache hit.
[2024-06-02 21:36:46] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 21:36:46] [INFO ] Flow matrix only has 562 transitions (discarded 11 similar events)
[2024-06-02 21:36:46] [INFO ] Invariant cache hit.
[2024-06-02 21:36:46] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-02 21:36:46] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2024-06-02 21:36:46] [INFO ] Redundant transitions in 8 ms returned []
Running 565 sub problems to find dead transitions.
[2024-06-02 21:36:46] [INFO ] Flow matrix only has 562 transitions (discarded 11 similar events)
[2024-06-02 21:36:46] [INFO ] Invariant cache hit.
[2024-06-02 21:36:46] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 565 unsolved
[2024-06-02 21:36:50] [INFO ] Deduced a trap composed of 97 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:36:50] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2024-06-02 21:36:50] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 0 ms to minimize.
[2024-06-02 21:36:50] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2024-06-02 21:36:50] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-06-02 21:36:50] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-02 21:36:50] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 0 ms to minimize.
[2024-06-02 21:36:51] [INFO ] Deduced a trap composed of 131 places in 81 ms of which 1 ms to minimize.
[2024-06-02 21:36:52] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 565 unsolved
[2024-06-02 21:36:53] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 5 (OVERLAPS) 562/739 variables, 177/197 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 90/287 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/739 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 8 (OVERLAPS) 0/739 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 565 unsolved
No progress, stopping.
After SMT solving in domain Real declared 739/739 variables, and 287 constraints, problems are : Problem set: 0 solved, 565 unsolved in 26090 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 565/565 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 565 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 4 (OVERLAPS) 562/739 variables, 177/197 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/739 variables, 90/287 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 565/852 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/739 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 565 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 739/739 variables, and 852 constraints, problems are : Problem set: 0 solved, 565 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 565/565 constraints, Known Traps: 10/10 constraints]
After SMT, in 56682ms problems are : Problem set: 0 solved, 565 unsolved
Search for dead transitions found 0 dead transitions in 56686ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57146 ms. Remains : 177/177 places, 573/573 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 110 edges and 177 vertex of which 29 / 177 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 145 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 146 transition count 398
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 146 transition count 398
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 146 transition count 392
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 21 place count 145 transition count 391
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 54 place count 145 transition count 358
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 145 transition count 352
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 69 place count 139 transition count 349
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 69 place count 139 transition count 346
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 136 transition count 346
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 135 transition count 345
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 135 transition count 344
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 134 transition count 343
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 133 transition count 307
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 133 transition count 307
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 133 transition count 304
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 88 place count 130 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 94 place count 130 transition count 298
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 130 transition count 295
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 100 place count 127 transition count 295
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 106 place count 127 transition count 295
Applied a total of 106 rules in 32 ms. Remains 127 /177 variables (removed 50) and now considering 295/573 (removed 278) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:37:43] [INFO ] Flow matrix only has 291 transitions (discarded 4 similar events)
// Phase 1: matrix 291 rows 127 cols
[2024-06-02 21:37:43] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 21:37:43] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:37:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:37:43] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:37:43] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:37:43] [INFO ] After 9ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:37:43] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:37:43] [INFO ] After 116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 183 ms.
RANDOM walk for 40000 steps (1360 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (272 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1032058 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :0 out of 1
Probabilistic random walk after 1032058 steps, saw 321383 distinct states, run finished after 3001 ms. (steps per millisecond=343 ) properties seen :0
[2024-06-02 21:37:46] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
// Phase 1: matrix 633 rows 206 cols
[2024-06-02 21:37:46] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 21:37:46] [INFO ] State equation strengthened by 98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 633/823 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 98/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/839 variables, 16/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 839/839 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:37:46] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-02 21:37:46] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 1 ms to minimize.
[2024-06-02 21:37:46] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 633/823 variables, 190/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 98/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/823 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/839 variables, 16/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/839 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/839 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 839/839 variables, and 318 constraints, problems are : Problem set: 0 solved, 1 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 640ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 644/644 transitions.
Graph (complete) has 1097 edges and 206 vertex of which 204 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 204 transition count 642
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 202 transition count 642
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 7 place count 200 transition count 640
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 200 transition count 640
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 13 place count 198 transition count 638
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 196 transition count 636
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 196 transition count 636
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 21 place count 194 transition count 642
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 192 transition count 622
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 192 transition count 622
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 190 transition count 618
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 190 transition count 618
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 31 place count 188 transition count 608
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 188 transition count 608
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 35 place count 186 transition count 604
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 186 transition count 604
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 184 transition count 594
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 184 transition count 594
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 182 transition count 590
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 182 transition count 590
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 181 transition count 585
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 181 transition count 585
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 180 transition count 583
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 180 transition count 583
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 179 transition count 578
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 179 transition count 578
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 178 transition count 576
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 178 transition count 576
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 177 transition count 573
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 177 transition count 573
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 176 transition count 571
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 176 transition count 571
Applied a total of 57 rules in 38 ms. Remains 176 /206 variables (removed 30) and now considering 571/644 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 176/206 places, 571/644 transitions.
RANDOM walk for 40000 steps (1375 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (272 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1400201 steps, run timeout after 3001 ms. (steps per millisecond=466 ) properties seen :0 out of 1
Probabilistic random walk after 1400201 steps, saw 320350 distinct states, run finished after 3001 ms. (steps per millisecond=466 ) properties seen :0
[2024-06-02 21:37:50] [INFO ] Flow matrix only has 560 transitions (discarded 11 similar events)
// Phase 1: matrix 560 rows 176 cols
[2024-06-02 21:37:50] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:37:50] [INFO ] State equation strengthened by 90 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) 116/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) 560/724 variables, 164/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/724 variables, 90/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/724 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/736 variables, 12/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/736 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/736 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 736/736 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 90/90 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) 116/164 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:37:50] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:37:50] [INFO ] Deduced a trap composed of 43 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 560/724 variables, 164/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/724 variables, 90/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/724 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/724 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/736 variables, 12/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/736 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/736 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 736/736 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: 176/176 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 511ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 571/571 transitions.
Applied a total of 0 rules in 7 ms. Remains 176 /176 variables (removed 0) and now considering 571/571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 176/176 places, 571/571 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 571/571 transitions.
Applied a total of 0 rules in 6 ms. Remains 176 /176 variables (removed 0) and now considering 571/571 (removed 0) transitions.
[2024-06-02 21:37:50] [INFO ] Flow matrix only has 560 transitions (discarded 11 similar events)
[2024-06-02 21:37:50] [INFO ] Invariant cache hit.
[2024-06-02 21:37:50] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 21:37:50] [INFO ] Flow matrix only has 560 transitions (discarded 11 similar events)
[2024-06-02 21:37:50] [INFO ] Invariant cache hit.
[2024-06-02 21:37:50] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-02 21:37:51] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2024-06-02 21:37:51] [INFO ] Redundant transitions in 8 ms returned []
Running 563 sub problems to find dead transitions.
[2024-06-02 21:37:51] [INFO ] Flow matrix only has 560 transitions (discarded 11 similar events)
[2024-06-02 21:37:51] [INFO ] Invariant cache hit.
[2024-06-02 21:37:51] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 563 unsolved
[2024-06-02 21:37:54] [INFO ] Deduced a trap composed of 96 places in 81 ms of which 4 ms to minimize.
[2024-06-02 21:37:55] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:37:55] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
[2024-06-02 21:37:55] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-02 21:37:55] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2024-06-02 21:37:55] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:37:55] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-06-02 21:37:55] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 1 ms to minimize.
[2024-06-02 21:37:55] [INFO ] Deduced a trap composed of 130 places in 77 ms of which 1 ms to minimize.
[2024-06-02 21:37:57] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 4 (OVERLAPS) 560/736 variables, 176/196 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/736 variables, 90/286 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/736 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 7 (OVERLAPS) 0/736 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 563 unsolved
No progress, stopping.
After SMT solving in domain Real declared 736/736 variables, and 286 constraints, problems are : Problem set: 0 solved, 563 unsolved in 22155 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 563/563 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 4 (OVERLAPS) 560/736 variables, 176/196 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/736 variables, 90/286 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/736 variables, 563/849 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/736 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 736/736 variables, and 849 constraints, problems are : Problem set: 0 solved, 563 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 563/563 constraints, Known Traps: 10/10 constraints]
After SMT, in 52773ms problems are : Problem set: 0 solved, 563 unsolved
Search for dead transitions found 0 dead transitions in 52781ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53252 ms. Remains : 176/176 places, 571/571 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 110 edges and 176 vertex of which 29 / 176 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 145 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 145 transition count 396
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 145 transition count 396
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 145 transition count 390
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 21 place count 144 transition count 389
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 54 place count 144 transition count 356
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 144 transition count 350
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 69 place count 138 transition count 347
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 69 place count 138 transition count 344
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 135 transition count 344
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 134 transition count 343
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 134 transition count 342
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 133 transition count 341
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 132 transition count 305
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 132 transition count 305
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 132 transition count 302
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 88 place count 129 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 94 place count 129 transition count 296
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 129 transition count 293
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 100 place count 126 transition count 293
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 106 place count 126 transition count 293
Applied a total of 106 rules in 34 ms. Remains 126 /176 variables (removed 50) and now considering 293/571 (removed 278) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:38:44] [INFO ] Flow matrix only has 289 transitions (discarded 4 similar events)
// Phase 1: matrix 289 rows 126 cols
[2024-06-02 21:38:44] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 21:38:44] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:38:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:38:44] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:38:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:38:44] [INFO ] After 8ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:38:44] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:38:44] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 185 ms.
RANDOM walk for 40000 steps (1395 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (272 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1039750 steps, run timeout after 3001 ms. (steps per millisecond=346 ) properties seen :0 out of 1
Probabilistic random walk after 1039750 steps, saw 324096 distinct states, run finished after 3001 ms. (steps per millisecond=346 ) properties seen :0
[2024-06-02 21:38:47] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
// Phase 1: matrix 633 rows 206 cols
[2024-06-02 21:38:47] [INFO ] Computed 10 invariants in 10 ms
[2024-06-02 21:38:47] [INFO ] State equation strengthened by 98 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) 185/214 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 621/835 variables, 197/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/835 variables, 98/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/835 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/839 variables, 4/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 839/839 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 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) 185/214 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:38:47] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-06-02 21:38:47] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 621/835 variables, 197/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/835 variables, 98/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:38:47] [INFO ] Deduced a trap composed of 113 places in 100 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/835 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/835 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/839 variables, 4/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/839 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/839 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 839/839 variables, and 318 constraints, problems are : Problem set: 0 solved, 1 unsolved in 499 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 714ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 644/644 transitions.
Graph (complete) has 1097 edges and 206 vertex of which 205 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 205 transition count 642
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 203 transition count 642
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 202 transition count 641
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 202 transition count 641
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 200 transition count 639
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 198 transition count 637
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 198 transition count 637
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 196 transition count 643
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 194 transition count 623
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 194 transition count 623
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 192 transition count 619
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 192 transition count 619
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 190 transition count 609
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 190 transition count 609
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 188 transition count 605
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 188 transition count 605
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 186 transition count 595
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 186 transition count 595
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 184 transition count 591
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 184 transition count 591
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 182 transition count 581
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 182 transition count 581
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 180 transition count 577
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 180 transition count 577
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 178 transition count 567
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 178 transition count 567
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 176 transition count 563
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 176 transition count 563
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 174 transition count 557
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 174 transition count 557
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 172 transition count 553
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 172 transition count 553
Applied a total of 67 rules in 40 ms. Remains 172 /206 variables (removed 34) and now considering 553/644 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 172/206 places, 553/644 transitions.
RANDOM walk for 40000 steps (1405 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (276 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1413767 steps, run timeout after 3001 ms. (steps per millisecond=471 ) properties seen :0 out of 1
Probabilistic random walk after 1413767 steps, saw 323607 distinct states, run finished after 3001 ms. (steps per millisecond=471 ) properties seen :0
[2024-06-02 21:38:51] [INFO ] Flow matrix only has 542 transitions (discarded 11 similar events)
// Phase 1: matrix 542 rows 172 cols
[2024-06-02 21:38:51] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:38:51] [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) 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) 22/24 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/27 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 153/180 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 530/710 variables, 163/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/710 variables, 88/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/710 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/714 variables, 4/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/714 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/714 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 714/714 variables, and 270 constraints, problems are : Problem set: 0 solved, 1 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 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) 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) 22/24 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 153/180 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:38:51] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/180 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 530/710 variables, 163/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/710 variables, 88/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/710 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/714 variables, 4/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/714 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/714 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 714/714 variables, and 272 constraints, problems are : Problem set: 0 solved, 1 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 434ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 1 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 553/553 transitions.
Applied a total of 0 rules in 4 ms. Remains 172 /172 variables (removed 0) and now considering 553/553 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 172/172 places, 553/553 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 553/553 transitions.
Applied a total of 0 rules in 5 ms. Remains 172 /172 variables (removed 0) and now considering 553/553 (removed 0) transitions.
[2024-06-02 21:38:51] [INFO ] Flow matrix only has 542 transitions (discarded 11 similar events)
[2024-06-02 21:38:51] [INFO ] Invariant cache hit.
[2024-06-02 21:38:51] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 21:38:51] [INFO ] Flow matrix only has 542 transitions (discarded 11 similar events)
[2024-06-02 21:38:51] [INFO ] Invariant cache hit.
[2024-06-02 21:38:51] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-06-02 21:38:51] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2024-06-02 21:38:51] [INFO ] Redundant transitions in 7 ms returned []
Running 545 sub problems to find dead transitions.
[2024-06-02 21:38:51] [INFO ] Flow matrix only has 542 transitions (discarded 11 similar events)
[2024-06-02 21:38:51] [INFO ] Invariant cache hit.
[2024-06-02 21:38:51] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-06-02 21:38:55] [INFO ] Deduced a trap composed of 93 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:38:55] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-06-02 21:38:55] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:38:55] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2024-06-02 21:38:55] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-06-02 21:38:56] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:38:56] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-06-02 21:38:56] [INFO ] Deduced a trap composed of 124 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:38:57] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:38:58] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-06-02 21:38:59] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-06-02 21:39:04] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 6 (OVERLAPS) 542/713 variables, 171/193 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/713 variables, 88/281 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/713 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 9 (OVERLAPS) 1/714 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 714/714 variables, and 282 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 545 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 4 (OVERLAPS) 542/713 variables, 171/193 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/713 variables, 88/281 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/713 variables, 537/818 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/713 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 8 (OVERLAPS) 1/714 variables, 1/819 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 714/714 variables, and 827 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 12/12 constraints]
After SMT, in 60620ms problems are : Problem set: 0 solved, 545 unsolved
Search for dead transitions found 0 dead transitions in 60624ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61037 ms. Remains : 172/172 places, 553/553 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 172 vertex of which 29 / 172 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 145 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 141 transition count 378
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 141 transition count 378
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 141 transition count 372
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 21 place count 140 transition count 371
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 54 place count 140 transition count 338
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 140 transition count 332
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 69 place count 134 transition count 329
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 69 place count 134 transition count 326
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 131 transition count 326
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 130 transition count 325
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 130 transition count 324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 129 transition count 323
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 128 transition count 290
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 128 transition count 290
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 128 transition count 287
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 88 place count 125 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 94 place count 125 transition count 281
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 125 transition count 278
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 100 place count 122 transition count 278
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 106 place count 122 transition count 278
Applied a total of 106 rules in 25 ms. Remains 122 /172 variables (removed 50) and now considering 278/553 (removed 275) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:39:52] [INFO ] Flow matrix only has 274 transitions (discarded 4 similar events)
// Phase 1: matrix 274 rows 122 cols
[2024-06-02 21:39:52] [INFO ] Computed 10 invariants in 0 ms
[2024-06-02 21:39:52] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:39:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:39:52] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:39:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:39:52] [INFO ] After 7ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:39:52] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:39:52] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 170 ms.
RANDOM walk for 40000 steps (1412 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (257 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1031938 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :0 out of 1
Probabilistic random walk after 1031938 steps, saw 321347 distinct states, run finished after 3001 ms. (steps per millisecond=343 ) properties seen :0
[2024-06-02 21:39:55] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
// Phase 1: matrix 633 rows 206 cols
[2024-06-02 21:39:55] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:39:55] [INFO ] State equation strengthened by 98 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/27 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/30 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 185/215 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 620/835 variables, 196/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/835 variables, 98/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/835 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/839 variables, 4/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 839/839 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/27 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/30 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 185/215 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 620/835 variables, 196/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/835 variables, 98/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:39:56] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 1 ms to minimize.
[2024-06-02 21:39:56] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2024-06-02 21:39:56] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/835 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/835 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/839 variables, 4/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/839 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/839 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 839/839 variables, and 318 constraints, problems are : Problem set: 0 solved, 1 unsolved in 636 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 832ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 644/644 transitions.
Graph (complete) has 1097 edges and 206 vertex of which 204 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 204 transition count 642
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 202 transition count 642
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 201 transition count 641
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 201 transition count 641
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 199 transition count 639
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 197 transition count 637
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 197 transition count 637
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 195 transition count 643
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 193 transition count 623
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 193 transition count 623
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 191 transition count 619
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 191 transition count 619
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 189 transition count 609
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 189 transition count 609
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 187 transition count 605
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 187 transition count 605
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 185 transition count 595
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 185 transition count 595
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 183 transition count 591
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 183 transition count 591
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 181 transition count 581
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 181 transition count 581
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 179 transition count 577
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 179 transition count 577
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 177 transition count 567
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 177 transition count 567
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 175 transition count 563
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 175 transition count 563
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 173 transition count 557
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 173 transition count 557
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 171 transition count 553
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 171 transition count 553
Applied a total of 67 rules in 33 ms. Remains 171 /206 variables (removed 35) and now considering 553/644 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 171/206 places, 553/644 transitions.
RANDOM walk for 40000 steps (1400 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (272 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1415862 steps, run timeout after 3001 ms. (steps per millisecond=471 ) properties seen :0 out of 1
Probabilistic random walk after 1415862 steps, saw 324158 distinct states, run finished after 3001 ms. (steps per millisecond=471 ) properties seen :0
[2024-06-02 21:39:59] [INFO ] Flow matrix only has 542 transitions (discarded 11 similar events)
// Phase 1: matrix 542 rows 171 cols
[2024-06-02 21:39:59] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 21:39:59] [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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/24 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/27 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 153/180 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 529/709 variables, 162/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/709 variables, 88/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/709 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/713 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/713 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/713 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 713/713 variables, and 269 constraints, problems are : Problem set: 0 solved, 1 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 171/171 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/24 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 153/180 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:40:00] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/180 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 529/709 variables, 162/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/709 variables, 88/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:40:00] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/709 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/709 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/713 variables, 4/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/713 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/713 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 713/713 variables, and 272 constraints, problems are : Problem set: 0 solved, 1 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 171/171 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 609ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 553/553 transitions.
Applied a total of 0 rules in 5 ms. Remains 171 /171 variables (removed 0) and now considering 553/553 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 171/171 places, 553/553 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 553/553 transitions.
Applied a total of 0 rules in 5 ms. Remains 171 /171 variables (removed 0) and now considering 553/553 (removed 0) transitions.
[2024-06-02 21:40:00] [INFO ] Flow matrix only has 542 transitions (discarded 11 similar events)
[2024-06-02 21:40:00] [INFO ] Invariant cache hit.
[2024-06-02 21:40:00] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-02 21:40:00] [INFO ] Flow matrix only has 542 transitions (discarded 11 similar events)
[2024-06-02 21:40:00] [INFO ] Invariant cache hit.
[2024-06-02 21:40:00] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-06-02 21:40:01] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
[2024-06-02 21:40:01] [INFO ] Redundant transitions in 8 ms returned []
Running 545 sub problems to find dead transitions.
[2024-06-02 21:40:01] [INFO ] Flow matrix only has 542 transitions (discarded 11 similar events)
[2024-06-02 21:40:01] [INFO ] Invariant cache hit.
[2024-06-02 21:40:01] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-06-02 21:40:04] [INFO ] Deduced a trap composed of 93 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:40:04] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-02 21:40:04] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:40:04] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:40:05] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-06-02 21:40:05] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:40:05] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-02 21:40:05] [INFO ] Deduced a trap composed of 124 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:40:06] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 1 ms to minimize.
[2024-06-02 21:40:07] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-06-02 21:40:08] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-06-02 21:40:13] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 6 (OVERLAPS) 542/713 variables, 171/193 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/713 variables, 88/281 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/713 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 9 (OVERLAPS) 0/713 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 545 unsolved
No progress, stopping.
After SMT solving in domain Real declared 713/713 variables, and 281 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 171/171 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 545 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 4 (OVERLAPS) 542/713 variables, 171/193 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/713 variables, 88/281 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/713 variables, 545/826 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/713 variables, 0/826 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 713/713 variables, and 826 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 171/171 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 12/12 constraints]
After SMT, in 60630ms problems are : Problem set: 0 solved, 545 unsolved
Search for dead transitions found 0 dead transitions in 60634ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61249 ms. Remains : 171/171 places, 553/553 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 171 vertex of which 29 / 171 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 145 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 140 transition count 378
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 140 transition count 378
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 140 transition count 372
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 21 place count 139 transition count 371
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 54 place count 139 transition count 338
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 139 transition count 332
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 69 place count 133 transition count 329
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 69 place count 133 transition count 326
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 130 transition count 326
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 129 transition count 325
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 129 transition count 324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 128 transition count 323
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 127 transition count 290
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 127 transition count 290
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 127 transition count 287
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 88 place count 124 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 94 place count 124 transition count 281
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 124 transition count 278
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 100 place count 121 transition count 278
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 106 place count 121 transition count 278
Applied a total of 106 rules in 31 ms. Remains 121 /171 variables (removed 50) and now considering 278/553 (removed 275) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:41:01] [INFO ] Flow matrix only has 274 transitions (discarded 4 similar events)
// Phase 1: matrix 274 rows 121 cols
[2024-06-02 21:41:01] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 21:41:01] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:41:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:41:01] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:41:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:41:01] [INFO ] After 9ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:41:01] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2024-06-02 21:41:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
TRAPS : Iteration 1
[2024-06-02 21:41:01] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:41:01] [INFO ] After 199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 272 ms.
RANDOM walk for 40000 steps (1362 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (267 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1031111 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :0 out of 1
Probabilistic random walk after 1031111 steps, saw 321044 distinct states, run finished after 3001 ms. (steps per millisecond=343 ) properties seen :0
[2024-06-02 21:41:05] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
// Phase 1: matrix 633 rows 206 cols
[2024-06-02 21:41:05] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:41:05] [INFO ] State equation strengthened by 98 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) 185/214 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 621/835 variables, 197/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/835 variables, 98/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/835 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/839 variables, 4/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 839/839 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 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) 185/214 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:41:05] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2024-06-02 21:41:05] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 621/835 variables, 197/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/835 variables, 98/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:41:05] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/835 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/835 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/839 variables, 4/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/839 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/839 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 839/839 variables, and 318 constraints, problems are : Problem set: 0 solved, 1 unsolved in 684 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 876ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 644/644 transitions.
Graph (complete) has 1097 edges and 206 vertex of which 205 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 205 transition count 642
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 203 transition count 642
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 202 transition count 641
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 202 transition count 641
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 200 transition count 639
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 198 transition count 637
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 198 transition count 637
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 196 transition count 643
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 194 transition count 623
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 194 transition count 623
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 192 transition count 619
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 192 transition count 619
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 190 transition count 609
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 190 transition count 609
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 188 transition count 605
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 188 transition count 605
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 186 transition count 595
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 186 transition count 595
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 184 transition count 591
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 184 transition count 591
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 182 transition count 581
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 182 transition count 581
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 180 transition count 577
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 180 transition count 577
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 178 transition count 567
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 178 transition count 567
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 176 transition count 563
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 176 transition count 563
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 174 transition count 557
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 174 transition count 557
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 172 transition count 553
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 172 transition count 553
Applied a total of 67 rules in 38 ms. Remains 172 /206 variables (removed 34) and now considering 553/644 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 172/206 places, 553/644 transitions.
RANDOM walk for 40000 steps (1379 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (256 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1450977 steps, run timeout after 3001 ms. (steps per millisecond=483 ) properties seen :0 out of 1
Probabilistic random walk after 1450977 steps, saw 332029 distinct states, run finished after 3001 ms. (steps per millisecond=483 ) properties seen :0
[2024-06-02 21:41:08] [INFO ] Flow matrix only has 542 transitions (discarded 11 similar events)
// Phase 1: matrix 542 rows 172 cols
[2024-06-02 21:41:08] [INFO ] Computed 10 invariants in 7 ms
[2024-06-02 21:41:09] [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) 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) 22/24 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/27 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 153/180 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 530/710 variables, 163/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/710 variables, 88/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/710 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/714 variables, 4/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/714 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/714 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 714/714 variables, and 270 constraints, problems are : Problem set: 0 solved, 1 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 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) 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) 22/24 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 153/180 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:41:09] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/180 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 530/710 variables, 163/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/710 variables, 88/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/710 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/714 variables, 4/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/714 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/714 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 714/714 variables, and 272 constraints, problems are : Problem set: 0 solved, 1 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 455ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 553/553 transitions.
Applied a total of 0 rules in 5 ms. Remains 172 /172 variables (removed 0) and now considering 553/553 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 172/172 places, 553/553 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 553/553 transitions.
Applied a total of 0 rules in 5 ms. Remains 172 /172 variables (removed 0) and now considering 553/553 (removed 0) transitions.
[2024-06-02 21:41:09] [INFO ] Flow matrix only has 542 transitions (discarded 11 similar events)
[2024-06-02 21:41:09] [INFO ] Invariant cache hit.
[2024-06-02 21:41:09] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 21:41:09] [INFO ] Flow matrix only has 542 transitions (discarded 11 similar events)
[2024-06-02 21:41:09] [INFO ] Invariant cache hit.
[2024-06-02 21:41:09] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-06-02 21:41:09] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2024-06-02 21:41:09] [INFO ] Redundant transitions in 10 ms returned []
Running 545 sub problems to find dead transitions.
[2024-06-02 21:41:09] [INFO ] Flow matrix only has 542 transitions (discarded 11 similar events)
[2024-06-02 21:41:09] [INFO ] Invariant cache hit.
[2024-06-02 21:41:09] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-06-02 21:41:13] [INFO ] Deduced a trap composed of 93 places in 78 ms of which 1 ms to minimize.
[2024-06-02 21:41:13] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 0 ms to minimize.
[2024-06-02 21:41:13] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 1 ms to minimize.
[2024-06-02 21:41:13] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-06-02 21:41:13] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-06-02 21:41:14] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 1 ms to minimize.
[2024-06-02 21:41:14] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-02 21:41:14] [INFO ] Deduced a trap composed of 124 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:41:15] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2024-06-02 21:41:16] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-06-02 21:41:16] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-06-02 21:41:23] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 6 (OVERLAPS) 542/713 variables, 171/193 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/713 variables, 88/281 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/713 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 9 (OVERLAPS) 1/714 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 714/714 variables, and 282 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 545 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 4 (OVERLAPS) 542/713 variables, 171/193 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/713 variables, 88/281 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/713 variables, 537/818 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/713 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 8 (OVERLAPS) 1/714 variables, 1/819 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 714/714 variables, and 827 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 12/12 constraints]
After SMT, in 60663ms problems are : Problem set: 0 solved, 545 unsolved
Search for dead transitions found 0 dead transitions in 60668ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61121 ms. Remains : 172/172 places, 553/553 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 172 vertex of which 29 / 172 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 145 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 141 transition count 378
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 141 transition count 378
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 141 transition count 372
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 21 place count 140 transition count 371
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 54 place count 140 transition count 338
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 140 transition count 332
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 69 place count 134 transition count 329
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 69 place count 134 transition count 326
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 131 transition count 326
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 130 transition count 325
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 130 transition count 324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 129 transition count 323
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 128 transition count 290
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 128 transition count 290
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 128 transition count 287
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 88 place count 125 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 94 place count 125 transition count 281
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 125 transition count 278
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 100 place count 122 transition count 278
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 106 place count 122 transition count 278
Applied a total of 106 rules in 34 ms. Remains 122 /172 variables (removed 50) and now considering 278/553 (removed 275) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:42:10] [INFO ] Flow matrix only has 274 transitions (discarded 4 similar events)
// Phase 1: matrix 274 rows 122 cols
[2024-06-02 21:42:10] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 21:42:10] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:42:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:42:10] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:42:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:42:10] [INFO ] After 7ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:42:10] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:42:10] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 180 ms.
RANDOM walk for 40000 steps (1387 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (277 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 947981 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :0 out of 1
Probabilistic random walk after 947981 steps, saw 296076 distinct states, run finished after 3001 ms. (steps per millisecond=315 ) properties seen :0
[2024-06-02 21:42:13] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
// Phase 1: matrix 633 rows 206 cols
[2024-06-02 21:42:13] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 21:42:13] [INFO ] State equation strengthened by 98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 633/823 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 98/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/839 variables, 16/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 839/839 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:42:14] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
[2024-06-02 21:42:14] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 633/823 variables, 190/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 98/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/823 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/839 variables, 16/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/839 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/839 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 839/839 variables, and 317 constraints, problems are : Problem set: 0 solved, 1 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 521ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 644/644 transitions.
Graph (complete) has 1097 edges and 206 vertex of which 204 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 204 transition count 643
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 203 transition count 643
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5 place count 201 transition count 641
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 201 transition count 641
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 199 transition count 639
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 197 transition count 637
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 197 transition count 637
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 17 place count 196 transition count 640
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 195 transition count 630
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 195 transition count 630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 194 transition count 628
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 194 transition count 628
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 193 transition count 623
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 193 transition count 623
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 192 transition count 621
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 192 transition count 621
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 191 transition count 616
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 191 transition count 616
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 190 transition count 614
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 190 transition count 614
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 189 transition count 609
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 189 transition count 609
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 188 transition count 607
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 188 transition count 607
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 187 transition count 602
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 187 transition count 602
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 186 transition count 600
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 186 transition count 600
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 185 transition count 597
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 185 transition count 597
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 184 transition count 595
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 184 transition count 595
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 42 place count 184 transition count 595
Applied a total of 42 rules in 46 ms. Remains 184 /206 variables (removed 22) and now considering 595/644 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 184/206 places, 595/644 transitions.
RANDOM walk for 40000 steps (1412 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (262 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1016275 steps, run timeout after 3001 ms. (steps per millisecond=338 ) properties seen :0 out of 1
Probabilistic random walk after 1016275 steps, saw 315798 distinct states, run finished after 3001 ms. (steps per millisecond=338 ) properties seen :0
[2024-06-02 21:42:17] [INFO ] Flow matrix only has 584 transitions (discarded 11 similar events)
// Phase 1: matrix 584 rows 184 cols
[2024-06-02 21:42:17] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 21:42:17] [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) 55/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 116/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 584/756 variables, 172/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 93/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/768 variables, 12/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/768 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/768 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 768/768 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 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) 55/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 116/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:42:17] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2024-06-02 21:42:17] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2024-06-02 21:42:17] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 584/756 variables, 172/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 93/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/756 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/756 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/768 variables, 12/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/768 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/768 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 768/768 variables, and 291 constraints, problems are : Problem set: 0 solved, 1 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 636ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 595/595 transitions.
Applied a total of 0 rules in 9 ms. Remains 184 /184 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 184/184 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 595/595 transitions.
Applied a total of 0 rules in 5 ms. Remains 184 /184 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-06-02 21:42:18] [INFO ] Flow matrix only has 584 transitions (discarded 11 similar events)
[2024-06-02 21:42:18] [INFO ] Invariant cache hit.
[2024-06-02 21:42:18] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 21:42:18] [INFO ] Flow matrix only has 584 transitions (discarded 11 similar events)
[2024-06-02 21:42:18] [INFO ] Invariant cache hit.
[2024-06-02 21:42:18] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-06-02 21:42:18] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2024-06-02 21:42:18] [INFO ] Redundant transitions in 7 ms returned []
Running 587 sub problems to find dead transitions.
[2024-06-02 21:42:18] [INFO ] Flow matrix only has 584 transitions (discarded 11 similar events)
[2024-06-02 21:42:18] [INFO ] Invariant cache hit.
[2024-06-02 21:42:18] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 587 unsolved
[2024-06-02 21:42:23] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
[2024-06-02 21:42:23] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:42:23] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-06-02 21:42:23] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
[2024-06-02 21:42:23] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:42:24] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:42:24] [INFO ] Deduced a trap composed of 138 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:42:26] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 4 (OVERLAPS) 584/768 variables, 184/202 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/768 variables, 93/295 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/768 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 7 (OVERLAPS) 0/768 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 587 unsolved
No progress, stopping.
After SMT solving in domain Real declared 768/768 variables, and 295 constraints, problems are : Problem set: 0 solved, 587 unsolved in 26824 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 587/587 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 587 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 4 (OVERLAPS) 584/768 variables, 184/202 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/768 variables, 93/295 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/768 variables, 587/882 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/768 variables, and 882 constraints, problems are : Problem set: 0 solved, 587 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 587/587 constraints, Known Traps: 8/8 constraints]
After SMT, in 57555ms problems are : Problem set: 0 solved, 587 unsolved
Search for dead transitions found 0 dead transitions in 57562ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58145 ms. Remains : 184/184 places, 595/595 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 114 edges and 184 vertex of which 29 / 184 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 145 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 153 transition count 420
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 153 transition count 420
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 153 transition count 414
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 21 place count 152 transition count 413
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 54 place count 152 transition count 380
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 152 transition count 374
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 69 place count 146 transition count 371
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 69 place count 146 transition count 368
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 143 transition count 368
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 142 transition count 367
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 142 transition count 366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 141 transition count 365
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 140 transition count 326
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 140 transition count 326
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 140 transition count 323
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 88 place count 137 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 94 place count 137 transition count 317
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 137 transition count 314
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 100 place count 134 transition count 314
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 105 place count 134 transition count 314
Applied a total of 105 rules in 32 ms. Remains 134 /184 variables (removed 50) and now considering 314/595 (removed 281) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:43:16] [INFO ] Flow matrix only has 310 transitions (discarded 4 similar events)
// Phase 1: matrix 310 rows 134 cols
[2024-06-02 21:43:16] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 21:43:16] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:43:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:43:16] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:43:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:43:16] [INFO ] After 7ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:43:16] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:43:16] [INFO ] After 115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 194 ms.
RANDOM walk for 40000 steps (1394 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (264 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 965747 steps, run timeout after 3001 ms. (steps per millisecond=321 ) properties seen :0 out of 1
Probabilistic random walk after 965747 steps, saw 300773 distinct states, run finished after 3001 ms. (steps per millisecond=321 ) properties seen :0
[2024-06-02 21:43:19] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
// Phase 1: matrix 633 rows 206 cols
[2024-06-02 21:43:19] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 21:43:19] [INFO ] State equation strengthened by 98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 633/823 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 98/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/839 variables, 16/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 839/839 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:43:19] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 633/823 variables, 190/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 98/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/823 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:43:20] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2024-06-02 21:43:20] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/823 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/839 variables, 16/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/839 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/839 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 839/839 variables, and 318 constraints, problems are : Problem set: 0 solved, 1 unsolved in 537 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 756ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 644/644 transitions.
Graph (complete) has 1097 edges and 206 vertex of which 204 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 204 transition count 642
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 202 transition count 642
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 7 place count 200 transition count 640
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 200 transition count 640
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 2 with 2 rules applied. Total rules applied 11 place count 199 transition count 639
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 198 transition count 638
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 198 transition count 638
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 17 place count 196 transition count 644
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 195 transition count 634
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 195 transition count 634
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 194 transition count 632
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 194 transition count 632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 193 transition count 627
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 193 transition count 627
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 192 transition count 625
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 192 transition count 625
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 191 transition count 620
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 191 transition count 620
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 190 transition count 618
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 190 transition count 618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 189 transition count 613
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 189 transition count 613
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 188 transition count 611
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 188 transition count 611
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 187 transition count 606
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 187 transition count 606
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 186 transition count 604
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 186 transition count 604
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 185 transition count 601
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 185 transition count 601
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 184 transition count 599
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 184 transition count 599
Applied a total of 41 rules in 39 ms. Remains 184 /206 variables (removed 22) and now considering 599/644 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 184/206 places, 599/644 transitions.
RANDOM walk for 40000 steps (1390 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (268 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1012265 steps, run timeout after 3001 ms. (steps per millisecond=337 ) properties seen :0 out of 1
Probabilistic random walk after 1012265 steps, saw 314363 distinct states, run finished after 3001 ms. (steps per millisecond=337 ) properties seen :0
[2024-06-02 21:43:23] [INFO ] Flow matrix only has 588 transitions (discarded 11 similar events)
// Phase 1: matrix 588 rows 184 cols
[2024-06-02 21:43:23] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:43:23] [INFO ] State equation strengthened by 94 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) 55/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 116/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 588/760 variables, 172/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/760 variables, 94/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/760 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/772 variables, 12/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/772 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/772 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 772/772 variables, and 288 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 94/94 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) 55/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 116/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:43:23] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 1 ms to minimize.
[2024-06-02 21:43:23] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 588/760 variables, 172/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/760 variables, 94/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/760 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/772 variables, 12/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/772 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/772 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 772/772 variables, and 291 constraints, problems are : Problem set: 0 solved, 1 unsolved in 436 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 627ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 599/599 transitions.
Applied a total of 0 rules in 6 ms. Remains 184 /184 variables (removed 0) and now considering 599/599 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 184/184 places, 599/599 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 599/599 transitions.
Applied a total of 0 rules in 6 ms. Remains 184 /184 variables (removed 0) and now considering 599/599 (removed 0) transitions.
[2024-06-02 21:43:23] [INFO ] Flow matrix only has 588 transitions (discarded 11 similar events)
[2024-06-02 21:43:23] [INFO ] Invariant cache hit.
[2024-06-02 21:43:24] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 21:43:24] [INFO ] Flow matrix only has 588 transitions (discarded 11 similar events)
[2024-06-02 21:43:24] [INFO ] Invariant cache hit.
[2024-06-02 21:43:24] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 21:43:24] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2024-06-02 21:43:24] [INFO ] Redundant transitions in 8 ms returned []
Running 591 sub problems to find dead transitions.
[2024-06-02 21:43:24] [INFO ] Flow matrix only has 588 transitions (discarded 11 similar events)
[2024-06-02 21:43:24] [INFO ] Invariant cache hit.
[2024-06-02 21:43:24] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-02 21:43:29] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 1 ms to minimize.
[2024-06-02 21:43:29] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 1 ms to minimize.
[2024-06-02 21:43:29] [INFO ] Deduced a trap composed of 58 places in 42 ms of which 1 ms to minimize.
[2024-06-02 21:43:29] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2024-06-02 21:43:30] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2024-06-02 21:43:30] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-06-02 21:43:30] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 0 ms to minimize.
[2024-06-02 21:43:30] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-02 21:43:30] [INFO ] Deduced a trap composed of 138 places in 85 ms of which 1 ms to minimize.
[2024-06-02 21:43:33] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 7 ms to minimize.
[2024-06-02 21:43:33] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 4 (OVERLAPS) 588/772 variables, 184/205 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/772 variables, 94/299 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/772 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 7 (OVERLAPS) 0/772 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 591 unsolved
No progress, stopping.
After SMT solving in domain Real declared 772/772 variables, and 299 constraints, problems are : Problem set: 0 solved, 591 unsolved in 25348 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 4 (OVERLAPS) 588/772 variables, 184/205 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/772 variables, 94/299 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/772 variables, 591/890 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 772/772 variables, and 890 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 11/11 constraints]
After SMT, in 56226ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 56232ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56742 ms. Remains : 184/184 places, 599/599 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 115 edges and 184 vertex of which 29 / 184 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 145 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 153 transition count 424
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 153 transition count 424
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 153 transition count 418
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 21 place count 152 transition count 417
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 54 place count 152 transition count 384
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 152 transition count 378
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 69 place count 146 transition count 375
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 69 place count 146 transition count 372
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 143 transition count 372
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 142 transition count 371
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 142 transition count 370
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 141 transition count 369
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 140 transition count 329
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 140 transition count 329
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 140 transition count 326
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 88 place count 137 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 94 place count 137 transition count 320
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 137 transition count 317
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 100 place count 134 transition count 317
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 107 place count 134 transition count 317
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 108 place count 134 transition count 316
Applied a total of 108 rules in 36 ms. Remains 134 /184 variables (removed 50) and now considering 316/599 (removed 283) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:44:20] [INFO ] Flow matrix only has 312 transitions (discarded 4 similar events)
// Phase 1: matrix 312 rows 134 cols
[2024-06-02 21:44:20] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 21:44:20] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:44:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 21:44:20] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:44:20] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:44:20] [INFO ] After 15ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:44:20] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:44:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
TRAPS : Iteration 1
[2024-06-02 21:44:21] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:44:21] [INFO ] After 223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 307 ms.
RANDOM walk for 40000 steps (1375 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (259 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 984476 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :0 out of 1
Probabilistic random walk after 984476 steps, saw 306786 distinct states, run finished after 3001 ms. (steps per millisecond=328 ) properties seen :0
[2024-06-02 21:44:24] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
// Phase 1: matrix 633 rows 206 cols
[2024-06-02 21:44:24] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 21:44:24] [INFO ] State equation strengthened by 98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 633/823 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 98/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/839 variables, 16/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 839/839 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:44:24] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
[2024-06-02 21:44:24] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 633/823 variables, 190/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 98/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/823 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/839 variables, 16/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/839 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/839 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 839/839 variables, and 317 constraints, problems are : Problem set: 0 solved, 1 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 476ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 644/644 transitions.
Graph (complete) has 1097 edges and 206 vertex of which 204 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 204 transition count 642
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 202 transition count 642
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 7 place count 200 transition count 640
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 200 transition count 640
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 13 place count 198 transition count 638
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 197 transition count 637
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 197 transition count 637
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 17 place count 196 transition count 640
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 195 transition count 630
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 195 transition count 630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 194 transition count 628
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 194 transition count 628
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 193 transition count 623
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 193 transition count 623
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 192 transition count 621
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 192 transition count 621
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 191 transition count 616
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 191 transition count 616
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 190 transition count 614
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 190 transition count 614
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 189 transition count 609
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 189 transition count 609
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 188 transition count 607
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 188 transition count 607
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 187 transition count 602
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 187 transition count 602
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 186 transition count 600
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 186 transition count 600
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 185 transition count 597
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 185 transition count 597
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 184 transition count 595
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 184 transition count 595
Applied a total of 41 rules in 55 ms. Remains 184 /206 variables (removed 22) and now considering 595/644 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 184/206 places, 595/644 transitions.
RANDOM walk for 40000 steps (1355 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (278 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1045325 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :0 out of 1
Probabilistic random walk after 1045325 steps, saw 326071 distinct states, run finished after 3001 ms. (steps per millisecond=348 ) properties seen :0
[2024-06-02 21:44:27] [INFO ] Flow matrix only has 584 transitions (discarded 11 similar events)
// Phase 1: matrix 584 rows 184 cols
[2024-06-02 21:44:27] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 21:44:27] [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) 55/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 116/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 584/756 variables, 172/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 93/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/768 variables, 12/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/768 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/768 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 768/768 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 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) 55/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 116/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:44:27] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 1 ms to minimize.
[2024-06-02 21:44:28] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2024-06-02 21:44:28] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 584/756 variables, 172/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 93/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/756 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/756 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/768 variables, 12/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/768 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/768 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 768/768 variables, and 291 constraints, problems are : Problem set: 0 solved, 1 unsolved in 475 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 668ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 595/595 transitions.
Applied a total of 0 rules in 6 ms. Remains 184 /184 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 184/184 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 595/595 transitions.
Applied a total of 0 rules in 5 ms. Remains 184 /184 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-06-02 21:44:28] [INFO ] Flow matrix only has 584 transitions (discarded 11 similar events)
[2024-06-02 21:44:28] [INFO ] Invariant cache hit.
[2024-06-02 21:44:28] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 21:44:28] [INFO ] Flow matrix only has 584 transitions (discarded 11 similar events)
[2024-06-02 21:44:28] [INFO ] Invariant cache hit.
[2024-06-02 21:44:28] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-06-02 21:44:28] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2024-06-02 21:44:28] [INFO ] Redundant transitions in 9 ms returned []
Running 587 sub problems to find dead transitions.
[2024-06-02 21:44:28] [INFO ] Flow matrix only has 584 transitions (discarded 11 similar events)
[2024-06-02 21:44:28] [INFO ] Invariant cache hit.
[2024-06-02 21:44:28] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 587 unsolved
[2024-06-02 21:44:33] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 0 ms to minimize.
[2024-06-02 21:44:33] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-02 21:44:33] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-06-02 21:44:33] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2024-06-02 21:44:33] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:44:34] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 0 ms to minimize.
[2024-06-02 21:44:34] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-02 21:44:34] [INFO ] Deduced a trap composed of 138 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:44:36] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 4 (OVERLAPS) 584/768 variables, 184/203 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/768 variables, 93/296 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/768 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 7 (OVERLAPS) 0/768 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 587 unsolved
No progress, stopping.
After SMT solving in domain Real declared 768/768 variables, and 296 constraints, problems are : Problem set: 0 solved, 587 unsolved in 25751 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 587/587 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 587 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 4 (OVERLAPS) 584/768 variables, 184/203 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/768 variables, 93/296 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/768 variables, 587/883 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/768 variables, and 883 constraints, problems are : Problem set: 0 solved, 587 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 587/587 constraints, Known Traps: 9/9 constraints]
After SMT, in 56486ms problems are : Problem set: 0 solved, 587 unsolved
Search for dead transitions found 0 dead transitions in 56491ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56954 ms. Remains : 184/184 places, 595/595 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 115 edges and 184 vertex of which 29 / 184 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 145 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 153 transition count 420
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 153 transition count 420
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 153 transition count 414
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 21 place count 152 transition count 413
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 54 place count 152 transition count 380
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 152 transition count 374
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 69 place count 146 transition count 371
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 69 place count 146 transition count 368
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 143 transition count 368
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 142 transition count 367
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 142 transition count 366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 141 transition count 365
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 140 transition count 326
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 140 transition count 326
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 140 transition count 323
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 88 place count 137 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 94 place count 137 transition count 317
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 137 transition count 314
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 100 place count 134 transition count 314
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 106 place count 134 transition count 314
Applied a total of 106 rules in 32 ms. Remains 134 /184 variables (removed 50) and now considering 314/595 (removed 281) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:45:25] [INFO ] Flow matrix only has 310 transitions (discarded 4 similar events)
// Phase 1: matrix 310 rows 134 cols
[2024-06-02 21:45:25] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 21:45:25] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:45:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:45:25] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:45:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:45:25] [INFO ] After 9ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:45:25] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:45:25] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 1 ms to minimize.
[2024-06-02 21:45:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
TRAPS : Iteration 1
[2024-06-02 21:45:25] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:45:25] [INFO ] After 240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 318 ms.
RANDOM walk for 40000 steps (1400 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (276 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1013163 steps, run timeout after 3001 ms. (steps per millisecond=337 ) properties seen :0 out of 1
Probabilistic random walk after 1013163 steps, saw 314702 distinct states, run finished after 3001 ms. (steps per millisecond=337 ) properties seen :0
[2024-06-02 21:45:28] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
// Phase 1: matrix 633 rows 206 cols
[2024-06-02 21:45:28] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 21:45:28] [INFO ] State equation strengthened by 98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 633/823 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 98/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/839 variables, 16/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 839/839 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:45:28] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2024-06-02 21:45:28] [INFO ] Deduced a trap composed of 36 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 633/823 variables, 190/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 98/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/823 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/839 variables, 16/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/839 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/839 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 839/839 variables, and 317 constraints, problems are : Problem set: 0 solved, 1 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 467ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 644/644 transitions.
Graph (complete) has 1097 edges and 206 vertex of which 204 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 204 transition count 643
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 203 transition count 642
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 202 transition count 642
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 7 place count 200 transition count 640
Iterating global reduction 3 with 2 rules applied. Total rules applied 9 place count 200 transition count 640
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 3 with 4 rules applied. Total rules applied 13 place count 198 transition count 638
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 15 place count 196 transition count 636
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 196 transition count 636
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 195 transition count 639
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 194 transition count 629
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 194 transition count 629
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 22 place count 193 transition count 627
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 193 transition count 627
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 192 transition count 622
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 192 transition count 622
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 191 transition count 620
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 191 transition count 620
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 190 transition count 615
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 190 transition count 615
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 189 transition count 613
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 189 transition count 613
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 188 transition count 608
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 188 transition count 608
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 187 transition count 606
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 187 transition count 606
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 186 transition count 601
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 186 transition count 601
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 185 transition count 599
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 185 transition count 599
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 184 transition count 596
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 184 transition count 596
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 42 place count 183 transition count 594
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 183 transition count 594
Applied a total of 43 rules in 39 ms. Remains 183 /206 variables (removed 23) and now considering 594/644 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 183/206 places, 594/644 transitions.
RANDOM walk for 40000 steps (1361 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (251 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1064163 steps, run timeout after 3001 ms. (steps per millisecond=354 ) properties seen :0 out of 1
Probabilistic random walk after 1064163 steps, saw 331880 distinct states, run finished after 3002 ms. (steps per millisecond=354 ) properties seen :0
[2024-06-02 21:45:32] [INFO ] Flow matrix only has 583 transitions (discarded 11 similar events)
// Phase 1: matrix 583 rows 183 cols
[2024-06-02 21:45:32] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:45: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) 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) 116/171 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 583/754 variables, 171/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/754 variables, 93/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/754 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/766 variables, 12/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/766 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/766 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 766/766 variables, and 286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 183/183 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) 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) 116/171 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:45:32] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 1 ms to minimize.
[2024-06-02 21:45:32] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 583/754 variables, 171/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/754 variables, 93/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/754 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/754 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/766 variables, 12/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/766 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/766 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 766/766 variables, and 289 constraints, problems are : Problem set: 0 solved, 1 unsolved in 417 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 183/183 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 597ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 594/594 transitions.
Applied a total of 0 rules in 6 ms. Remains 183 /183 variables (removed 0) and now considering 594/594 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 183/183 places, 594/594 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 594/594 transitions.
Applied a total of 0 rules in 5 ms. Remains 183 /183 variables (removed 0) and now considering 594/594 (removed 0) transitions.
[2024-06-02 21:45:32] [INFO ] Flow matrix only has 583 transitions (discarded 11 similar events)
[2024-06-02 21:45:32] [INFO ] Invariant cache hit.
[2024-06-02 21:45:32] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 21:45:32] [INFO ] Flow matrix only has 583 transitions (discarded 11 similar events)
[2024-06-02 21:45:32] [INFO ] Invariant cache hit.
[2024-06-02 21:45:33] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-06-02 21:45:33] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
[2024-06-02 21:45:33] [INFO ] Redundant transitions in 5 ms returned []
Running 586 sub problems to find dead transitions.
[2024-06-02 21:45:33] [INFO ] Flow matrix only has 583 transitions (discarded 11 similar events)
[2024-06-02 21:45:33] [INFO ] Invariant cache hit.
[2024-06-02 21:45:33] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-02 21:45:37] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-06-02 21:45:37] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
[2024-06-02 21:45:37] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2024-06-02 21:45:37] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-06-02 21:45:37] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2024-06-02 21:45:37] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2024-06-02 21:45:38] [INFO ] Deduced a trap composed of 137 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:45:39] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 4 (OVERLAPS) 583/766 variables, 183/201 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/766 variables, 93/294 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/766 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 7 (OVERLAPS) 0/766 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 586 unsolved
No progress, stopping.
After SMT solving in domain Real declared 766/766 variables, and 294 constraints, problems are : Problem set: 0 solved, 586 unsolved in 24933 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 183/183 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 586/586 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 586 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 4 (OVERLAPS) 583/766 variables, 183/201 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/766 variables, 93/294 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/766 variables, 586/880 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/766 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/766 variables, and 880 constraints, problems are : Problem set: 0 solved, 586 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 183/183 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 586/586 constraints, Known Traps: 8/8 constraints]
After SMT, in 55676ms problems are : Problem set: 0 solved, 586 unsolved
Search for dead transitions found 0 dead transitions in 55682ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56148 ms. Remains : 183/183 places, 594/594 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 113 edges and 183 vertex of which 29 / 183 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 145 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 152 transition count 419
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 152 transition count 419
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 152 transition count 413
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 21 place count 151 transition count 412
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 1 with 34 rules applied. Total rules applied 55 place count 151 transition count 378
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 61 place count 151 transition count 372
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 70 place count 145 transition count 369
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 70 place count 145 transition count 366
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 76 place count 142 transition count 366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 141 transition count 365
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 141 transition count 364
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 140 transition count 363
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 82 place count 139 transition count 324
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 139 transition count 324
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 86 place count 139 transition count 321
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 89 place count 136 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 95 place count 136 transition count 315
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 98 place count 136 transition count 312
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 101 place count 133 transition count 312
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 107 place count 133 transition count 312
Applied a total of 107 rules in 33 ms. Remains 133 /183 variables (removed 50) and now considering 312/594 (removed 282) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:46:29] [INFO ] Flow matrix only has 308 transitions (discarded 4 similar events)
// Phase 1: matrix 308 rows 133 cols
[2024-06-02 21:46:29] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 21:46:29] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:46:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:46:29] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:46:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:46:29] [INFO ] After 15ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:46:29] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
[2024-06-02 21:46:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
TRAPS : Iteration 1
[2024-06-02 21:46:29] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:46:29] [INFO ] After 182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 265 ms.
RANDOM walk for 40000 steps (1364 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (266 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1045213 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :0 out of 1
Probabilistic random walk after 1045213 steps, saw 326035 distinct states, run finished after 3001 ms. (steps per millisecond=348 ) properties seen :0
[2024-06-02 21:46:32] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
// Phase 1: matrix 633 rows 206 cols
[2024-06-02 21:46:32] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:46:32] [INFO ] State equation strengthened by 98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 633/823 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 98/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/839 variables, 16/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 839/839 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:46:32] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 1 ms to minimize.
[2024-06-02 21:46:32] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 1 ms to minimize.
[2024-06-02 21:46:32] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 633/823 variables, 190/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 98/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/823 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/839 variables, 16/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/839 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/839 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 839/839 variables, and 318 constraints, problems are : Problem set: 0 solved, 1 unsolved in 533 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 729ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 644/644 transitions.
Graph (complete) has 1097 edges and 206 vertex of which 204 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 204 transition count 642
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 202 transition count 642
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 7 place count 200 transition count 640
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 200 transition count 640
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 13 place count 198 transition count 638
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 196 transition count 636
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 196 transition count 636
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 21 place count 194 transition count 642
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 193 transition count 632
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 193 transition count 632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 192 transition count 630
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 192 transition count 630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 191 transition count 625
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 191 transition count 625
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 190 transition count 623
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 190 transition count 623
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 189 transition count 618
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 189 transition count 618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 188 transition count 616
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 188 transition count 616
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 187 transition count 611
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 187 transition count 611
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 186 transition count 609
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 186 transition count 609
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 185 transition count 604
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 185 transition count 604
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 184 transition count 602
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 184 transition count 602
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 183 transition count 599
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 183 transition count 599
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 182 transition count 597
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 182 transition count 597
Applied a total of 45 rules in 40 ms. Remains 182 /206 variables (removed 24) and now considering 597/644 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 182/206 places, 597/644 transitions.
RANDOM walk for 40000 steps (1393 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (267 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1103696 steps, run timeout after 3001 ms. (steps per millisecond=367 ) properties seen :0 out of 1
Probabilistic random walk after 1103696 steps, saw 343293 distinct states, run finished after 3001 ms. (steps per millisecond=367 ) properties seen :0
[2024-06-02 21:46:36] [INFO ] Flow matrix only has 586 transitions (discarded 11 similar events)
// Phase 1: matrix 586 rows 182 cols
[2024-06-02 21:46:36] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:46:36] [INFO ] State equation strengthened by 94 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) 116/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 586/756 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 94/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/768 variables, 12/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/768 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/768 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 768/768 variables, and 286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 94/94 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) 116/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:46:36] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-06-02 21:46:36] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:46:36] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:46:36] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 586/756 variables, 170/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 94/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/756 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/756 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/768 variables, 12/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/768 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/768 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 768/768 variables, and 291 constraints, problems are : Problem set: 0 solved, 1 unsolved in 489 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 662ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 597/597 transitions.
Applied a total of 0 rules in 5 ms. Remains 182 /182 variables (removed 0) and now considering 597/597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 182/182 places, 597/597 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 597/597 transitions.
Applied a total of 0 rules in 6 ms. Remains 182 /182 variables (removed 0) and now considering 597/597 (removed 0) transitions.
[2024-06-02 21:46:36] [INFO ] Flow matrix only has 586 transitions (discarded 11 similar events)
[2024-06-02 21:46:36] [INFO ] Invariant cache hit.
[2024-06-02 21:46:36] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 21:46:36] [INFO ] Flow matrix only has 586 transitions (discarded 11 similar events)
[2024-06-02 21:46:36] [INFO ] Invariant cache hit.
[2024-06-02 21:46:37] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 21:46:37] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2024-06-02 21:46:37] [INFO ] Redundant transitions in 7 ms returned []
Running 589 sub problems to find dead transitions.
[2024-06-02 21:46:37] [INFO ] Flow matrix only has 586 transitions (discarded 11 similar events)
[2024-06-02 21:46:37] [INFO ] Invariant cache hit.
[2024-06-02 21:46:37] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-02 21:46:41] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:46:41] [INFO ] Deduced a trap composed of 99 places in 78 ms of which 1 ms to minimize.
[2024-06-02 21:46:41] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-06-02 21:46:41] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-06-02 21:46:41] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 1 ms to minimize.
[2024-06-02 21:46:42] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-06-02 21:46:42] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-06-02 21:46:42] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 0 ms to minimize.
[2024-06-02 21:46:42] [INFO ] Deduced a trap composed of 136 places in 74 ms of which 2 ms to minimize.
[2024-06-02 21:46:44] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 4 (OVERLAPS) 586/768 variables, 182/202 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/768 variables, 94/296 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/768 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 7 (OVERLAPS) 0/768 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 589 unsolved
No progress, stopping.
After SMT solving in domain Real declared 768/768 variables, and 296 constraints, problems are : Problem set: 0 solved, 589 unsolved in 25218 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 589 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-02 21:47:05] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
[2024-06-02 21:47:05] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 5 (OVERLAPS) 586/768 variables, 182/204 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/768 variables, 94/298 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 589/887 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/768 variables, and 887 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 12/12 constraints]
After SMT, in 55917ms problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 55924ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56381 ms. Remains : 182/182 places, 597/597 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 113 edges and 182 vertex of which 29 / 182 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 145 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 151 transition count 422
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 151 transition count 422
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 151 transition count 416
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 21 place count 150 transition count 415
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 1 with 38 rules applied. Total rules applied 59 place count 150 transition count 377
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 65 place count 150 transition count 371
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 74 place count 144 transition count 368
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 74 place count 144 transition count 365
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 80 place count 141 transition count 365
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 140 transition count 364
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 140 transition count 363
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 139 transition count 362
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 138 transition count 323
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 138 transition count 323
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 138 transition count 320
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 93 place count 135 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 99 place count 135 transition count 314
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 102 place count 135 transition count 311
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 105 place count 132 transition count 311
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 111 place count 132 transition count 311
Applied a total of 111 rules in 40 ms. Remains 132 /182 variables (removed 50) and now considering 311/597 (removed 286) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:47:33] [INFO ] Flow matrix only has 307 transitions (discarded 4 similar events)
// Phase 1: matrix 307 rows 132 cols
[2024-06-02 21:47:33] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 21:47:33] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:47:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:47:33] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:47:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:47:33] [INFO ] After 22ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:47:33] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:47:33] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 234 ms.
RANDOM walk for 40000 steps (1397 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (262 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1034717 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :0 out of 1
Probabilistic random walk after 1034717 steps, saw 322413 distinct states, run finished after 3001 ms. (steps per millisecond=344 ) properties seen :0
[2024-06-02 21:47:36] [INFO ] Flow matrix only has 633 transitions (discarded 11 similar events)
// Phase 1: matrix 633 rows 206 cols
[2024-06-02 21:47:36] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 21:47:36] [INFO ] State equation strengthened by 98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 633/823 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 98/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/839 variables, 16/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/839 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 839/839 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 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) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/190 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:47:36] [INFO ] Deduced a trap composed of 44 places in 30 ms of which 1 ms to minimize.
[2024-06-02 21:47:36] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 633/823 variables, 190/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 98/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/823 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/839 variables, 16/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/839 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/839 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 839/839 variables, and 317 constraints, problems are : Problem set: 0 solved, 1 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 474ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 644/644 transitions.
Graph (complete) has 1097 edges and 206 vertex of which 204 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 204 transition count 642
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 202 transition count 642
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 7 place count 200 transition count 640
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 200 transition count 640
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 13 place count 198 transition count 638
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 196 transition count 636
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 196 transition count 636
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 21 place count 194 transition count 642
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 192 transition count 622
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 192 transition count 622
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 191 transition count 620
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 191 transition count 620
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 190 transition count 615
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 190 transition count 615
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 189 transition count 613
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 189 transition count 613
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 188 transition count 608
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 188 transition count 608
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 187 transition count 606
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 187 transition count 606
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 186 transition count 601
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 186 transition count 601
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 185 transition count 599
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 185 transition count 599
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 184 transition count 594
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 184 transition count 594
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 183 transition count 592
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 183 transition count 592
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 182 transition count 589
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 182 transition count 589
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 181 transition count 587
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 181 transition count 587
Applied a total of 47 rules in 41 ms. Remains 181 /206 variables (removed 25) and now considering 587/644 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 181/206 places, 587/644 transitions.
RANDOM walk for 40000 steps (1379 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (252 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1112726 steps, run timeout after 3001 ms. (steps per millisecond=370 ) properties seen :0 out of 1
Probabilistic random walk after 1112726 steps, saw 345920 distinct states, run finished after 3001 ms. (steps per millisecond=370 ) properties seen :0
[2024-06-02 21:47:40] [INFO ] Flow matrix only has 576 transitions (discarded 11 similar events)
// Phase 1: matrix 576 rows 181 cols
[2024-06-02 21:47:40] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:47:40] [INFO ] State equation strengthened by 92 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) 116/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) 576/745 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/745 variables, 92/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/745 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/757 variables, 12/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/757 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/757 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 757/757 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 92/92 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) 116/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:47:40] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-06-02 21:47:40] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 0 ms to minimize.
[2024-06-02 21:47:40] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 1 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) 576/745 variables, 169/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/745 variables, 92/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/745 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/757 variables, 12/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/757 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/757 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 757/757 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 540ms 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, 587/587 transitions.
Applied a total of 0 rules in 6 ms. Remains 181 /181 variables (removed 0) and now considering 587/587 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 181/181 places, 587/587 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 587/587 transitions.
Applied a total of 0 rules in 6 ms. Remains 181 /181 variables (removed 0) and now considering 587/587 (removed 0) transitions.
[2024-06-02 21:47:40] [INFO ] Flow matrix only has 576 transitions (discarded 11 similar events)
[2024-06-02 21:47:40] [INFO ] Invariant cache hit.
[2024-06-02 21:47:40] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 21:47:40] [INFO ] Flow matrix only has 576 transitions (discarded 11 similar events)
[2024-06-02 21:47:40] [INFO ] Invariant cache hit.
[2024-06-02 21:47:40] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-06-02 21:47:41] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2024-06-02 21:47:41] [INFO ] Redundant transitions in 7 ms returned []
Running 579 sub problems to find dead transitions.
[2024-06-02 21:47:41] [INFO ] Flow matrix only has 576 transitions (discarded 11 similar events)
[2024-06-02 21:47:41] [INFO ] Invariant cache hit.
[2024-06-02 21:47:41] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 579 unsolved
[2024-06-02 21:47:45] [INFO ] Deduced a trap composed of 99 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:47:45] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-06-02 21:47:45] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:47:45] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-06-02 21:47:45] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:47:45] [INFO ] Deduced a trap composed of 43 places in 28 ms of which 0 ms to minimize.
[2024-06-02 21:47:45] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-02 21:47:46] [INFO ] Deduced a trap composed of 135 places in 85 ms of which 1 ms to minimize.
[2024-06-02 21:47:47] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 579 unsolved
[2024-06-02 21:47:48] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 5 (OVERLAPS) 576/757 variables, 181/201 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/757 variables, 92/293 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/757 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 8 (OVERLAPS) 0/757 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 579 unsolved
No progress, stopping.
After SMT solving in domain Real declared 757/757 variables, and 293 constraints, problems are : Problem set: 0 solved, 579 unsolved in 27003 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 579/579 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 579 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (OVERLAPS) 576/757 variables, 181/201 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/757 variables, 92/293 constraints. Problems are: Problem set: 0 solved, 579 unsolved
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FireWire-PT-20, examination is 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 r564-tall-171734907800203"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;