About the Execution of LTSMin+red for EisenbergMcGuire-PT-07
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2127.815 | 1800000.00 | 2836245.00 | 4966.20 | [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.r494-smll-171636275100114.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 EisenbergMcGuire-PT-07, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r494-smll-171636275100114
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 210K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.2M May 18 16:42 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 Liveness
=== Now, execution of the tool begins
BK_START 1717224148120
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:42:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-06-01 06:42:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:42:31] [INFO ] Load time of PNML (sax parser for PT used): 457 ms
[2024-06-01 06:42:31] [INFO ] Transformed 553 places.
[2024-06-01 06:42:31] [INFO ] Transformed 1960 transitions.
[2024-06-01 06:42:31] [INFO ] Found NUPN structural information;
[2024-06-01 06:42:31] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 876 ms.
Built sparse matrix representations for Structural reductions in 23 ms.29476KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 307 ms. Remains 553 /553 variables (removed 0) and now considering 1960/1960 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 341 ms. Remains : 553/553 places, 1960/1960 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 114 ms. Remains 553 /553 variables (removed 0) and now considering 1960/1960 (removed 0) transitions.
[2024-06-01 06:42:32] [INFO ] Flow matrix only has 1001 transitions (discarded 959 similar events)
// Phase 1: matrix 1001 rows 553 cols
[2024-06-01 06:42:32] [INFO ] Computed 22 invariants in 23 ms
[2024-06-01 06:42:33] [INFO ] Implicit Places using invariants in 549 ms returned []
[2024-06-01 06:42:33] [INFO ] Flow matrix only has 1001 transitions (discarded 959 similar events)
[2024-06-01 06:42:33] [INFO ] Invariant cache hit.
[2024-06-01 06:42:33] [INFO ] State equation strengthened by 472 read => feed constraints.
[2024-06-01 06:42:34] [INFO ] Implicit Places using invariants and state equation in 871 ms returned []
Implicit Place search using SMT with State Equation took 1481 ms to find 0 implicit places.
[2024-06-01 06:42:34] [INFO ] Redundant transitions in 154 ms returned []
Running 1953 sub problems to find dead transitions.
[2024-06-01 06:42:34] [INFO ] Flow matrix only has 1001 transitions (discarded 959 similar events)
[2024-06-01 06:42:34] [INFO ] Invariant cache hit.
[2024-06-01 06:42:34] [INFO ] State equation strengthened by 472 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 553/553 constraints. Problems are: Problem set: 0 solved, 1953 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 15/568 constraints. Problems are: Problem set: 0 solved, 1953 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/553 variables, 7/575 constraints. Problems are: Problem set: 0 solved, 1953 unsolved
[2024-06-01 06:43:06] [INFO ] Deduced a trap composed of 59 places in 362 ms of which 39 ms to minimize.
SMT process timed out in 32102ms, After SMT, problems are : Problem set: 0 solved, 1953 unsolved
Search for dead transitions found 0 dead transitions in 32177ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 33965 ms. Remains : 553/553 places, 1960/1960 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2921 ms (no deadlock found). (steps per millisecond=427 )
Random directed walk for 1250005 steps, including 0 resets, run took 3899 ms (no deadlock found). (steps per millisecond=320 )
[2024-06-01 06:43:13] [INFO ] Flow matrix only has 1001 transitions (discarded 959 similar events)
[2024-06-01 06:43:13] [INFO ] Invariant cache hit.
[2024-06-01 06:43:13] [INFO ] [Real]Absence check using 15 positive place invariants in 31 ms returned sat
[2024-06-01 06:43:14] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 90 ms returned sat
[2024-06-01 06:43:15] [INFO ] [Real]Absence check using state equation in 1097 ms returned sat
[2024-06-01 06:43:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:43:15] [INFO ] [Nat]Absence check using 15 positive place invariants in 22 ms returned sat
[2024-06-01 06:43:15] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 40 ms returned sat
[2024-06-01 06:43:16] [INFO ] [Nat]Absence check using state equation in 1053 ms returned sat
[2024-06-01 06:43:16] [INFO ] State equation strengthened by 472 read => feed constraints.
[2024-06-01 06:43:17] [INFO ] [Nat]Added 472 Read/Feed constraints in 134 ms returned sat
[2024-06-01 06:43:17] [INFO ] Deduced a trap composed of 84 places in 421 ms of which 6 ms to minimize.
[2024-06-01 06:43:18] [INFO ] Deduced a trap composed of 94 places in 566 ms of which 6 ms to minimize.
[2024-06-01 06:43:18] [INFO ] Deduced a trap composed of 90 places in 483 ms of which 6 ms to minimize.
[2024-06-01 06:43:19] [INFO ] Deduced a trap composed of 3 places in 482 ms of which 6 ms to minimize.
[2024-06-01 06:43:19] [INFO ] Deduced a trap composed of 3 places in 498 ms of which 6 ms to minimize.
[2024-06-01 06:43:20] [INFO ] Deduced a trap composed of 3 places in 479 ms of which 6 ms to minimize.
[2024-06-01 06:43:21] [INFO ] Deduced a trap composed of 4 places in 475 ms of which 7 ms to minimize.
[2024-06-01 06:43:21] [INFO ] Deduced a trap composed of 3 places in 488 ms of which 6 ms to minimize.
[2024-06-01 06:43:22] [INFO ] Deduced a trap composed of 61 places in 533 ms of which 8 ms to minimize.
[2024-06-01 06:43:23] [INFO ] Deduced a trap composed of 108 places in 623 ms of which 7 ms to minimize.
[2024-06-01 06:43:23] [INFO ] Deduced a trap composed of 52 places in 527 ms of which 5 ms to minimize.
[2024-06-01 06:43:24] [INFO ] Deduced a trap composed of 35 places in 497 ms of which 5 ms to minimize.
[2024-06-01 06:43:24] [INFO ] Deduced a trap composed of 26 places in 503 ms of which 5 ms to minimize.
[2024-06-01 06:43:25] [INFO ] Deduced a trap composed of 122 places in 437 ms of which 5 ms to minimize.
[2024-06-01 06:43:25] [INFO ] Deduced a trap composed of 3 places in 562 ms of which 8 ms to minimize.
[2024-06-01 06:43:26] [INFO ] Deduced a trap composed of 32 places in 363 ms of which 5 ms to minimize.
[2024-06-01 06:43:26] [INFO ] Deduced a trap composed of 31 places in 558 ms of which 5 ms to minimize.
[2024-06-01 06:43:27] [INFO ] Deduced a trap composed of 70 places in 711 ms of which 8 ms to minimize.
[2024-06-01 06:43:28] [INFO ] Deduced a trap composed of 86 places in 638 ms of which 5 ms to minimize.
[2024-06-01 06:43:29] [INFO ] Deduced a trap composed of 3 places in 448 ms of which 6 ms to minimize.
[2024-06-01 06:43:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 20 trap constraints in 11986 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 553 transition count 1953
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 546 transition count 1953
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 546 transition count 1799
Deduced a syphon composed of 154 places in 4 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 392 transition count 1799
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 5 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 406 place count 350 transition count 1757
Applied a total of 406 rules in 135 ms. Remains 350 /553 variables (removed 203) and now considering 1757/1960 (removed 203) transitions.
[2024-06-01 06:43:29] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
// Phase 1: matrix 798 rows 350 cols
[2024-06-01 06:43:29] [INFO ] Computed 22 invariants in 16 ms
[2024-06-01 06:43:29] [INFO ] Implicit Places using invariants in 752 ms returned []
[2024-06-01 06:43:29] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
[2024-06-01 06:43:29] [INFO ] Invariant cache hit.
[2024-06-01 06:43:30] [INFO ] State equation strengthened by 472 read => feed constraints.
[2024-06-01 06:43:32] [INFO ] Implicit Places using invariants and state equation in 2920 ms returned []
Implicit Place search using SMT with State Equation took 3678 ms to find 0 implicit places.
Running 1750 sub problems to find dead transitions.
[2024-06-01 06:43:32] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
[2024-06-01 06:43:32] [INFO ] Invariant cache hit.
[2024-06-01 06:43:32] [INFO ] State equation strengthened by 472 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 350/350 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 15/365 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 7/372 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
[2024-06-01 06:43:50] [INFO ] Deduced a trap composed of 3 places in 327 ms of which 3 ms to minimize.
[2024-06-01 06:43:51] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:43:51] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:43:51] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:43:51] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:43:51] [INFO ] Deduced a trap composed of 46 places in 290 ms of which 3 ms to minimize.
[2024-06-01 06:43:52] [INFO ] Deduced a trap composed of 71 places in 289 ms of which 4 ms to minimize.
[2024-06-01 06:43:57] [INFO ] Deduced a trap composed of 119 places in 473 ms of which 5 ms to minimize.
[2024-06-01 06:43:57] [INFO ] Deduced a trap composed of 74 places in 434 ms of which 5 ms to minimize.
[2024-06-01 06:43:58] [INFO ] Deduced a trap composed of 92 places in 410 ms of which 5 ms to minimize.
[2024-06-01 06:43:58] [INFO ] Deduced a trap composed of 78 places in 434 ms of which 5 ms to minimize.
[2024-06-01 06:43:59] [INFO ] Deduced a trap composed of 87 places in 414 ms of which 3 ms to minimize.
[2024-06-01 06:43:59] [INFO ] Deduced a trap composed of 81 places in 376 ms of which 4 ms to minimize.
[2024-06-01 06:43:59] [INFO ] Deduced a trap composed of 68 places in 364 ms of which 7 ms to minimize.
[2024-06-01 06:44:00] [INFO ] Deduced a trap composed of 65 places in 453 ms of which 5 ms to minimize.
[2024-06-01 06:44:00] [INFO ] Deduced a trap composed of 107 places in 415 ms of which 4 ms to minimize.
[2024-06-01 06:44:01] [INFO ] Deduced a trap composed of 68 places in 348 ms of which 4 ms to minimize.
[2024-06-01 06:44:01] [INFO ] Deduced a trap composed of 75 places in 333 ms of which 4 ms to minimize.
[2024-06-01 06:44:02] [INFO ] Deduced a trap composed of 74 places in 437 ms of which 6 ms to minimize.
[2024-06-01 06:44:02] [INFO ] Deduced a trap composed of 78 places in 469 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/1148 variables, and 392 constraints, problems are : Problem set: 0 solved, 1750 unsolved in 30103 ms.
Refiners :[Domain max(s): 350/350 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/350 constraints, ReadFeed: 0/472 constraints, PredecessorRefiner: 1750/1750 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1750 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 350/350 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 15/365 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 7/372 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
[2024-06-01 06:44:12] [INFO ] Deduced a trap composed of 94 places in 335 ms of which 4 ms to minimize.
[2024-06-01 06:44:13] [INFO ] Deduced a trap composed of 85 places in 334 ms of which 3 ms to minimize.
[2024-06-01 06:44:13] [INFO ] Deduced a trap composed of 80 places in 437 ms of which 4 ms to minimize.
[2024-06-01 06:44:13] [INFO ] Deduced a trap composed of 82 places in 367 ms of which 3 ms to minimize.
[2024-06-01 06:44:14] [INFO ] Deduced a trap composed of 91 places in 316 ms of which 4 ms to minimize.
[2024-06-01 06:44:14] [INFO ] Deduced a trap composed of 96 places in 345 ms of which 4 ms to minimize.
[2024-06-01 06:44:15] [INFO ] Deduced a trap composed of 63 places in 349 ms of which 3 ms to minimize.
[2024-06-01 06:44:15] [INFO ] Deduced a trap composed of 79 places in 320 ms of which 3 ms to minimize.
[2024-06-01 06:44:15] [INFO ] Deduced a trap composed of 69 places in 335 ms of which 3 ms to minimize.
[2024-06-01 06:44:16] [INFO ] Deduced a trap composed of 83 places in 406 ms of which 6 ms to minimize.
[2024-06-01 06:44:16] [INFO ] Deduced a trap composed of 46 places in 468 ms of which 5 ms to minimize.
[2024-06-01 06:44:17] [INFO ] Deduced a trap composed of 83 places in 405 ms of which 5 ms to minimize.
[2024-06-01 06:44:17] [INFO ] Deduced a trap composed of 83 places in 379 ms of which 3 ms to minimize.
[2024-06-01 06:44:17] [INFO ] Deduced a trap composed of 67 places in 317 ms of which 4 ms to minimize.
[2024-06-01 06:44:18] [INFO ] Deduced a trap composed of 64 places in 343 ms of which 3 ms to minimize.
[2024-06-01 06:44:18] [INFO ] Deduced a trap composed of 69 places in 341 ms of which 4 ms to minimize.
[2024-06-01 06:44:19] [INFO ] Deduced a trap composed of 81 places in 359 ms of which 4 ms to minimize.
[2024-06-01 06:44:19] [INFO ] Deduced a trap composed of 64 places in 351 ms of which 4 ms to minimize.
[2024-06-01 06:44:19] [INFO ] Deduced a trap composed of 86 places in 311 ms of which 3 ms to minimize.
[2024-06-01 06:44:20] [INFO ] Deduced a trap composed of 75 places in 330 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 20/412 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
[2024-06-01 06:44:26] [INFO ] Deduced a trap composed of 76 places in 299 ms of which 4 ms to minimize.
[2024-06-01 06:44:26] [INFO ] Deduced a trap composed of 91 places in 418 ms of which 5 ms to minimize.
[2024-06-01 06:44:27] [INFO ] Deduced a trap composed of 81 places in 413 ms of which 8 ms to minimize.
[2024-06-01 06:44:27] [INFO ] Deduced a trap composed of 88 places in 526 ms of which 6 ms to minimize.
[2024-06-01 06:44:28] [INFO ] Deduced a trap composed of 82 places in 534 ms of which 6 ms to minimize.
[2024-06-01 06:44:28] [INFO ] Deduced a trap composed of 66 places in 547 ms of which 5 ms to minimize.
[2024-06-01 06:44:29] [INFO ] Deduced a trap composed of 85 places in 488 ms of which 6 ms to minimize.
[2024-06-01 06:44:30] [INFO ] Deduced a trap composed of 91 places in 543 ms of which 6 ms to minimize.
[2024-06-01 06:44:30] [INFO ] Deduced a trap composed of 86 places in 504 ms of which 6 ms to minimize.
[2024-06-01 06:44:31] [INFO ] Deduced a trap composed of 77 places in 496 ms of which 6 ms to minimize.
[2024-06-01 06:44:31] [INFO ] Deduced a trap composed of 61 places in 443 ms of which 6 ms to minimize.
[2024-06-01 06:44:32] [INFO ] Deduced a trap composed of 73 places in 516 ms of which 5 ms to minimize.
[2024-06-01 06:44:32] [INFO ] Deduced a trap composed of 67 places in 525 ms of which 5 ms to minimize.
[2024-06-01 06:44:33] [INFO ] Deduced a trap composed of 74 places in 542 ms of which 12 ms to minimize.
[2024-06-01 06:44:33] [INFO ] Deduced a trap composed of 70 places in 547 ms of which 6 ms to minimize.
[2024-06-01 06:44:34] [INFO ] Deduced a trap composed of 76 places in 421 ms of which 4 ms to minimize.
SMT process timed out in 61422ms, After SMT, problems are : Problem set: 0 solved, 1750 unsolved
Search for dead transitions found 0 dead transitions in 61449ms
Starting structural reductions in LIVENESS mode, iteration 1 : 350/553 places, 1757/1960 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 65270 ms. Remains : 350/553 places, 1757/1960 transitions.
Initial state reduction rules removed 7 formulas.
RANDOM walk for 40000 steps (8 resets) in 10085 ms. (3 steps per ms) remains 1401/1750 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 19 ms. (6 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 25 ms. (4 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 24 ms. (4 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 16 ms. (7 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1401/1401 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1401/1401 properties
[2024-06-01 06:44:37] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
[2024-06-01 06:44:37] [INFO ] Invariant cache hit.
[2024-06-01 06:44:37] [INFO ] State equation strengthened by 472 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 264/264 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
SMT process timed out in 6095ms, After SMT, problems are : Problem set: 0 solved, 1401 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 264 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 1757/1757 transitions.
Applied a total of 0 rules in 115 ms. Remains 350 /350 variables (removed 0) and now considering 1757/1757 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 350/350 places, 1757/1757 transitions.
RANDOM walk for 1212066 steps (0 resets) in 120004 ms. (10 steps per ms) remains 1371/1401 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 1371/1371 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 1371/1371 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 1371/1371 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 1371/1371 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1371/1371 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 1371/1371 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1369/1371 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1369/1369 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 1364/1369 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 1362/1364 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 1360/1362 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 1360/1360 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 1353/1360 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 1353/1353 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 1353/1353 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 1353/1353 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 1351/1353 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 1351/1351 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 1351/1351 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 1351/1351 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1351/1351 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 1351/1351 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1350/1351 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 1348/1350 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 1346/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 1346/1346 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 1346/1346 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 1346/1346 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 1346/1346 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 1346/1346 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 1346/1346 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 1346/1346 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 1346/1346 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 1345/1346 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 1342/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 1342/1342 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 1342/1342 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 1342/1342 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 1341/1342 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 1341/1341 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 1341/1341 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 1341/1341 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 1340/1341 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 1340/1340 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 1340/1340 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 1340/1340 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 1339/1340 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 1339/1339 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 1339/1339 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 1339/1339 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 1339/1339 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 1339/1339 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 1338/1339 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 1338/1338 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 1338/1338 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 1338/1338 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 1338/1338 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 1338/1338 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1338/1338 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1338/1338 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 1338/1338 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1338/1338 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 1338/1338 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1337/1338 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1336/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1335/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 1334/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1333/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1331/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1329/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 1328/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 1327/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1326/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1325/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 1325/1325 properties
Probabilistic random walk after 1000000 steps, saw 578750 distinct states, run finished after 56316 ms. (steps per millisecond=17 ) properties seen :343
[2024-06-01 06:46:15] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
[2024-06-01 06:46:15] [INFO ] Invariant cache hit.
[2024-06-01 06:46:15] [INFO ] State equation strengthened by 472 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 3 (OVERLAPS) 179/350 variables, 14/186 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 179/365 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 7/372 constraints. Problems are: Problem set: 0 solved, 982 unsolved
[2024-06-01 06:46:44] [INFO ] Deduced a trap composed of 19 places in 485 ms of which 6 ms to minimize.
[2024-06-01 06:46:44] [INFO ] Deduced a trap composed of 3 places in 509 ms of which 6 ms to minimize.
[2024-06-01 06:46:45] [INFO ] Deduced a trap composed of 31 places in 472 ms of which 6 ms to minimize.
[2024-06-01 06:46:45] [INFO ] Deduced a trap composed of 23 places in 514 ms of which 5 ms to minimize.
[2024-06-01 06:46:46] [INFO ] Deduced a trap composed of 42 places in 500 ms of which 6 ms to minimize.
[2024-06-01 06:46:46] [INFO ] Deduced a trap composed of 25 places in 503 ms of which 5 ms to minimize.
[2024-06-01 06:46:46] [INFO ] Deduced a trap composed of 3 places in 280 ms of which 3 ms to minimize.
[2024-06-01 06:46:47] [INFO ] Deduced a trap composed of 20 places in 541 ms of which 6 ms to minimize.
[2024-06-01 06:46:47] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 3 ms to minimize.
[2024-06-01 06:46:47] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:46:48] [INFO ] Deduced a trap composed of 85 places in 478 ms of which 5 ms to minimize.
[2024-06-01 06:46:49] [INFO ] Deduced a trap composed of 77 places in 399 ms of which 5 ms to minimize.
[2024-06-01 06:46:49] [INFO ] Deduced a trap composed of 77 places in 432 ms of which 4 ms to minimize.
[2024-06-01 06:46:50] [INFO ] Deduced a trap composed of 72 places in 513 ms of which 6 ms to minimize.
[2024-06-01 06:46:50] [INFO ] Deduced a trap composed of 69 places in 490 ms of which 5 ms to minimize.
[2024-06-01 06:46:51] [INFO ] Deduced a trap composed of 85 places in 466 ms of which 5 ms to minimize.
[2024-06-01 06:46:51] [INFO ] Deduced a trap composed of 64 places in 494 ms of which 6 ms to minimize.
[2024-06-01 06:46:52] [INFO ] Deduced a trap composed of 59 places in 454 ms of which 5 ms to minimize.
[2024-06-01 06:46:52] [INFO ] Deduced a trap composed of 3 places in 529 ms of which 6 ms to minimize.
[2024-06-01 06:46:53] [INFO ] Deduced a trap composed of 58 places in 511 ms of which 5 ms to minimize.
(s60 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 982 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/1148 variables, and 392 constraints, problems are : Problem set: 0 solved, 982 unsolved in 45053 ms.
Refiners :[Domain max(s): 350/350 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/350 constraints, ReadFeed: 0/472 constraints, PredecessorRefiner: 982/982 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 982 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 3 (OVERLAPS) 179/350 variables, 14/186 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 179/365 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 7/372 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 982 unsolved
[2024-06-01 06:47:15] [INFO ] Deduced a trap composed of 16 places in 337 ms of which 4 ms to minimize.
[2024-06-01 06:47:15] [INFO ] Deduced a trap composed of 29 places in 270 ms of which 3 ms to minimize.
[2024-06-01 06:47:15] [INFO ] Deduced a trap composed of 30 places in 279 ms of which 3 ms to minimize.
[2024-06-01 06:47:16] [INFO ] Deduced a trap composed of 34 places in 290 ms of which 3 ms to minimize.
[2024-06-01 06:47:16] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 2 ms to minimize.
[2024-06-01 06:47:16] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 3 ms to minimize.
[2024-06-01 06:47:16] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 2 ms to minimize.
[2024-06-01 06:47:17] [INFO ] Deduced a trap composed of 70 places in 385 ms of which 6 ms to minimize.
[2024-06-01 06:47:18] [INFO ] Deduced a trap composed of 74 places in 372 ms of which 4 ms to minimize.
[2024-06-01 06:47:18] [INFO ] Deduced a trap composed of 95 places in 352 ms of which 3 ms to minimize.
[2024-06-01 06:47:19] [INFO ] Deduced a trap composed of 76 places in 298 ms of which 3 ms to minimize.
[2024-06-01 06:47:20] [INFO ] Deduced a trap composed of 82 places in 310 ms of which 4 ms to minimize.
[2024-06-01 06:47:20] [INFO ] Deduced a trap composed of 77 places in 278 ms of which 3 ms to minimize.
[2024-06-01 06:47:20] [INFO ] Deduced a trap composed of 68 places in 480 ms of which 6 ms to minimize.
[2024-06-01 06:47:21] [INFO ] Deduced a trap composed of 74 places in 427 ms of which 5 ms to minimize.
[2024-06-01 06:47:22] [INFO ] Deduced a trap composed of 70 places in 523 ms of which 6 ms to minimize.
[2024-06-01 06:47:22] [INFO ] Deduced a trap composed of 78 places in 564 ms of which 5 ms to minimize.
[2024-06-01 06:47:23] [INFO ] Deduced a trap composed of 60 places in 577 ms of which 6 ms to minimize.
[2024-06-01 06:47:23] [INFO ] Deduced a trap composed of 72 places in 583 ms of which 6 ms to minimize.
[2024-06-01 06:47:24] [INFO ] Deduced a trap composed of 96 places in 565 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 20/412 constraints. Problems are: Problem set: 0 solved, 982 unsolved
[2024-06-01 06:47:26] [INFO ] Deduced a trap composed of 79 places in 500 ms of which 5 ms to minimize.
[2024-06-01 06:47:27] [INFO ] Deduced a trap composed of 17 places in 567 ms of which 6 ms to minimize.
[2024-06-01 06:47:27] [INFO ] Deduced a trap composed of 21 places in 577 ms of which 6 ms to minimize.
[2024-06-01 06:47:28] [INFO ] Deduced a trap composed of 83 places in 555 ms of which 6 ms to minimize.
[2024-06-01 06:47:28] [INFO ] Deduced a trap composed of 68 places in 559 ms of which 5 ms to minimize.
[2024-06-01 06:47:29] [INFO ] Deduced a trap composed of 115 places in 549 ms of which 6 ms to minimize.
[2024-06-01 06:47:30] [INFO ] Deduced a trap composed of 96 places in 543 ms of which 5 ms to minimize.
[2024-06-01 06:47:30] [INFO ] Deduced a trap composed of 79 places in 532 ms of which 5 ms to minimize.
[2024-06-01 06:47:31] [INFO ] Deduced a trap composed of 79 places in 540 ms of which 6 ms to minimize.
[2024-06-01 06:47:31] [INFO ] Deduced a trap composed of 91 places in 510 ms of which 5 ms to minimize.
[2024-06-01 06:47:32] [INFO ] Deduced a trap composed of 104 places in 512 ms of which 5 ms to minimize.
[2024-06-01 06:47:32] [INFO ] Deduced a trap composed of 89 places in 425 ms of which 5 ms to minimize.
[2024-06-01 06:47:33] [INFO ] Deduced a trap composed of 3 places in 579 ms of which 5 ms to minimize.
[2024-06-01 06:47:33] [INFO ] Deduced a trap composed of 92 places in 551 ms of which 6 ms to minimize.
[2024-06-01 06:47:34] [INFO ] Deduced a trap composed of 96 places in 531 ms of which 5 ms to minimize.
[2024-06-01 06:47:35] [INFO ] Deduced a trap composed of 87 places in 542 ms of which 6 ms to minimize.
[2024-06-01 06:47:35] [INFO ] Deduced a trap composed of 92 places in 557 ms of which 6 ms to minimize.
[2024-06-01 06:47:36] [INFO ] Deduced a trap composed of 76 places in 500 ms of which 6 ms to minimize.
[2024-06-01 06:47:36] [INFO ] Deduced a trap composed of 108 places in 463 ms of which 5 ms to minimize.
[2024-06-01 06:47:37] [INFO ] Deduced a trap composed of 74 places in 473 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 20/432 constraints. Problems are: Problem set: 0 solved, 982 unsolved
[2024-06-01 06:47:40] [INFO ] Deduced a trap composed of 95 places in 395 ms of which 5 ms to minimize.
[2024-06-01 06:47:40] [INFO ] Deduced a trap composed of 105 places in 605 ms of which 5 ms to minimize.
[2024-06-01 06:47:41] [INFO ] Deduced a trap composed of 80 places in 544 ms of which 6 ms to minimize.
[2024-06-01 06:47:42] [INFO ] Deduced a trap composed of 75 places in 553 ms of which 5 ms to minimize.
[2024-06-01 06:47:42] [INFO ] Deduced a trap composed of 92 places in 553 ms of which 6 ms to minimize.
[2024-06-01 06:47:43] [INFO ] Deduced a trap composed of 73 places in 538 ms of which 9 ms to minimize.
[2024-06-01 06:47:43] [INFO ] Deduced a trap composed of 85 places in 470 ms of which 5 ms to minimize.
[2024-06-01 06:47:44] [INFO ] Deduced a trap composed of 90 places in 475 ms of which 5 ms to minimize.
[2024-06-01 06:47:44] [INFO ] Deduced a trap composed of 93 places in 487 ms of which 5 ms to minimize.
[2024-06-01 06:47:45] [INFO ] Deduced a trap composed of 82 places in 472 ms of which 5 ms to minimize.
[2024-06-01 06:47:45] [INFO ] Deduced a trap composed of 68 places in 489 ms of which 5 ms to minimize.
[2024-06-01 06:47:46] [INFO ] Deduced a trap composed of 70 places in 445 ms of which 4 ms to minimize.
SMT process timed out in 90864ms, After SMT, problems are : Problem set: 0 solved, 982 unsolved
Fused 982 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 171 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 1757/1757 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 342 transition count 1701
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 342 transition count 1701
Applied a total of 16 rules in 188 ms. Remains 342 /350 variables (removed 8) and now considering 1701/1757 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 342/350 places, 1701/1757 transitions.
RANDOM walk for 1690188 steps (4 resets) in 120004 ms. (14 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 982/982 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 982/982 properties
Probabilistic random walk after 1000000 steps, saw 530341 distinct states, run finished after 61323 ms. (steps per millisecond=16 ) properties seen :23
[2024-06-01 06:49:18] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
// Phase 1: matrix 742 rows 342 cols
[2024-06-01 06:49:18] [INFO ] Computed 22 invariants in 5 ms
[2024-06-01 06:49:18] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 2 (OVERLAPS) 181/342 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 06:49:38] [INFO ] Deduced a trap composed of 50 places in 491 ms of which 5 ms to minimize.
[2024-06-01 06:49:38] [INFO ] Deduced a trap composed of 69 places in 295 ms of which 3 ms to minimize.
[2024-06-01 06:49:38] [INFO ] Deduced a trap composed of 19 places in 334 ms of which 4 ms to minimize.
[2024-06-01 06:49:39] [INFO ] Deduced a trap composed of 17 places in 325 ms of which 4 ms to minimize.
[2024-06-01 06:49:39] [INFO ] Deduced a trap composed of 3 places in 311 ms of which 3 ms to minimize.
[2024-06-01 06:49:39] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:49:40] [INFO ] Deduced a trap composed of 54 places in 311 ms of which 3 ms to minimize.
[2024-06-01 06:49:40] [INFO ] Deduced a trap composed of 70 places in 293 ms of which 4 ms to minimize.
[2024-06-01 06:49:40] [INFO ] Deduced a trap composed of 30 places in 286 ms of which 3 ms to minimize.
[2024-06-01 06:49:40] [INFO ] Deduced a trap composed of 47 places in 295 ms of which 4 ms to minimize.
[2024-06-01 06:49:41] [INFO ] Deduced a trap composed of 92 places in 269 ms of which 3 ms to minimize.
[2024-06-01 06:49:41] [INFO ] Deduced a trap composed of 24 places in 305 ms of which 3 ms to minimize.
[2024-06-01 06:49:41] [INFO ] Deduced a trap composed of 83 places in 271 ms of which 3 ms to minimize.
[2024-06-01 06:49:41] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:49:42] [INFO ] Deduced a trap composed of 78 places in 285 ms of which 3 ms to minimize.
[2024-06-01 06:49:42] [INFO ] Deduced a trap composed of 43 places in 267 ms of which 3 ms to minimize.
[2024-06-01 06:49:42] [INFO ] Deduced a trap composed of 66 places in 280 ms of which 3 ms to minimize.
[2024-06-01 06:49:43] [INFO ] Deduced a trap composed of 18 places in 268 ms of which 3 ms to minimize.
[2024-06-01 06:49:43] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:49:43] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 06:49:44] [INFO ] Deduced a trap composed of 25 places in 278 ms of which 3 ms to minimize.
[2024-06-01 06:49:44] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:49:44] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:49:45] [INFO ] Deduced a trap composed of 80 places in 303 ms of which 4 ms to minimize.
[2024-06-01 06:49:45] [INFO ] Deduced a trap composed of 73 places in 308 ms of which 3 ms to minimize.
[2024-06-01 06:49:45] [INFO ] Deduced a trap composed of 62 places in 271 ms of which 3 ms to minimize.
[2024-06-01 06:49:46] [INFO ] Deduced a trap composed of 56 places in 303 ms of which 4 ms to minimize.
[2024-06-01 06:49:46] [INFO ] Deduced a trap composed of 80 places in 229 ms of which 3 ms to minimize.
[2024-06-01 06:49:47] [INFO ] Deduced a trap composed of 101 places in 272 ms of which 3 ms to minimize.
[2024-06-01 06:49:47] [INFO ] Deduced a trap composed of 88 places in 252 ms of which 3 ms to minimize.
[2024-06-01 06:49:47] [INFO ] Deduced a trap composed of 92 places in 255 ms of which 3 ms to minimize.
[2024-06-01 06:49:48] [INFO ] Deduced a trap composed of 21 places in 254 ms of which 3 ms to minimize.
[2024-06-01 06:49:48] [INFO ] Deduced a trap composed of 84 places in 215 ms of which 3 ms to minimize.
[2024-06-01 06:49:48] [INFO ] Deduced a trap composed of 71 places in 213 ms of which 3 ms to minimize.
[2024-06-01 06:49:49] [INFO ] Deduced a trap composed of 87 places in 322 ms of which 3 ms to minimize.
[2024-06-01 06:49:49] [INFO ] Deduced a trap composed of 78 places in 382 ms of which 5 ms to minimize.
[2024-06-01 06:49:50] [INFO ] Deduced a trap composed of 84 places in 424 ms of which 5 ms to minimize.
[2024-06-01 06:49:50] [INFO ] Deduced a trap composed of 84 places in 467 ms of which 4 ms to minimize.
[2024-06-01 06:49:50] [INFO ] Deduced a trap composed of 82 places in 314 ms of which 3 ms to minimize.
[2024-06-01 06:49:51] [INFO ] Deduced a trap composed of 86 places in 386 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 06:49:52] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 2 ms to minimize.
[2024-06-01 06:49:52] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:49:53] [INFO ] Deduced a trap composed of 66 places in 327 ms of which 4 ms to minimize.
[2024-06-01 06:49:53] [INFO ] Deduced a trap composed of 84 places in 326 ms of which 3 ms to minimize.
[2024-06-01 06:49:54] [INFO ] Deduced a trap composed of 80 places in 316 ms of which 3 ms to minimize.
[2024-06-01 06:49:54] [INFO ] Deduced a trap composed of 96 places in 349 ms of which 5 ms to minimize.
[2024-06-01 06:49:55] [INFO ] Deduced a trap composed of 74 places in 458 ms of which 3 ms to minimize.
[2024-06-01 06:49:55] [INFO ] Deduced a trap composed of 60 places in 323 ms of which 4 ms to minimize.
[2024-06-01 06:49:55] [INFO ] Deduced a trap composed of 76 places in 392 ms of which 4 ms to minimize.
[2024-06-01 06:49:56] [INFO ] Deduced a trap composed of 73 places in 340 ms of which 3 ms to minimize.
[2024-06-01 06:49:56] [INFO ] Deduced a trap composed of 98 places in 270 ms of which 3 ms to minimize.
[2024-06-01 06:49:56] [INFO ] Deduced a trap composed of 80 places in 323 ms of which 3 ms to minimize.
[2024-06-01 06:49:57] [INFO ] Deduced a trap composed of 3 places in 410 ms of which 3 ms to minimize.
[2024-06-01 06:49:58] [INFO ] Deduced a trap composed of 76 places in 335 ms of which 5 ms to minimize.
[2024-06-01 06:49:58] [INFO ] Deduced a trap composed of 62 places in 424 ms of which 3 ms to minimize.
[2024-06-01 06:49:58] [INFO ] Deduced a trap composed of 68 places in 287 ms of which 3 ms to minimize.
[2024-06-01 06:49:59] [INFO ] Deduced a trap composed of 60 places in 333 ms of which 4 ms to minimize.
[2024-06-01 06:49:59] [INFO ] Deduced a trap composed of 84 places in 315 ms of which 4 ms to minimize.
[2024-06-01 06:49:59] [INFO ] Deduced a trap composed of 4 places in 299 ms of which 3 ms to minimize.
[2024-06-01 06:50:00] [INFO ] Deduced a trap composed of 101 places in 368 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 06:50:09] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 2 ms to minimize.
[2024-06-01 06:50:09] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 2 ms to minimize.
[2024-06-01 06:50:10] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 2 ms to minimize.
[2024-06-01 06:50:10] [INFO ] Deduced a trap composed of 25 places in 266 ms of which 3 ms to minimize.
[2024-06-01 06:50:10] [INFO ] Deduced a trap composed of 30 places in 248 ms of which 3 ms to minimize.
[2024-06-01 06:50:10] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 3 ms to minimize.
[2024-06-01 06:50:11] [INFO ] Deduced a trap composed of 65 places in 371 ms of which 4 ms to minimize.
[2024-06-01 06:50:11] [INFO ] Deduced a trap composed of 56 places in 291 ms of which 3 ms to minimize.
[2024-06-01 06:50:12] [INFO ] Deduced a trap composed of 74 places in 306 ms of which 3 ms to minimize.
[2024-06-01 06:50:12] [INFO ] Deduced a trap composed of 64 places in 300 ms of which 3 ms to minimize.
[2024-06-01 06:50:12] [INFO ] Deduced a trap composed of 57 places in 341 ms of which 5 ms to minimize.
[2024-06-01 06:50:13] [INFO ] Deduced a trap composed of 73 places in 323 ms of which 3 ms to minimize.
[2024-06-01 06:50:13] [INFO ] Deduced a trap composed of 5 places in 303 ms of which 3 ms to minimize.
[2024-06-01 06:50:13] [INFO ] Deduced a trap composed of 19 places in 279 ms of which 3 ms to minimize.
[2024-06-01 06:50:14] [INFO ] Deduced a trap composed of 69 places in 286 ms of which 3 ms to minimize.
[2024-06-01 06:50:14] [INFO ] Deduced a trap composed of 51 places in 300 ms of which 3 ms to minimize.
[2024-06-01 06:50:14] [INFO ] Deduced a trap composed of 99 places in 296 ms of which 3 ms to minimize.
[2024-06-01 06:50:15] [INFO ] Deduced a trap composed of 63 places in 267 ms of which 3 ms to minimize.
[2024-06-01 06:50:15] [INFO ] Deduced a trap composed of 70 places in 217 ms of which 3 ms to minimize.
[2024-06-01 06:50:15] [INFO ] Deduced a trap composed of 78 places in 213 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 06:50:17] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 2 ms to minimize.
[2024-06-01 06:50:17] [INFO ] Deduced a trap composed of 15 places in 309 ms of which 3 ms to minimize.
[2024-06-01 06:50:17] [INFO ] Deduced a trap composed of 68 places in 417 ms of which 6 ms to minimize.
[2024-06-01 06:50:18] [INFO ] Deduced a trap composed of 107 places in 371 ms of which 4 ms to minimize.
[2024-06-01 06:50:18] [INFO ] Deduced a trap composed of 79 places in 409 ms of which 4 ms to minimize.
[2024-06-01 06:50:18] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-06-01 06:50:18] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:50:19] [INFO ] Deduced a trap composed of 91 places in 308 ms of which 4 ms to minimize.
[2024-06-01 06:50:19] [INFO ] Deduced a trap composed of 93 places in 369 ms of which 5 ms to minimize.
[2024-06-01 06:50:20] [INFO ] Deduced a trap composed of 87 places in 474 ms of which 4 ms to minimize.
[2024-06-01 06:50:20] [INFO ] Deduced a trap composed of 69 places in 449 ms of which 4 ms to minimize.
[2024-06-01 06:50:20] [INFO ] Deduced a trap composed of 83 places in 297 ms of which 3 ms to minimize.
[2024-06-01 06:50:21] [INFO ] Deduced a trap composed of 89 places in 322 ms of which 4 ms to minimize.
[2024-06-01 06:50:21] [INFO ] Deduced a trap composed of 92 places in 362 ms of which 4 ms to minimize.
[2024-06-01 06:50:21] [INFO ] Deduced a trap composed of 72 places in 344 ms of which 4 ms to minimize.
[2024-06-01 06:50:22] [INFO ] Deduced a trap composed of 67 places in 428 ms of which 5 ms to minimize.
[2024-06-01 06:50:22] [INFO ] Deduced a trap composed of 91 places in 327 ms of which 4 ms to minimize.
[2024-06-01 06:50:23] [INFO ] Deduced a trap composed of 80 places in 345 ms of which 5 ms to minimize.
[2024-06-01 06:50:23] [INFO ] Deduced a trap composed of 67 places in 491 ms of which 5 ms to minimize.
[2024-06-01 06:50:24] [INFO ] Deduced a trap composed of 108 places in 421 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 06:50:26] [INFO ] Deduced a trap composed of 65 places in 364 ms of which 4 ms to minimize.
[2024-06-01 06:50:26] [INFO ] Deduced a trap composed of 69 places in 291 ms of which 3 ms to minimize.
[2024-06-01 06:50:26] [INFO ] Deduced a trap composed of 77 places in 395 ms of which 5 ms to minimize.
[2024-06-01 06:50:28] [INFO ] Deduced a trap composed of 88 places in 379 ms of which 5 ms to minimize.
[2024-06-01 06:50:28] [INFO ] Deduced a trap composed of 72 places in 354 ms of which 4 ms to minimize.
[2024-06-01 06:50:28] [INFO ] Deduced a trap composed of 85 places in 315 ms of which 4 ms to minimize.
[2024-06-01 06:50:29] [INFO ] Deduced a trap composed of 80 places in 362 ms of which 7 ms to minimize.
[2024-06-01 06:50:29] [INFO ] Deduced a trap composed of 65 places in 397 ms of which 3 ms to minimize.
[2024-06-01 06:50:29] [INFO ] Deduced a trap composed of 81 places in 275 ms of which 4 ms to minimize.
[2024-06-01 06:50:30] [INFO ] Deduced a trap composed of 62 places in 277 ms of which 4 ms to minimize.
[2024-06-01 06:50:30] [INFO ] Deduced a trap composed of 72 places in 278 ms of which 3 ms to minimize.
[2024-06-01 06:50:30] [INFO ] Deduced a trap composed of 67 places in 303 ms of which 3 ms to minimize.
[2024-06-01 06:50:31] [INFO ] Deduced a trap composed of 78 places in 287 ms of which 3 ms to minimize.
[2024-06-01 06:50:31] [INFO ] Deduced a trap composed of 69 places in 279 ms of which 4 ms to minimize.
[2024-06-01 06:50:32] [INFO ] Deduced a trap composed of 50 places in 289 ms of which 3 ms to minimize.
[2024-06-01 06:50:32] [INFO ] Deduced a trap composed of 72 places in 271 ms of which 3 ms to minimize.
[2024-06-01 06:50:32] [INFO ] Deduced a trap composed of 66 places in 327 ms of which 4 ms to minimize.
[2024-06-01 06:50:32] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:50:33] [INFO ] Deduced a trap composed of 75 places in 298 ms of which 3 ms to minimize.
[2024-06-01 06:50:33] [INFO ] Deduced a trap composed of 72 places in 254 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 (/ 1.0 2.0))
(s23 0.0)
(s24 (/ 1.0 2.0))
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 (/ 1.0 2.0))
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/1084 variables, and 142 constraints, problems are : Problem set: 0 solved, 959 unsolved in 75031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/342 constraints, ReadFeed: 0/424 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 2 (OVERLAPS) 181/342 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 120/142 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 06:50:44] [INFO ] Deduced a trap composed of 90 places in 456 ms of which 5 ms to minimize.
[2024-06-01 06:50:45] [INFO ] Deduced a trap composed of 72 places in 507 ms of which 5 ms to minimize.
[2024-06-01 06:50:46] [INFO ] Deduced a trap composed of 71 places in 454 ms of which 5 ms to minimize.
[2024-06-01 06:50:46] [INFO ] Deduced a trap composed of 83 places in 450 ms of which 5 ms to minimize.
[2024-06-01 06:50:47] [INFO ] Deduced a trap composed of 74 places in 442 ms of which 6 ms to minimize.
[2024-06-01 06:50:47] [INFO ] Deduced a trap composed of 78 places in 414 ms of which 5 ms to minimize.
[2024-06-01 06:50:48] [INFO ] Deduced a trap composed of 78 places in 401 ms of which 5 ms to minimize.
[2024-06-01 06:50:48] [INFO ] Deduced a trap composed of 75 places in 425 ms of which 5 ms to minimize.
[2024-06-01 06:50:49] [INFO ] Deduced a trap composed of 86 places in 338 ms of which 4 ms to minimize.
[2024-06-01 06:50:49] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:50:50] [INFO ] Deduced a trap composed of 79 places in 496 ms of which 5 ms to minimize.
[2024-06-01 06:50:50] [INFO ] Deduced a trap composed of 28 places in 514 ms of which 5 ms to minimize.
[2024-06-01 06:50:51] [INFO ] Deduced a trap composed of 16 places in 509 ms of which 6 ms to minimize.
[2024-06-01 06:50:51] [INFO ] Deduced a trap composed of 21 places in 485 ms of which 5 ms to minimize.
[2024-06-01 06:50:52] [INFO ] Deduced a trap composed of 71 places in 419 ms of which 5 ms to minimize.
[2024-06-01 06:50:52] [INFO ] Deduced a trap composed of 11 places in 494 ms of which 5 ms to minimize.
[2024-06-01 06:50:53] [INFO ] Deduced a trap composed of 72 places in 447 ms of which 5 ms to minimize.
[2024-06-01 06:50:53] [INFO ] Deduced a trap composed of 70 places in 463 ms of which 5 ms to minimize.
[2024-06-01 06:50:54] [INFO ] Deduced a trap composed of 62 places in 459 ms of which 4 ms to minimize.
[2024-06-01 06:50:54] [INFO ] Deduced a trap composed of 64 places in 454 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 06:50:58] [INFO ] Deduced a trap composed of 69 places in 504 ms of which 6 ms to minimize.
[2024-06-01 06:50:58] [INFO ] Deduced a trap composed of 57 places in 512 ms of which 6 ms to minimize.
[2024-06-01 06:50:59] [INFO ] Deduced a trap composed of 79 places in 515 ms of which 6 ms to minimize.
[2024-06-01 06:50:59] [INFO ] Deduced a trap composed of 56 places in 502 ms of which 5 ms to minimize.
[2024-06-01 06:51:00] [INFO ] Deduced a trap composed of 76 places in 472 ms of which 5 ms to minimize.
[2024-06-01 06:51:00] [INFO ] Deduced a trap composed of 57 places in 481 ms of which 5 ms to minimize.
[2024-06-01 06:51:01] [INFO ] Deduced a trap composed of 54 places in 477 ms of which 5 ms to minimize.
[2024-06-01 06:51:01] [INFO ] Deduced a trap composed of 75 places in 455 ms of which 5 ms to minimize.
[2024-06-01 06:51:02] [INFO ] Deduced a trap composed of 118 places in 450 ms of which 6 ms to minimize.
[2024-06-01 06:51:03] [INFO ] Deduced a trap composed of 70 places in 510 ms of which 6 ms to minimize.
[2024-06-01 06:51:03] [INFO ] Deduced a trap composed of 88 places in 449 ms of which 5 ms to minimize.
[2024-06-01 06:51:04] [INFO ] Deduced a trap composed of 93 places in 503 ms of which 5 ms to minimize.
[2024-06-01 06:51:05] [INFO ] Deduced a trap composed of 76 places in 490 ms of which 5 ms to minimize.
[2024-06-01 06:51:05] [INFO ] Deduced a trap composed of 79 places in 509 ms of which 6 ms to minimize.
[2024-06-01 06:51:06] [INFO ] Deduced a trap composed of 72 places in 460 ms of which 5 ms to minimize.
[2024-06-01 06:51:07] [INFO ] Deduced a trap composed of 87 places in 522 ms of which 5 ms to minimize.
[2024-06-01 06:51:07] [INFO ] Deduced a trap composed of 62 places in 506 ms of which 5 ms to minimize.
[2024-06-01 06:51:08] [INFO ] Deduced a trap composed of 71 places in 489 ms of which 5 ms to minimize.
[2024-06-01 06:51:08] [INFO ] Deduced a trap composed of 90 places in 522 ms of which 6 ms to minimize.
[2024-06-01 06:51:09] [INFO ] Deduced a trap composed of 62 places in 509 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 06:51:12] [INFO ] Deduced a trap composed of 92 places in 517 ms of which 6 ms to minimize.
[2024-06-01 06:51:13] [INFO ] Deduced a trap composed of 60 places in 483 ms of which 5 ms to minimize.
[2024-06-01 06:51:13] [INFO ] Deduced a trap composed of 69 places in 444 ms of which 5 ms to minimize.
[2024-06-01 06:51:14] [INFO ] Deduced a trap composed of 68 places in 511 ms of which 5 ms to minimize.
[2024-06-01 06:51:15] [INFO ] Deduced a trap composed of 51 places in 510 ms of which 6 ms to minimize.
[2024-06-01 06:51:15] [INFO ] Deduced a trap composed of 63 places in 471 ms of which 5 ms to minimize.
[2024-06-01 06:51:16] [INFO ] Deduced a trap composed of 69 places in 471 ms of which 6 ms to minimize.
[2024-06-01 06:51:16] [INFO ] Deduced a trap composed of 80 places in 494 ms of which 6 ms to minimize.
[2024-06-01 06:51:17] [INFO ] Deduced a trap composed of 65 places in 393 ms of which 3 ms to minimize.
[2024-06-01 06:51:17] [INFO ] Deduced a trap composed of 56 places in 297 ms of which 6 ms to minimize.
[2024-06-01 06:51:17] [INFO ] Deduced a trap composed of 44 places in 448 ms of which 5 ms to minimize.
[2024-06-01 06:51:18] [INFO ] Deduced a trap composed of 61 places in 417 ms of which 5 ms to minimize.
[2024-06-01 06:51:18] [INFO ] Deduced a trap composed of 77 places in 469 ms of which 4 ms to minimize.
[2024-06-01 06:51:19] [INFO ] Deduced a trap composed of 64 places in 468 ms of which 5 ms to minimize.
[2024-06-01 06:51:19] [INFO ] Deduced a trap composed of 56 places in 382 ms of which 5 ms to minimize.
[2024-06-01 06:51:20] [INFO ] Deduced a trap composed of 63 places in 477 ms of which 5 ms to minimize.
[2024-06-01 06:51:20] [INFO ] Deduced a trap composed of 60 places in 472 ms of which 5 ms to minimize.
[2024-06-01 06:51:21] [INFO ] Deduced a trap composed of 52 places in 421 ms of which 5 ms to minimize.
[2024-06-01 06:51:21] [INFO ] Deduced a trap composed of 50 places in 470 ms of which 6 ms to minimize.
[2024-06-01 06:51:22] [INFO ] Deduced a trap composed of 66 places in 448 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 06:51:24] [INFO ] Deduced a trap composed of 87 places in 421 ms of which 6 ms to minimize.
[2024-06-01 06:51:25] [INFO ] Deduced a trap composed of 75 places in 524 ms of which 6 ms to minimize.
[2024-06-01 06:51:25] [INFO ] Deduced a trap composed of 87 places in 538 ms of which 6 ms to minimize.
[2024-06-01 06:51:26] [INFO ] Deduced a trap composed of 103 places in 522 ms of which 5 ms to minimize.
[2024-06-01 06:51:27] [INFO ] Deduced a trap composed of 77 places in 507 ms of which 6 ms to minimize.
[2024-06-01 06:51:27] [INFO ] Deduced a trap composed of 87 places in 457 ms of which 5 ms to minimize.
[2024-06-01 06:51:28] [INFO ] Deduced a trap composed of 82 places in 521 ms of which 6 ms to minimize.
[2024-06-01 06:51:28] [INFO ] Deduced a trap composed of 77 places in 509 ms of which 5 ms to minimize.
[2024-06-01 06:51:29] [INFO ] Deduced a trap composed of 75 places in 476 ms of which 6 ms to minimize.
[2024-06-01 06:51:29] [INFO ] Deduced a trap composed of 85 places in 513 ms of which 5 ms to minimize.
[2024-06-01 06:51:30] [INFO ] Deduced a trap composed of 86 places in 497 ms of which 5 ms to minimize.
[2024-06-01 06:51:30] [INFO ] Deduced a trap composed of 76 places in 501 ms of which 5 ms to minimize.
[2024-06-01 06:51:31] [INFO ] Deduced a trap composed of 80 places in 479 ms of which 5 ms to minimize.
[2024-06-01 06:51:31] [INFO ] Deduced a trap composed of 103 places in 509 ms of which 6 ms to minimize.
[2024-06-01 06:51:32] [INFO ] Deduced a trap composed of 79 places in 473 ms of which 5 ms to minimize.
[2024-06-01 06:51:32] [INFO ] Deduced a trap composed of 102 places in 524 ms of which 5 ms to minimize.
[2024-06-01 06:51:33] [INFO ] Deduced a trap composed of 83 places in 459 ms of which 5 ms to minimize.
[2024-06-01 06:51:34] [INFO ] Deduced a trap composed of 69 places in 465 ms of which 5 ms to minimize.
[2024-06-01 06:51:35] [INFO ] Deduced a trap composed of 78 places in 501 ms of which 6 ms to minimize.
[2024-06-01 06:51:35] [INFO ] Deduced a trap composed of 72 places in 479 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 06:51:39] [INFO ] Deduced a trap composed of 69 places in 505 ms of which 6 ms to minimize.
[2024-06-01 06:51:40] [INFO ] Deduced a trap composed of 58 places in 508 ms of which 3 ms to minimize.
[2024-06-01 06:51:40] [INFO ] Deduced a trap composed of 58 places in 303 ms of which 3 ms to minimize.
[2024-06-01 06:51:41] [INFO ] Deduced a trap composed of 55 places in 360 ms of which 5 ms to minimize.
[2024-06-01 06:51:41] [INFO ] Deduced a trap composed of 23 places in 505 ms of which 5 ms to minimize.
[2024-06-01 06:51:42] [INFO ] Deduced a trap composed of 50 places in 470 ms of which 5 ms to minimize.
[2024-06-01 06:51:42] [INFO ] Deduced a trap composed of 33 places in 476 ms of which 5 ms to minimize.
[2024-06-01 06:51:43] [INFO ] Deduced a trap composed of 59 places in 501 ms of which 5 ms to minimize.
[2024-06-01 06:51:43] [INFO ] Deduced a trap composed of 54 places in 443 ms of which 5 ms to minimize.
[2024-06-01 06:51:44] [INFO ] Deduced a trap composed of 72 places in 516 ms of which 6 ms to minimize.
[2024-06-01 06:51:44] [INFO ] Deduced a trap composed of 75 places in 510 ms of which 6 ms to minimize.
[2024-06-01 06:51:45] [INFO ] Deduced a trap composed of 72 places in 548 ms of which 5 ms to minimize.
[2024-06-01 06:51:46] [INFO ] Deduced a trap composed of 75 places in 560 ms of which 5 ms to minimize.
[2024-06-01 06:51:46] [INFO ] Deduced a trap composed of 49 places in 530 ms of which 9 ms to minimize.
[2024-06-01 06:51:47] [INFO ] Deduced a trap composed of 71 places in 458 ms of which 5 ms to minimize.
[2024-06-01 06:51:48] [INFO ] Deduced a trap composed of 73 places in 520 ms of which 5 ms to minimize.
[2024-06-01 06:51:49] [INFO ] Deduced a trap composed of 64 places in 467 ms of which 5 ms to minimize.
[2024-06-01 06:51:49] [INFO ] Deduced a trap composed of 74 places in 511 ms of which 6 ms to minimize.
SMT process timed out in 151137ms, After SMT, problems are : Problem set: 0 solved, 959 unsolved
Fused 959 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 161 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 147 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 342/342 places, 1701/1701 transitions.
RANDOM walk for 1734235 steps (4 resets) in 120004 ms. (14 steps per ms) remains 959/959 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 959/959 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 959/959 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 959/959 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 959/959 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 959/959 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 959/959 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 956/959 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 956/956 properties
Probabilistic random walk after 1000000 steps, saw 530341 distinct states, run finished after 50616 ms. (steps per millisecond=19 ) properties seen :0
[2024-06-01 06:53:11] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-06-01 06:53:11] [INFO ] Invariant cache hit.
[2024-06-01 06:53:11] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 2 (OVERLAPS) 181/342 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 06:53:39] [INFO ] Deduced a trap composed of 50 places in 517 ms of which 6 ms to minimize.
[2024-06-01 06:53:40] [INFO ] Deduced a trap composed of 19 places in 491 ms of which 5 ms to minimize.
[2024-06-01 06:53:40] [INFO ] Deduced a trap composed of 17 places in 466 ms of which 5 ms to minimize.
[2024-06-01 06:53:41] [INFO ] Deduced a trap composed of 54 places in 538 ms of which 6 ms to minimize.
[2024-06-01 06:53:41] [INFO ] Deduced a trap composed of 21 places in 524 ms of which 5 ms to minimize.
[2024-06-01 06:53:42] [INFO ] Deduced a trap composed of 78 places in 477 ms of which 5 ms to minimize.
[2024-06-01 06:53:42] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 3 ms to minimize.
[2024-06-01 06:53:42] [INFO ] Deduced a trap composed of 23 places in 470 ms of which 5 ms to minimize.
[2024-06-01 06:53:43] [INFO ] Deduced a trap composed of 60 places in 469 ms of which 5 ms to minimize.
[2024-06-01 06:53:44] [INFO ] Deduced a trap composed of 3 places in 573 ms of which 6 ms to minimize.
[2024-06-01 06:53:44] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:53:44] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:53:44] [INFO ] Deduced a trap composed of 78 places in 471 ms of which 5 ms to minimize.
[2024-06-01 06:53:45] [INFO ] Deduced a trap composed of 88 places in 462 ms of which 5 ms to minimize.
[2024-06-01 06:53:45] [INFO ] Deduced a trap composed of 70 places in 456 ms of which 5 ms to minimize.
[2024-06-01 06:53:46] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:53:46] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:53:46] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:53:47] [INFO ] Deduced a trap composed of 73 places in 537 ms of which 6 ms to minimize.
[2024-06-01 06:53:48] [INFO ] Deduced a trap composed of 58 places in 511 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 06:53:49] [INFO ] Deduced a trap composed of 3 places in 326 ms of which 4 ms to minimize.
[2024-06-01 06:53:50] [INFO ] Deduced a trap composed of 47 places in 264 ms of which 3 ms to minimize.
[2024-06-01 06:53:50] [INFO ] Deduced a trap composed of 25 places in 279 ms of which 4 ms to minimize.
[2024-06-01 06:53:50] [INFO ] Deduced a trap composed of 48 places in 282 ms of which 4 ms to minimize.
[2024-06-01 06:53:50] [INFO ] Deduced a trap composed of 41 places in 273 ms of which 3 ms to minimize.
[2024-06-01 06:53:51] [INFO ] Deduced a trap composed of 47 places in 285 ms of which 3 ms to minimize.
[2024-06-01 06:53:51] [INFO ] Deduced a trap composed of 36 places in 279 ms of which 3 ms to minimize.
[2024-06-01 06:53:51] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 3 ms to minimize.
[2024-06-01 06:53:51] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 2 ms to minimize.
[2024-06-01 06:53:52] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:53:52] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:53:52] [INFO ] Deduced a trap composed of 74 places in 461 ms of which 5 ms to minimize.
[2024-06-01 06:53:53] [INFO ] Deduced a trap composed of 80 places in 393 ms of which 4 ms to minimize.
[2024-06-01 06:53:53] [INFO ] Deduced a trap composed of 78 places in 490 ms of which 5 ms to minimize.
[2024-06-01 06:53:54] [INFO ] Deduced a trap composed of 81 places in 480 ms of which 5 ms to minimize.
[2024-06-01 06:53:54] [INFO ] Deduced a trap composed of 93 places in 427 ms of which 5 ms to minimize.
[2024-06-01 06:53:55] [INFO ] Deduced a trap composed of 83 places in 416 ms of which 5 ms to minimize.
[2024-06-01 06:53:55] [INFO ] Deduced a trap composed of 77 places in 418 ms of which 5 ms to minimize.
[2024-06-01 06:53:55] [INFO ] Deduced a trap composed of 76 places in 433 ms of which 5 ms to minimize.
[2024-06-01 06:53:56] [INFO ] Deduced a trap composed of 77 places in 386 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 06:53:59] [INFO ] Deduced a trap composed of 65 places in 517 ms of which 5 ms to minimize.
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 64 places in 511 ms of which 5 ms to minimize.
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 101 places in 523 ms of which 5 ms to minimize.
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 61 places in 523 ms of which 5 ms to minimize.
[2024-06-01 06:54:02] [INFO ] Deduced a trap composed of 75 places in 506 ms of which 6 ms to minimize.
[2024-06-01 06:54:02] [INFO ] Deduced a trap composed of 83 places in 524 ms of which 6 ms to minimize.
[2024-06-01 06:54:03] [INFO ] Deduced a trap composed of 60 places in 590 ms of which 5 ms to minimize.
[2024-06-01 06:54:04] [INFO ] Deduced a trap composed of 80 places in 525 ms of which 5 ms to minimize.
[2024-06-01 06:54:04] [INFO ] Deduced a trap composed of 94 places in 542 ms of which 6 ms to minimize.
[2024-06-01 06:54:05] [INFO ] Deduced a trap composed of 59 places in 509 ms of which 6 ms to minimize.
[2024-06-01 06:54:05] [INFO ] Deduced a trap composed of 76 places in 515 ms of which 5 ms to minimize.
[2024-06-01 06:54:06] [INFO ] Deduced a trap composed of 59 places in 496 ms of which 5 ms to minimize.
[2024-06-01 06:54:06] [INFO ] Deduced a trap composed of 66 places in 496 ms of which 5 ms to minimize.
[2024-06-01 06:54:07] [INFO ] Deduced a trap composed of 82 places in 511 ms of which 6 ms to minimize.
[2024-06-01 06:54:07] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:54:08] [INFO ] Deduced a trap composed of 105 places in 511 ms of which 5 ms to minimize.
[2024-06-01 06:54:08] [INFO ] Deduced a trap composed of 91 places in 418 ms of which 5 ms to minimize.
[2024-06-01 06:54:09] [INFO ] Deduced a trap composed of 96 places in 534 ms of which 6 ms to minimize.
[2024-06-01 06:54:09] [INFO ] Deduced a trap composed of 100 places in 494 ms of which 5 ms to minimize.
[2024-06-01 06:54:10] [INFO ] Deduced a trap composed of 93 places in 498 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 06:54:23] [INFO ] Deduced a trap composed of 66 places in 516 ms of which 6 ms to minimize.
[2024-06-01 06:54:24] [INFO ] Deduced a trap composed of 93 places in 542 ms of which 5 ms to minimize.
[2024-06-01 06:54:25] [INFO ] Deduced a trap composed of 67 places in 534 ms of which 6 ms to minimize.
[2024-06-01 06:54:25] [INFO ] Deduced a trap composed of 82 places in 543 ms of which 6 ms to minimize.
[2024-06-01 06:54:26] [INFO ] Deduced a trap composed of 79 places in 538 ms of which 6 ms to minimize.
[2024-06-01 06:54:27] [INFO ] Deduced a trap composed of 82 places in 467 ms of which 6 ms to minimize.
[2024-06-01 06:54:27] [INFO ] Deduced a trap composed of 86 places in 460 ms of which 5 ms to minimize.
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 98 places in 540 ms of which 5 ms to minimize.
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 99 places in 472 ms of which 5 ms to minimize.
[2024-06-01 06:54:29] [INFO ] Deduced a trap composed of 94 places in 454 ms of which 5 ms to minimize.
[2024-06-01 06:54:29] [INFO ] Deduced a trap composed of 86 places in 445 ms of which 5 ms to minimize.
[2024-06-01 06:54:30] [INFO ] Deduced a trap composed of 94 places in 530 ms of which 5 ms to minimize.
[2024-06-01 06:54:30] [INFO ] Deduced a trap composed of 95 places in 450 ms of which 5 ms to minimize.
[2024-06-01 06:54:31] [INFO ] Deduced a trap composed of 103 places in 538 ms of which 6 ms to minimize.
[2024-06-01 06:54:31] [INFO ] Deduced a trap composed of 88 places in 506 ms of which 6 ms to minimize.
[2024-06-01 06:54:32] [INFO ] Deduced a trap composed of 95 places in 451 ms of which 5 ms to minimize.
[2024-06-01 06:54:32] [INFO ] Deduced a trap composed of 76 places in 541 ms of which 6 ms to minimize.
[2024-06-01 06:54:33] [INFO ] Deduced a trap composed of 92 places in 529 ms of which 6 ms to minimize.
[2024-06-01 06:54:33] [INFO ] Deduced a trap composed of 98 places in 512 ms of which 6 ms to minimize.
[2024-06-01 06:54:34] [INFO ] Deduced a trap composed of 76 places in 534 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 06:54:35] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:54:37] [INFO ] Deduced a trap composed of 79 places in 403 ms of which 3 ms to minimize.
[2024-06-01 06:54:38] [INFO ] Deduced a trap composed of 77 places in 473 ms of which 5 ms to minimize.
[2024-06-01 06:54:38] [INFO ] Deduced a trap composed of 75 places in 508 ms of which 6 ms to minimize.
[2024-06-01 06:54:39] [INFO ] Deduced a trap composed of 78 places in 453 ms of which 5 ms to minimize.
[2024-06-01 06:54:39] [INFO ] Deduced a trap composed of 65 places in 378 ms of which 5 ms to minimize.
[2024-06-01 06:54:40] [INFO ] Deduced a trap composed of 92 places in 325 ms of which 3 ms to minimize.
[2024-06-01 06:54:40] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:54:40] [INFO ] Deduced a trap composed of 76 places in 314 ms of which 4 ms to minimize.
[2024-06-01 06:54:41] [INFO ] Deduced a trap composed of 71 places in 310 ms of which 3 ms to minimize.
[2024-06-01 06:54:41] [INFO ] Deduced a trap composed of 67 places in 312 ms of which 3 ms to minimize.
[2024-06-01 06:54:41] [INFO ] Deduced a trap composed of 76 places in 291 ms of which 3 ms to minimize.
[2024-06-01 06:54:42] [INFO ] Deduced a trap composed of 75 places in 331 ms of which 4 ms to minimize.
SMT process timed out in 90758ms, After SMT, problems are : Problem set: 0 solved, 956 unsolved
Fused 956 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 161 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 64 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 342/342 places, 1701/1701 transitions.
RANDOM walk for 1730628 steps (4 resets) in 120005 ms. (14 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 956/956 properties
Probabilistic random walk after 1000000 steps, saw 530341 distinct states, run finished after 57259 ms. (steps per millisecond=17 ) properties seen :0
[2024-06-01 06:56:10] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-06-01 06:56:10] [INFO ] Invariant cache hit.
[2024-06-01 06:56:10] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 2 (OVERLAPS) 181/342 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 06:56:37] [INFO ] Deduced a trap composed of 50 places in 526 ms of which 4 ms to minimize.
[2024-06-01 06:56:37] [INFO ] Deduced a trap composed of 19 places in 410 ms of which 3 ms to minimize.
[2024-06-01 06:56:37] [INFO ] Deduced a trap composed of 17 places in 384 ms of which 4 ms to minimize.
[2024-06-01 06:56:38] [INFO ] Deduced a trap composed of 54 places in 435 ms of which 5 ms to minimize.
[2024-06-01 06:56:38] [INFO ] Deduced a trap composed of 21 places in 455 ms of which 6 ms to minimize.
[2024-06-01 06:56:39] [INFO ] Deduced a trap composed of 78 places in 474 ms of which 5 ms to minimize.
[2024-06-01 06:56:39] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 2 ms to minimize.
[2024-06-01 06:56:39] [INFO ] Deduced a trap composed of 23 places in 478 ms of which 5 ms to minimize.
[2024-06-01 06:56:40] [INFO ] Deduced a trap composed of 60 places in 479 ms of which 6 ms to minimize.
[2024-06-01 06:56:40] [INFO ] Deduced a trap composed of 3 places in 492 ms of which 5 ms to minimize.
[2024-06-01 06:56:41] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:56:41] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:56:41] [INFO ] Deduced a trap composed of 78 places in 482 ms of which 6 ms to minimize.
[2024-06-01 06:56:42] [INFO ] Deduced a trap composed of 88 places in 475 ms of which 5 ms to minimize.
[2024-06-01 06:56:42] [INFO ] Deduced a trap composed of 70 places in 490 ms of which 5 ms to minimize.
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 29 places in 212 ms of which 3 ms to minimize.
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 48 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:56:44] [INFO ] Deduced a trap composed of 73 places in 534 ms of which 6 ms to minimize.
[2024-06-01 06:56:45] [INFO ] Deduced a trap composed of 58 places in 532 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 06:56:47] [INFO ] Deduced a trap composed of 3 places in 354 ms of which 4 ms to minimize.
[2024-06-01 06:56:47] [INFO ] Deduced a trap composed of 47 places in 271 ms of which 4 ms to minimize.
[2024-06-01 06:56:47] [INFO ] Deduced a trap composed of 25 places in 277 ms of which 3 ms to minimize.
[2024-06-01 06:56:47] [INFO ] Deduced a trap composed of 48 places in 275 ms of which 4 ms to minimize.
[2024-06-01 06:56:48] [INFO ] Deduced a trap composed of 41 places in 243 ms of which 3 ms to minimize.
[2024-06-01 06:56:48] [INFO ] Deduced a trap composed of 47 places in 267 ms of which 3 ms to minimize.
[2024-06-01 06:56:48] [INFO ] Deduced a trap composed of 36 places in 274 ms of which 3 ms to minimize.
[2024-06-01 06:56:48] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:56:49] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:56:49] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 2 ms to minimize.
[2024-06-01 06:56:49] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:56:49] [INFO ] Deduced a trap composed of 74 places in 438 ms of which 5 ms to minimize.
[2024-06-01 06:56:50] [INFO ] Deduced a trap composed of 80 places in 348 ms of which 4 ms to minimize.
[2024-06-01 06:56:50] [INFO ] Deduced a trap composed of 78 places in 497 ms of which 5 ms to minimize.
[2024-06-01 06:56:51] [INFO ] Deduced a trap composed of 81 places in 490 ms of which 5 ms to minimize.
[2024-06-01 06:56:51] [INFO ] Deduced a trap composed of 93 places in 434 ms of which 5 ms to minimize.
[2024-06-01 06:56:52] [INFO ] Deduced a trap composed of 83 places in 399 ms of which 4 ms to minimize.
[2024-06-01 06:56:52] [INFO ] Deduced a trap composed of 77 places in 411 ms of which 5 ms to minimize.
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 76 places in 431 ms of which 5 ms to minimize.
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 77 places in 361 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 06:56:56] [INFO ] Deduced a trap composed of 65 places in 509 ms of which 5 ms to minimize.
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 64 places in 527 ms of which 5 ms to minimize.
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 101 places in 506 ms of which 5 ms to minimize.
[2024-06-01 06:56:58] [INFO ] Deduced a trap composed of 61 places in 517 ms of which 5 ms to minimize.
[2024-06-01 06:56:59] [INFO ] Deduced a trap composed of 75 places in 506 ms of which 5 ms to minimize.
[2024-06-01 06:56:59] [INFO ] Deduced a trap composed of 83 places in 522 ms of which 5 ms to minimize.
[2024-06-01 06:57:00] [INFO ] Deduced a trap composed of 60 places in 539 ms of which 5 ms to minimize.
[2024-06-01 06:57:01] [INFO ] Deduced a trap composed of 80 places in 519 ms of which 5 ms to minimize.
[2024-06-01 06:57:01] [INFO ] Deduced a trap composed of 94 places in 518 ms of which 5 ms to minimize.
[2024-06-01 06:57:02] [INFO ] Deduced a trap composed of 59 places in 541 ms of which 6 ms to minimize.
[2024-06-01 06:57:02] [INFO ] Deduced a trap composed of 76 places in 527 ms of which 6 ms to minimize.
[2024-06-01 06:57:03] [INFO ] Deduced a trap composed of 59 places in 531 ms of which 8 ms to minimize.
[2024-06-01 06:57:03] [INFO ] Deduced a trap composed of 66 places in 503 ms of which 6 ms to minimize.
[2024-06-01 06:57:04] [INFO ] Deduced a trap composed of 82 places in 516 ms of which 5 ms to minimize.
[2024-06-01 06:57:04] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:57:05] [INFO ] Deduced a trap composed of 105 places in 526 ms of which 5 ms to minimize.
[2024-06-01 06:57:05] [INFO ] Deduced a trap composed of 91 places in 547 ms of which 5 ms to minimize.
[2024-06-01 06:57:06] [INFO ] Deduced a trap composed of 96 places in 512 ms of which 5 ms to minimize.
[2024-06-01 06:57:06] [INFO ] Deduced a trap composed of 100 places in 501 ms of which 5 ms to minimize.
[2024-06-01 06:57:07] [INFO ] Deduced a trap composed of 93 places in 480 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 06:57:20] [INFO ] Deduced a trap composed of 66 places in 498 ms of which 6 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 93 places in 517 ms of which 5 ms to minimize.
[2024-06-01 06:57:22] [INFO ] Deduced a trap composed of 67 places in 528 ms of which 6 ms to minimize.
[2024-06-01 06:57:22] [INFO ] Deduced a trap composed of 82 places in 536 ms of which 5 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 79 places in 534 ms of which 6 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 82 places in 460 ms of which 5 ms to minimize.
[2024-06-01 06:57:24] [INFO ] Deduced a trap composed of 86 places in 466 ms of which 5 ms to minimize.
[2024-06-01 06:57:24] [INFO ] Deduced a trap composed of 98 places in 477 ms of which 5 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 99 places in 474 ms of which 5 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 94 places in 479 ms of which 5 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 86 places in 441 ms of which 4 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 94 places in 519 ms of which 5 ms to minimize.
[2024-06-01 06:57:27] [INFO ] Deduced a trap composed of 95 places in 515 ms of which 6 ms to minimize.
[2024-06-01 06:57:28] [INFO ] Deduced a trap composed of 103 places in 511 ms of which 5 ms to minimize.
[2024-06-01 06:57:28] [INFO ] Deduced a trap composed of 88 places in 498 ms of which 5 ms to minimize.
[2024-06-01 06:57:29] [INFO ] Deduced a trap composed of 95 places in 469 ms of which 5 ms to minimize.
[2024-06-01 06:57:29] [INFO ] Deduced a trap composed of 76 places in 531 ms of which 6 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 92 places in 483 ms of which 5 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 98 places in 511 ms of which 6 ms to minimize.
[2024-06-01 06:57:31] [INFO ] Deduced a trap composed of 76 places in 513 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:57:34] [INFO ] Deduced a trap composed of 79 places in 511 ms of which 5 ms to minimize.
[2024-06-01 06:57:34] [INFO ] Deduced a trap composed of 77 places in 498 ms of which 5 ms to minimize.
[2024-06-01 06:57:35] [INFO ] Deduced a trap composed of 75 places in 510 ms of which 5 ms to minimize.
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 78 places in 463 ms of which 5 ms to minimize.
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 65 places in 450 ms of which 5 ms to minimize.
[2024-06-01 06:57:37] [INFO ] Deduced a trap composed of 92 places in 519 ms of which 6 ms to minimize.
[2024-06-01 06:57:37] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 76 places in 512 ms of which 6 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 71 places in 474 ms of which 5 ms to minimize.
[2024-06-01 06:57:39] [INFO ] Deduced a trap composed of 67 places in 511 ms of which 6 ms to minimize.
[2024-06-01 06:57:39] [INFO ] Deduced a trap composed of 76 places in 431 ms of which 5 ms to minimize.
[2024-06-01 06:57:40] [INFO ] Deduced a trap composed of 75 places in 523 ms of which 5 ms to minimize.
[2024-06-01 06:57:40] [INFO ] Deduced a trap composed of 76 places in 546 ms of which 5 ms to minimize.
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 81 places in 548 ms of which 6 ms to minimize.
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 91 places in 565 ms of which 5 ms to minimize.
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:57:42] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:57:42] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:57:42] [INFO ] Deduced a trap composed of 61 places in 500 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 06:57:46] [INFO ] Deduced a trap composed of 78 places in 444 ms of which 5 ms to minimize.
[2024-06-01 06:57:47] [INFO ] Deduced a trap composed of 67 places in 424 ms of which 5 ms to minimize.
[2024-06-01 06:57:47] [INFO ] Deduced a trap composed of 72 places in 475 ms of which 6 ms to minimize.
[2024-06-01 06:57:48] [INFO ] Deduced a trap composed of 85 places in 478 ms of which 5 ms to minimize.
[2024-06-01 06:57:48] [INFO ] Deduced a trap composed of 66 places in 473 ms of which 5 ms to minimize.
[2024-06-01 06:57:48] [INFO ] Deduced a trap composed of 83 places in 403 ms of which 5 ms to minimize.
[2024-06-01 06:57:49] [INFO ] Deduced a trap composed of 93 places in 390 ms of which 5 ms to minimize.
[2024-06-01 06:57:50] [INFO ] Deduced a trap composed of 71 places in 523 ms of which 5 ms to minimize.
[2024-06-01 06:57:50] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:57:51] [INFO ] Deduced a trap composed of 68 places in 440 ms of which 5 ms to minimize.
[2024-06-01 06:57:51] [INFO ] Deduced a trap composed of 69 places in 414 ms of which 5 ms to minimize.
[2024-06-01 06:57:51] [INFO ] Deduced a trap composed of 49 places in 446 ms of which 5 ms to minimize.
[2024-06-01 06:57:52] [INFO ] Deduced a trap composed of 58 places in 493 ms of which 5 ms to minimize.
[2024-06-01 06:57:52] [INFO ] Deduced a trap composed of 89 places in 464 ms of which 5 ms to minimize.
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 83 places in 462 ms of which 5 ms to minimize.
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 80 places in 458 ms of which 5 ms to minimize.
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 82 places in 398 ms of which 5 ms to minimize.
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 67 places in 440 ms of which 5 ms to minimize.
[2024-06-01 06:57:55] [INFO ] Deduced a trap composed of 77 places in 425 ms of which 4 ms to minimize.
[2024-06-01 06:57:55] [INFO ] Deduced a trap composed of 54 places in 444 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 956 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/1084 variables, and 142 constraints, problems are : Problem set: 0 solved, 956 unsolved in 105063 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/342 constraints, ReadFeed: 0/424 constraints, PredecessorRefiner: 956/956 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 956 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 2 (OVERLAPS) 181/342 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 120/142 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 06:58:08] [INFO ] Deduced a trap composed of 53 places in 307 ms of which 4 ms to minimize.
[2024-06-01 06:58:08] [INFO ] Deduced a trap composed of 55 places in 354 ms of which 4 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 79 places in 405 ms of which 5 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 63 places in 401 ms of which 5 ms to minimize.
[2024-06-01 06:58:11] [INFO ] Deduced a trap composed of 73 places in 455 ms of which 5 ms to minimize.
[2024-06-01 06:58:11] [INFO ] Deduced a trap composed of 53 places in 475 ms of which 5 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 45 places in 499 ms of which 5 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 43 places in 496 ms of which 5 ms to minimize.
[2024-06-01 06:58:13] [INFO ] Deduced a trap composed of 71 places in 485 ms of which 5 ms to minimize.
[2024-06-01 06:58:13] [INFO ] Deduced a trap composed of 77 places in 490 ms of which 5 ms to minimize.
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 76 places in 454 ms of which 5 ms to minimize.
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 61 places in 438 ms of which 4 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 60 places in 448 ms of which 5 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 63 places in 334 ms of which 4 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 2 ms to minimize.
[2024-06-01 06:58:17] [INFO ] Deduced a trap composed of 71 places in 409 ms of which 5 ms to minimize.
[2024-06-01 06:58:17] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:58:18] [INFO ] Deduced a trap composed of 15 places in 351 ms of which 4 ms to minimize.
[2024-06-01 06:58:18] [INFO ] Deduced a trap composed of 68 places in 472 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 54 places in 533 ms of which 5 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 47 places in 542 ms of which 6 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 59 places in 538 ms of which 6 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 71 places in 508 ms of which 5 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 111 places in 491 ms of which 5 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 78 places in 481 ms of which 5 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 76 places in 534 ms of which 5 ms to minimize.
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 72 places in 515 ms of which 5 ms to minimize.
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 77 places in 546 ms of which 5 ms to minimize.
[2024-06-01 06:58:28] [INFO ] Deduced a trap composed of 90 places in 516 ms of which 6 ms to minimize.
[2024-06-01 06:58:29] [INFO ] Deduced a trap composed of 60 places in 463 ms of which 5 ms to minimize.
[2024-06-01 06:58:29] [INFO ] Deduced a trap composed of 48 places in 464 ms of which 5 ms to minimize.
[2024-06-01 06:58:30] [INFO ] Deduced a trap composed of 71 places in 460 ms of which 5 ms to minimize.
[2024-06-01 06:58:30] [INFO ] Deduced a trap composed of 86 places in 472 ms of which 5 ms to minimize.
[2024-06-01 06:58:31] [INFO ] Deduced a trap composed of 41 places in 474 ms of which 5 ms to minimize.
[2024-06-01 06:58:32] [INFO ] Deduced a trap composed of 73 places in 454 ms of which 5 ms to minimize.
[2024-06-01 06:58:32] [INFO ] Deduced a trap composed of 82 places in 465 ms of which 5 ms to minimize.
[2024-06-01 06:58:33] [INFO ] Deduced a trap composed of 82 places in 494 ms of which 5 ms to minimize.
[2024-06-01 06:58:33] [INFO ] Deduced a trap composed of 50 places in 517 ms of which 5 ms to minimize.
[2024-06-01 06:58:34] [INFO ] Deduced a trap composed of 68 places in 458 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 106 places in 486 ms of which 5 ms to minimize.
[2024-06-01 06:58:39] [INFO ] Deduced a trap composed of 97 places in 489 ms of which 5 ms to minimize.
[2024-06-01 06:58:39] [INFO ] Deduced a trap composed of 95 places in 442 ms of which 6 ms to minimize.
[2024-06-01 06:58:40] [INFO ] Deduced a trap composed of 103 places in 332 ms of which 5 ms to minimize.
[2024-06-01 06:58:41] [INFO ] Deduced a trap composed of 95 places in 452 ms of which 5 ms to minimize.
[2024-06-01 06:58:41] [INFO ] Deduced a trap composed of 80 places in 460 ms of which 5 ms to minimize.
[2024-06-01 06:58:42] [INFO ] Deduced a trap composed of 72 places in 414 ms of which 4 ms to minimize.
[2024-06-01 06:58:43] [INFO ] Deduced a trap composed of 73 places in 411 ms of which 4 ms to minimize.
[2024-06-01 06:58:43] [INFO ] Deduced a trap composed of 55 places in 412 ms of which 5 ms to minimize.
[2024-06-01 06:58:44] [INFO ] Deduced a trap composed of 56 places in 502 ms of which 5 ms to minimize.
[2024-06-01 06:58:45] [INFO ] Deduced a trap composed of 17 places in 271 ms of which 3 ms to minimize.
[2024-06-01 06:58:46] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:58:46] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:58:46] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 78 places in 478 ms of which 6 ms to minimize.
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 74 places in 489 ms of which 5 ms to minimize.
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 78 places in 482 ms of which 5 ms to minimize.
[2024-06-01 06:58:54] [INFO ] Deduced a trap composed of 73 places in 461 ms of which 5 ms to minimize.
[2024-06-01 06:58:55] [INFO ] Deduced a trap composed of 70 places in 384 ms of which 5 ms to minimize.
[2024-06-01 06:58:55] [INFO ] Deduced a trap composed of 75 places in 527 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 06:59:00] [INFO ] Deduced a trap composed of 66 places in 479 ms of which 5 ms to minimize.
[2024-06-01 06:59:00] [INFO ] Deduced a trap composed of 55 places in 484 ms of which 4 ms to minimize.
[2024-06-01 06:59:00] [INFO ] Deduced a trap composed of 55 places in 324 ms of which 4 ms to minimize.
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 49 places in 365 ms of which 4 ms to minimize.
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 87 places in 417 ms of which 4 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 79 places in 444 ms of which 5 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 80 places in 485 ms of which 5 ms to minimize.
[2024-06-01 06:59:03] [INFO ] Deduced a trap composed of 72 places in 451 ms of which 5 ms to minimize.
[2024-06-01 06:59:03] [INFO ] Deduced a trap composed of 51 places in 473 ms of which 5 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 80 places in 504 ms of which 6 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 87 places in 478 ms of which 5 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 89 places in 507 ms of which 8 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 83 places in 484 ms of which 5 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 80 places in 391 ms of which 5 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 135 places in 444 ms of which 5 ms to minimize.
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 101 places in 452 ms of which 5 ms to minimize.
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 135 places in 423 ms of which 5 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 77 places in 472 ms of which 5 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 87 places in 437 ms of which 5 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 76 places in 400 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 56 places in 291 ms of which 4 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 71 places in 225 ms of which 2 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 93 places in 258 ms of which 3 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 85 places in 253 ms of which 4 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 103 places in 297 ms of which 4 ms to minimize.
[2024-06-01 06:59:15] [INFO ] Deduced a trap composed of 63 places in 370 ms of which 5 ms to minimize.
[2024-06-01 06:59:15] [INFO ] Deduced a trap composed of 39 places in 362 ms of which 3 ms to minimize.
[2024-06-01 06:59:16] [INFO ] Deduced a trap composed of 49 places in 335 ms of which 5 ms to minimize.
[2024-06-01 06:59:16] [INFO ] Deduced a trap composed of 60 places in 399 ms of which 5 ms to minimize.
[2024-06-01 06:59:16] [INFO ] Deduced a trap composed of 53 places in 473 ms of which 6 ms to minimize.
[2024-06-01 06:59:17] [INFO ] Deduced a trap composed of 71 places in 449 ms of which 5 ms to minimize.
[2024-06-01 06:59:18] [INFO ] Deduced a trap composed of 84 places in 353 ms of which 4 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 95 places in 436 ms of which 5 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 74 places in 483 ms of which 5 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 74 places in 444 ms of which 5 ms to minimize.
[2024-06-01 06:59:21] [INFO ] Deduced a trap composed of 95 places in 494 ms of which 6 ms to minimize.
[2024-06-01 06:59:21] [INFO ] Deduced a trap composed of 91 places in 455 ms of which 5 ms to minimize.
[2024-06-01 06:59:22] [INFO ] Deduced a trap composed of 94 places in 520 ms of which 6 ms to minimize.
[2024-06-01 06:59:22] [INFO ] Deduced a trap composed of 95 places in 472 ms of which 5 ms to minimize.
[2024-06-01 06:59:23] [INFO ] Deduced a trap composed of 84 places in 453 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 06:59:27] [INFO ] Deduced a trap composed of 59 places in 488 ms of which 5 ms to minimize.
[2024-06-01 06:59:28] [INFO ] Deduced a trap composed of 89 places in 485 ms of which 5 ms to minimize.
[2024-06-01 06:59:28] [INFO ] Deduced a trap composed of 58 places in 489 ms of which 5 ms to minimize.
[2024-06-01 06:59:29] [INFO ] Deduced a trap composed of 45 places in 483 ms of which 5 ms to minimize.
[2024-06-01 06:59:30] [INFO ] Deduced a trap composed of 100 places in 494 ms of which 5 ms to minimize.
[2024-06-01 06:59:31] [INFO ] Deduced a trap composed of 60 places in 455 ms of which 5 ms to minimize.
[2024-06-01 06:59:31] [INFO ] Deduced a trap composed of 78 places in 475 ms of which 5 ms to minimize.
[2024-06-01 06:59:32] [INFO ] Deduced a trap composed of 71 places in 478 ms of which 5 ms to minimize.
[2024-06-01 06:59:32] [INFO ] Deduced a trap composed of 74 places in 486 ms of which 5 ms to minimize.
[2024-06-01 06:59:33] [INFO ] Deduced a trap composed of 54 places in 475 ms of which 5 ms to minimize.
[2024-06-01 06:59:33] [INFO ] Deduced a trap composed of 72 places in 486 ms of which 5 ms to minimize.
[2024-06-01 06:59:34] [INFO ] Deduced a trap composed of 73 places in 434 ms of which 5 ms to minimize.
[2024-06-01 06:59:35] [INFO ] Deduced a trap composed of 83 places in 490 ms of which 5 ms to minimize.
[2024-06-01 06:59:36] [INFO ] Deduced a trap composed of 69 places in 396 ms of which 4 ms to minimize.
[2024-06-01 06:59:37] [INFO ] Deduced a trap composed of 79 places in 431 ms of which 5 ms to minimize.
[2024-06-01 06:59:37] [INFO ] Deduced a trap composed of 60 places in 482 ms of which 5 ms to minimize.
[2024-06-01 06:59:38] [INFO ] Deduced a trap composed of 72 places in 431 ms of which 5 ms to minimize.
[2024-06-01 06:59:39] [INFO ] Deduced a trap composed of 46 places in 449 ms of which 5 ms to minimize.
[2024-06-01 06:59:39] [INFO ] Deduced a trap composed of 46 places in 401 ms of which 5 ms to minimize.
[2024-06-01 06:59:40] [INFO ] Deduced a trap composed of 58 places in 462 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 956 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/1084 variables, and 262 constraints, problems are : Problem set: 0 solved, 956 unsolved in 105029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/342 constraints, ReadFeed: 0/424 constraints, PredecessorRefiner: 0/956 constraints, Known Traps: 240/240 constraints]
After SMT, in 210663ms problems are : Problem set: 0 solved, 956 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 161 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 51 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 342/342 places, 1701/1701 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 50 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
[2024-06-01 06:59:41] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-06-01 06:59:41] [INFO ] Invariant cache hit.
[2024-06-01 06:59:41] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-06-01 06:59:41] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-06-01 06:59:41] [INFO ] Invariant cache hit.
[2024-06-01 06:59:41] [INFO ] State equation strengthened by 424 read => feed constraints.
[2024-06-01 06:59:43] [INFO ] Implicit Places using invariants and state equation in 1585 ms returned []
Implicit Place search using SMT with State Equation took 1801 ms to find 0 implicit places.
[2024-06-01 06:59:43] [INFO ] Redundant transitions in 199 ms returned []
Running 1694 sub problems to find dead transitions.
[2024-06-01 06:59:43] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-06-01 06:59:43] [INFO ] Invariant cache hit.
[2024-06-01 06:59:43] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2024-06-01 07:00:04] [INFO ] Deduced a trap composed of 3 places in 273 ms of which 3 ms to minimize.
[2024-06-01 07:00:04] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:00:04] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:00:04] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:00:04] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:00:05] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:00:05] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:00:05] [INFO ] Deduced a trap composed of 45 places in 200 ms of which 2 ms to minimize.
[2024-06-01 07:00:05] [INFO ] Deduced a trap composed of 78 places in 223 ms of which 3 ms to minimize.
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 54 places in 538 ms of which 5 ms to minimize.
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 66 places in 497 ms of which 6 ms to minimize.
[2024-06-01 07:00:11] [INFO ] Deduced a trap composed of 74 places in 467 ms of which 5 ms to minimize.
[2024-06-01 07:00:11] [INFO ] Deduced a trap composed of 64 places in 485 ms of which 6 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 73 places in 428 ms of which 5 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 70 places in 420 ms of which 5 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 74 places in 355 ms of which 5 ms to minimize.
[2024-06-01 07:00:13] [INFO ] Deduced a trap composed of 73 places in 430 ms of which 5 ms to minimize.
[2024-06-01 07:00:13] [INFO ] Deduced a trap composed of 72 places in 420 ms of which 5 ms to minimize.
[2024-06-01 07:00:14] [INFO ] Deduced a trap composed of 66 places in 442 ms of which 5 ms to minimize.
[2024-06-01 07:00:14] [INFO ] Deduced a trap composed of 70 places in 362 ms of which 5 ms to minimize.
SMT process timed out in 31475ms, After SMT, problems are : Problem set: 0 solved, 1694 unsolved
Search for dead transitions found 0 dead transitions in 31505ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33568 ms. Remains : 342/342 places, 1701/1701 transitions.
RANDOM walk for 400000 steps (8 resets) in 7174 ms. (55 steps per ms) remains 72/161 properties
Running SMT prover for 72 properties.
[2024-06-01 07:00:16] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-06-01 07:00:16] [INFO ] Invariant cache hit.
[2024-06-01 07:00:17] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-06-01 07:00:17] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 5 ms returned sat
[2024-06-01 07:00:17] [INFO ] After 351ms SMT Verify possible using state equation in real domain returned unsat :0 sat :72
[2024-06-01 07:00:17] [INFO ] State equation strengthened by 424 read => feed constraints.
[2024-06-01 07:00:17] [INFO ] After 459ms SMT Verify possible using 424 Read/Feed constraints in real domain returned unsat :0 sat :72
TRAPS : Iteration 0
[2024-06-01 07:00:22] [INFO ] After 5107ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:72
[2024-06-01 07:00:22] [INFO ] After 5634ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:72
[2024-06-01 07:00:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 16 ms returned sat
[2024-06-01 07:00:22] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 7 ms returned sat
[2024-06-01 07:00:23] [INFO ] After 606ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :72
[2024-06-01 07:00:24] [INFO ] After 832ms SMT Verify possible using 424 Read/Feed constraints in natural domain returned unsat :0 sat :72
TRAPS : Iteration 0
[2024-06-01 07:00:24] [INFO ] Deduced a trap composed of 3 places in 267 ms of which 3 ms to minimize.
[2024-06-01 07:00:24] [INFO ] Deduced a trap composed of 3 places in 294 ms of which 3 ms to minimize.
[2024-06-01 07:00:25] [INFO ] Deduced a trap composed of 31 places in 246 ms of which 3 ms to minimize.
[2024-06-01 07:00:25] [INFO ] Deduced a trap composed of 3 places in 275 ms of which 5 ms to minimize.
[2024-06-01 07:00:25] [INFO ] Deduced a trap composed of 23 places in 349 ms of which 5 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 54 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 2 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 3 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 2 ms to minimize.
[2024-06-01 07:00:27] [INFO ] Deduced a trap composed of 47 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:00:27] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 1 ms to minimize.
[2024-06-01 07:00:27] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3076 ms
[2024-06-01 07:00:27] [INFO ] Deduced a trap composed of 3 places in 453 ms of which 5 ms to minimize.
[2024-06-01 07:00:28] [INFO ] Deduced a trap composed of 19 places in 316 ms of which 4 ms to minimize.
[2024-06-01 07:00:28] [INFO ] Deduced a trap composed of 23 places in 269 ms of which 4 ms to minimize.
[2024-06-01 07:00:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1222 ms
[2024-06-01 07:00:28] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 3 ms to minimize.
[2024-06-01 07:00:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2024-06-01 07:00:29] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 2 ms to minimize.
[2024-06-01 07:00:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2024-06-01 07:00:29] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:00:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2024-06-01 07:00:29] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:00:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2024-06-01 07:00:30] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:00:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2024-06-01 07:00:30] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:00:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2024-06-01 07:00:31] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:00:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2024-06-01 07:00:32] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:00:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2024-06-01 07:00:32] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:00:32] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:00:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 375 ms
[2024-06-01 07:00:33] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 1 ms to minimize.
[2024-06-01 07:00:33] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:00:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 370 ms
[2024-06-01 07:00:34] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:00:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
TRAPS : Iteration 1
[2024-06-01 07:00:35] [INFO ] Deduced a trap composed of 14 places in 393 ms of which 5 ms to minimize.
[2024-06-01 07:00:35] [INFO ] Deduced a trap composed of 62 places in 333 ms of which 4 ms to minimize.
[2024-06-01 07:00:35] [INFO ] Deduced a trap composed of 27 places in 326 ms of which 5 ms to minimize.
[2024-06-01 07:00:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1170 ms
[2024-06-01 07:00:36] [INFO ] Deduced a trap composed of 42 places in 289 ms of which 4 ms to minimize.
[2024-06-01 07:00:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 346 ms
[2024-06-01 07:00:37] [INFO ] Deduced a trap composed of 98 places in 393 ms of which 5 ms to minimize.
[2024-06-01 07:00:38] [INFO ] Deduced a trap composed of 86 places in 389 ms of which 5 ms to minimize.
[2024-06-01 07:00:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 873 ms
[2024-06-01 07:00:38] [INFO ] Deduced a trap composed of 22 places in 280 ms of which 4 ms to minimize.
[2024-06-01 07:00:38] [INFO ] Deduced a trap composed of 52 places in 341 ms of which 5 ms to minimize.
[2024-06-01 07:00:39] [INFO ] Deduced a trap composed of 23 places in 297 ms of which 5 ms to minimize.
[2024-06-01 07:00:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1065 ms
[2024-06-01 07:00:40] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:00:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
TRAPS : Iteration 2
[2024-06-01 07:00:45] [INFO ] Deduced a trap composed of 56 places in 364 ms of which 3 ms to minimize.
[2024-06-01 07:00:45] [INFO ] Deduced a trap composed of 57 places in 342 ms of which 3 ms to minimize.
[2024-06-01 07:00:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 804 ms
[2024-06-01 07:00:46] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:00:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
TRAPS : Iteration 3
[2024-06-01 07:00:50] [INFO ] Deduced a trap composed of 79 places in 278 ms of which 3 ms to minimize.
[2024-06-01 07:00:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 370 ms
[2024-06-01 07:00:51] [INFO ] Deduced a trap composed of 77 places in 320 ms of which 3 ms to minimize.
[2024-06-01 07:00:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 412 ms
TRAPS : Iteration 4
[2024-06-01 07:00:58] [INFO ] Deduced a trap composed of 76 places in 285 ms of which 4 ms to minimize.
[2024-06-01 07:00:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 346 ms
TRAPS : Iteration 5
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:01:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
TRAPS : Iteration 6
[2024-06-01 07:01:13] [INFO ] After 50214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :72
[2024-06-01 07:01:14] [INFO ] After 52134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :72
RANDOM walk for 830138 steps (0 resets) in 120004 ms. (6 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 956/956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 956/956 properties
Probabilistic random walk after 1000000 steps, saw 530341 distinct states, run finished after 69334 ms. (steps per millisecond=14 ) properties seen :0
[2024-06-01 07:02:55] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-06-01 07:02:55] [INFO ] Invariant cache hit.
[2024-06-01 07:02:55] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 2 (OVERLAPS) 181/342 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 50 places in 538 ms of which 6 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 19 places in 506 ms of which 5 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 17 places in 492 ms of which 6 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 54 places in 554 ms of which 5 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 21 places in 518 ms of which 5 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 78 places in 478 ms of which 5 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 2 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 23 places in 475 ms of which 5 ms to minimize.
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 60 places in 483 ms of which 5 ms to minimize.
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 3 places in 462 ms of which 5 ms to minimize.
[2024-06-01 07:03:29] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:03:29] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:03:29] [INFO ] Deduced a trap composed of 78 places in 467 ms of which 5 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 88 places in 474 ms of which 5 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 70 places in 482 ms of which 6 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 29 places in 205 ms of which 2 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 1 ms to minimize.
[2024-06-01 07:03:32] [INFO ] Deduced a trap composed of 73 places in 528 ms of which 5 ms to minimize.
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 58 places in 517 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 3 places in 252 ms of which 3 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 47 places in 204 ms of which 2 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 3 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 48 places in 216 ms of which 2 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 3 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 47 places in 259 ms of which 3 ms to minimize.
[2024-06-01 07:03:36] [INFO ] Deduced a trap composed of 36 places in 262 ms of which 3 ms to minimize.
[2024-06-01 07:03:36] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 3 ms to minimize.
[2024-06-01 07:03:36] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 3 ms to minimize.
[2024-06-01 07:03:36] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:03:36] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:03:37] [INFO ] Deduced a trap composed of 74 places in 443 ms of which 5 ms to minimize.
[2024-06-01 07:03:37] [INFO ] Deduced a trap composed of 80 places in 370 ms of which 4 ms to minimize.
[2024-06-01 07:03:38] [INFO ] Deduced a trap composed of 78 places in 386 ms of which 3 ms to minimize.
[2024-06-01 07:03:38] [INFO ] Deduced a trap composed of 81 places in 280 ms of which 4 ms to minimize.
[2024-06-01 07:03:38] [INFO ] Deduced a trap composed of 93 places in 370 ms of which 4 ms to minimize.
[2024-06-01 07:03:39] [INFO ] Deduced a trap composed of 83 places in 386 ms of which 4 ms to minimize.
[2024-06-01 07:03:39] [INFO ] Deduced a trap composed of 77 places in 425 ms of which 4 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 76 places in 440 ms of which 5 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 77 places in 386 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 07:03:43] [INFO ] Deduced a trap composed of 65 places in 547 ms of which 6 ms to minimize.
[2024-06-01 07:03:44] [INFO ] Deduced a trap composed of 64 places in 517 ms of which 5 ms to minimize.
[2024-06-01 07:03:45] [INFO ] Deduced a trap composed of 101 places in 507 ms of which 5 ms to minimize.
[2024-06-01 07:03:45] [INFO ] Deduced a trap composed of 61 places in 532 ms of which 5 ms to minimize.
[2024-06-01 07:03:46] [INFO ] Deduced a trap composed of 75 places in 474 ms of which 5 ms to minimize.
[2024-06-01 07:03:47] [INFO ] Deduced a trap composed of 83 places in 542 ms of which 6 ms to minimize.
[2024-06-01 07:03:47] [INFO ] Deduced a trap composed of 60 places in 556 ms of which 6 ms to minimize.
[2024-06-01 07:03:48] [INFO ] Deduced a trap composed of 80 places in 530 ms of which 6 ms to minimize.
[2024-06-01 07:03:48] [INFO ] Deduced a trap composed of 94 places in 529 ms of which 5 ms to minimize.
[2024-06-01 07:03:49] [INFO ] Deduced a trap composed of 59 places in 539 ms of which 6 ms to minimize.
[2024-06-01 07:03:50] [INFO ] Deduced a trap composed of 76 places in 549 ms of which 6 ms to minimize.
[2024-06-01 07:03:50] [INFO ] Deduced a trap composed of 59 places in 574 ms of which 5 ms to minimize.
[2024-06-01 07:03:51] [INFO ] Deduced a trap composed of 66 places in 540 ms of which 5 ms to minimize.
[2024-06-01 07:03:51] [INFO ] Deduced a trap composed of 82 places in 544 ms of which 5 ms to minimize.
[2024-06-01 07:03:52] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:03:52] [INFO ] Deduced a trap composed of 105 places in 558 ms of which 5 ms to minimize.
[2024-06-01 07:03:53] [INFO ] Deduced a trap composed of 91 places in 540 ms of which 6 ms to minimize.
[2024-06-01 07:03:53] [INFO ] Deduced a trap composed of 96 places in 503 ms of which 6 ms to minimize.
[2024-06-01 07:03:54] [INFO ] Deduced a trap composed of 100 places in 494 ms of which 5 ms to minimize.
[2024-06-01 07:03:54] [INFO ] Deduced a trap composed of 93 places in 521 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 66 places in 472 ms of which 5 ms to minimize.
[2024-06-01 07:04:08] [INFO ] Deduced a trap composed of 93 places in 530 ms of which 5 ms to minimize.
[2024-06-01 07:04:08] [INFO ] Deduced a trap composed of 67 places in 422 ms of which 5 ms to minimize.
[2024-06-01 07:04:09] [INFO ] Deduced a trap composed of 82 places in 532 ms of which 5 ms to minimize.
[2024-06-01 07:04:09] [INFO ] Deduced a trap composed of 79 places in 531 ms of which 6 ms to minimize.
[2024-06-01 07:04:10] [INFO ] Deduced a trap composed of 82 places in 470 ms of which 5 ms to minimize.
[2024-06-01 07:04:10] [INFO ] Deduced a trap composed of 86 places in 476 ms of which 5 ms to minimize.
[2024-06-01 07:04:11] [INFO ] Deduced a trap composed of 98 places in 411 ms of which 5 ms to minimize.
[2024-06-01 07:04:11] [INFO ] Deduced a trap composed of 99 places in 454 ms of which 5 ms to minimize.
[2024-06-01 07:04:12] [INFO ] Deduced a trap composed of 94 places in 458 ms of which 5 ms to minimize.
[2024-06-01 07:04:12] [INFO ] Deduced a trap composed of 86 places in 446 ms of which 5 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 94 places in 527 ms of which 5 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 95 places in 522 ms of which 5 ms to minimize.
[2024-06-01 07:04:14] [INFO ] Deduced a trap composed of 103 places in 536 ms of which 6 ms to minimize.
[2024-06-01 07:04:15] [INFO ] Deduced a trap composed of 88 places in 536 ms of which 6 ms to minimize.
[2024-06-01 07:04:15] [INFO ] Deduced a trap composed of 95 places in 430 ms of which 5 ms to minimize.
[2024-06-01 07:04:16] [INFO ] Deduced a trap composed of 76 places in 527 ms of which 5 ms to minimize.
[2024-06-01 07:04:16] [INFO ] Deduced a trap composed of 92 places in 546 ms of which 5 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 98 places in 537 ms of which 5 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 76 places in 438 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 07:04:19] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 79 places in 535 ms of which 6 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 77 places in 545 ms of which 6 ms to minimize.
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 75 places in 540 ms of which 5 ms to minimize.
[2024-06-01 07:04:23] [INFO ] Deduced a trap composed of 78 places in 487 ms of which 5 ms to minimize.
[2024-06-01 07:04:23] [INFO ] Deduced a trap composed of 65 places in 447 ms of which 5 ms to minimize.
[2024-06-01 07:04:24] [INFO ] Deduced a trap composed of 92 places in 529 ms of which 5 ms to minimize.
[2024-06-01 07:04:24] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:04:24] [INFO ] Deduced a trap composed of 76 places in 495 ms of which 3 ms to minimize.
[2024-06-01 07:04:25] [INFO ] Deduced a trap composed of 71 places in 290 ms of which 3 ms to minimize.
[2024-06-01 07:04:25] [INFO ] Deduced a trap composed of 67 places in 408 ms of which 6 ms to minimize.
[2024-06-01 07:04:26] [INFO ] Deduced a trap composed of 76 places in 441 ms of which 5 ms to minimize.
[2024-06-01 07:04:26] [INFO ] Deduced a trap composed of 75 places in 516 ms of which 5 ms to minimize.
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 76 places in 536 ms of which 6 ms to minimize.
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 81 places in 533 ms of which 6 ms to minimize.
[2024-06-01 07:04:28] [INFO ] Deduced a trap composed of 91 places in 491 ms of which 6 ms to minimize.
[2024-06-01 07:04:28] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:04:28] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:04:28] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:04:29] [INFO ] Deduced a trap composed of 61 places in 511 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 07:04:32] [INFO ] Deduced a trap composed of 78 places in 462 ms of which 5 ms to minimize.
[2024-06-01 07:04:33] [INFO ] Deduced a trap composed of 67 places in 418 ms of which 5 ms to minimize.
[2024-06-01 07:04:33] [INFO ] Deduced a trap composed of 72 places in 488 ms of which 5 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 85 places in 471 ms of which 5 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 66 places in 512 ms of which 6 ms to minimize.
[2024-06-01 07:04:35] [INFO ] Deduced a trap composed of 83 places in 448 ms of which 5 ms to minimize.
[2024-06-01 07:04:35] [INFO ] Deduced a trap composed of 93 places in 423 ms of which 5 ms to minimize.
[2024-06-01 07:04:36] [INFO ] Deduced a trap composed of 71 places in 497 ms of which 5 ms to minimize.
[2024-06-01 07:04:36] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:04:37] [INFO ] Deduced a trap composed of 68 places in 453 ms of which 5 ms to minimize.
[2024-06-01 07:04:37] [INFO ] Deduced a trap composed of 69 places in 461 ms of which 5 ms to minimize.
[2024-06-01 07:04:38] [INFO ] Deduced a trap composed of 49 places in 492 ms of which 5 ms to minimize.
[2024-06-01 07:04:39] [INFO ] Deduced a trap composed of 58 places in 608 ms of which 6 ms to minimize.
[2024-06-01 07:04:39] [INFO ] Deduced a trap composed of 89 places in 466 ms of which 5 ms to minimize.
[2024-06-01 07:04:40] [INFO ] Deduced a trap composed of 83 places in 490 ms of which 6 ms to minimize.
[2024-06-01 07:04:40] [INFO ] Deduced a trap composed of 80 places in 473 ms of which 5 ms to minimize.
[2024-06-01 07:04:41] [INFO ] Deduced a trap composed of 82 places in 487 ms of which 5 ms to minimize.
[2024-06-01 07:04:41] [INFO ] Deduced a trap composed of 67 places in 427 ms of which 5 ms to minimize.
[2024-06-01 07:04:42] [INFO ] Deduced a trap composed of 77 places in 454 ms of which 5 ms to minimize.
[2024-06-01 07:04:42] [INFO ] Deduced a trap composed of 54 places in 455 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 956 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/1084 variables, and 142 constraints, problems are : Problem set: 0 solved, 956 unsolved in 120049 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/342 constraints, ReadFeed: 0/424 constraints, PredecessorRefiner: 956/956 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 956 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 2 (OVERLAPS) 181/342 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 120/142 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 07:05:11] [INFO ] Deduced a trap composed of 60 places in 508 ms of which 6 ms to minimize.
[2024-06-01 07:05:11] [INFO ] Deduced a trap composed of 64 places in 516 ms of which 6 ms to minimize.
[2024-06-01 07:05:12] [INFO ] Deduced a trap composed of 55 places in 557 ms of which 6 ms to minimize.
[2024-06-01 07:05:12] [INFO ] Deduced a trap composed of 43 places in 543 ms of which 10 ms to minimize.
[2024-06-01 07:05:13] [INFO ] Deduced a trap composed of 109 places in 553 ms of which 5 ms to minimize.
[2024-06-01 07:05:14] [INFO ] Deduced a trap composed of 86 places in 512 ms of which 6 ms to minimize.
[2024-06-01 07:05:15] [INFO ] Deduced a trap composed of 84 places in 533 ms of which 6 ms to minimize.
[2024-06-01 07:05:15] [INFO ] Deduced a trap composed of 55 places in 528 ms of which 6 ms to minimize.
[2024-06-01 07:05:16] [INFO ] Deduced a trap composed of 67 places in 547 ms of which 5 ms to minimize.
[2024-06-01 07:05:16] [INFO ] Deduced a trap composed of 64 places in 458 ms of which 5 ms to minimize.
[2024-06-01 07:05:17] [INFO ] Deduced a trap composed of 21 places in 519 ms of which 5 ms to minimize.
[2024-06-01 07:05:17] [INFO ] Deduced a trap composed of 80 places in 527 ms of which 5 ms to minimize.
[2024-06-01 07:05:18] [INFO ] Deduced a trap composed of 59 places in 518 ms of which 9 ms to minimize.
[2024-06-01 07:05:18] [INFO ] Deduced a trap composed of 75 places in 478 ms of which 6 ms to minimize.
[2024-06-01 07:05:19] [INFO ] Deduced a trap composed of 19 places in 512 ms of which 5 ms to minimize.
[2024-06-01 07:05:19] [INFO ] Deduced a trap composed of 75 places in 354 ms of which 3 ms to minimize.
[2024-06-01 07:05:20] [INFO ] Deduced a trap composed of 78 places in 288 ms of which 3 ms to minimize.
[2024-06-01 07:05:20] [INFO ] Deduced a trap composed of 79 places in 334 ms of which 4 ms to minimize.
[2024-06-01 07:05:20] [INFO ] Deduced a trap composed of 78 places in 285 ms of which 3 ms to minimize.
[2024-06-01 07:05:21] [INFO ] Deduced a trap composed of 29 places in 319 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 07:05:24] [INFO ] Deduced a trap composed of 95 places in 270 ms of which 3 ms to minimize.
[2024-06-01 07:05:25] [INFO ] Deduced a trap composed of 66 places in 312 ms of which 3 ms to minimize.
[2024-06-01 07:05:25] [INFO ] Deduced a trap composed of 72 places in 329 ms of which 3 ms to minimize.
[2024-06-01 07:05:25] [INFO ] Deduced a trap composed of 79 places in 362 ms of which 4 ms to minimize.
[2024-06-01 07:05:26] [INFO ] Deduced a trap composed of 57 places in 347 ms of which 4 ms to minimize.
[2024-06-01 07:05:26] [INFO ] Deduced a trap composed of 79 places in 387 ms of which 5 ms to minimize.
[2024-06-01 07:05:27] [INFO ] Deduced a trap composed of 60 places in 396 ms of which 4 ms to minimize.
[2024-06-01 07:05:27] [INFO ] Deduced a trap composed of 47 places in 444 ms of which 5 ms to minimize.
[2024-06-01 07:05:28] [INFO ] Deduced a trap composed of 61 places in 404 ms of which 5 ms to minimize.
[2024-06-01 07:05:28] [INFO ] Deduced a trap composed of 27 places in 488 ms of which 5 ms to minimize.
[2024-06-01 07:05:29] [INFO ] Deduced a trap composed of 84 places in 492 ms of which 6 ms to minimize.
[2024-06-01 07:05:29] [INFO ] Deduced a trap composed of 68 places in 459 ms of which 5 ms to minimize.
[2024-06-01 07:05:30] [INFO ] Deduced a trap composed of 87 places in 343 ms of which 4 ms to minimize.
[2024-06-01 07:05:30] [INFO ] Deduced a trap composed of 79 places in 294 ms of which 3 ms to minimize.
[2024-06-01 07:05:30] [INFO ] Deduced a trap composed of 80 places in 297 ms of which 3 ms to minimize.
[2024-06-01 07:05:31] [INFO ] Deduced a trap composed of 82 places in 286 ms of which 3 ms to minimize.
[2024-06-01 07:05:31] [INFO ] Deduced a trap composed of 80 places in 302 ms of which 3 ms to minimize.
[2024-06-01 07:05:31] [INFO ] Deduced a trap composed of 64 places in 285 ms of which 4 ms to minimize.
[2024-06-01 07:05:32] [INFO ] Deduced a trap composed of 94 places in 338 ms of which 3 ms to minimize.
[2024-06-01 07:05:32] [INFO ] Deduced a trap composed of 88 places in 355 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 07:05:34] [INFO ] Deduced a trap composed of 15 places in 340 ms of which 4 ms to minimize.
[2024-06-01 07:05:34] [INFO ] Deduced a trap composed of 41 places in 317 ms of which 3 ms to minimize.
[2024-06-01 07:05:34] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:05:35] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:05:35] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:05:35] [INFO ] Deduced a trap composed of 13 places in 329 ms of which 4 ms to minimize.
[2024-06-01 07:05:35] [INFO ] Deduced a trap composed of 82 places in 284 ms of which 3 ms to minimize.
[2024-06-01 07:05:36] [INFO ] Deduced a trap composed of 58 places in 348 ms of which 3 ms to minimize.
[2024-06-01 07:05:37] [INFO ] Deduced a trap composed of 70 places in 270 ms of which 3 ms to minimize.
[2024-06-01 07:05:38] [INFO ] Deduced a trap composed of 93 places in 364 ms of which 4 ms to minimize.
[2024-06-01 07:05:38] [INFO ] Deduced a trap composed of 87 places in 318 ms of which 4 ms to minimize.
[2024-06-01 07:05:39] [INFO ] Deduced a trap composed of 65 places in 278 ms of which 4 ms to minimize.
[2024-06-01 07:05:39] [INFO ] Deduced a trap composed of 72 places in 238 ms of which 3 ms to minimize.
[2024-06-01 07:05:39] [INFO ] Deduced a trap composed of 72 places in 270 ms of which 3 ms to minimize.
[2024-06-01 07:05:40] [INFO ] Deduced a trap composed of 66 places in 317 ms of which 3 ms to minimize.
[2024-06-01 07:05:40] [INFO ] Deduced a trap composed of 98 places in 297 ms of which 4 ms to minimize.
[2024-06-01 07:05:40] [INFO ] Deduced a trap composed of 88 places in 330 ms of which 3 ms to minimize.
[2024-06-01 07:05:41] [INFO ] Deduced a trap composed of 70 places in 264 ms of which 3 ms to minimize.
[2024-06-01 07:05:41] [INFO ] Deduced a trap composed of 70 places in 197 ms of which 3 ms to minimize.
[2024-06-01 07:05:41] [INFO ] Deduced a trap composed of 85 places in 279 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 65 places in 289 ms of which 3 ms to minimize.
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 56 places in 322 ms of which 3 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 71 places in 234 ms of which 2 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 93 places in 269 ms of which 3 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 89 places in 269 ms of which 3 ms to minimize.
[2024-06-01 07:05:46] [INFO ] Deduced a trap composed of 86 places in 318 ms of which 3 ms to minimize.
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 81 places in 280 ms of which 3 ms to minimize.
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 80 places in 281 ms of which 3 ms to minimize.
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 91 places in 338 ms of which 3 ms to minimize.
[2024-06-01 07:05:48] [INFO ] Deduced a trap composed of 68 places in 264 ms of which 3 ms to minimize.
[2024-06-01 07:05:48] [INFO ] Deduced a trap composed of 90 places in 323 ms of which 4 ms to minimize.
[2024-06-01 07:05:48] [INFO ] Deduced a trap composed of 64 places in 302 ms of which 3 ms to minimize.
[2024-06-01 07:05:49] [INFO ] Deduced a trap composed of 74 places in 329 ms of which 4 ms to minimize.
[2024-06-01 07:05:49] [INFO ] Deduced a trap composed of 82 places in 318 ms of which 3 ms to minimize.
[2024-06-01 07:05:49] [INFO ] Deduced a trap composed of 54 places in 326 ms of which 3 ms to minimize.
[2024-06-01 07:05:50] [INFO ] Deduced a trap composed of 47 places in 301 ms of which 3 ms to minimize.
[2024-06-01 07:05:50] [INFO ] Deduced a trap composed of 60 places in 313 ms of which 3 ms to minimize.
[2024-06-01 07:05:50] [INFO ] Deduced a trap composed of 49 places in 328 ms of which 4 ms to minimize.
[2024-06-01 07:05:51] [INFO ] Deduced a trap composed of 62 places in 334 ms of which 4 ms to minimize.
[2024-06-01 07:05:51] [INFO ] Deduced a trap composed of 78 places in 285 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 07:05:55] [INFO ] Deduced a trap composed of 76 places in 339 ms of which 4 ms to minimize.
[2024-06-01 07:05:55] [INFO ] Deduced a trap composed of 71 places in 360 ms of which 3 ms to minimize.
[2024-06-01 07:05:55] [INFO ] Deduced a trap composed of 83 places in 363 ms of which 3 ms to minimize.
[2024-06-01 07:05:56] [INFO ] Deduced a trap composed of 65 places in 302 ms of which 4 ms to minimize.
[2024-06-01 07:05:56] [INFO ] Deduced a trap composed of 113 places in 313 ms of which 3 ms to minimize.
[2024-06-01 07:05:56] [INFO ] Deduced a trap composed of 82 places in 323 ms of which 4 ms to minimize.
[2024-06-01 07:05:57] [INFO ] Deduced a trap composed of 83 places in 338 ms of which 3 ms to minimize.
[2024-06-01 07:05:57] [INFO ] Deduced a trap composed of 62 places in 332 ms of which 3 ms to minimize.
[2024-06-01 07:05:57] [INFO ] Deduced a trap composed of 76 places in 283 ms of which 3 ms to minimize.
[2024-06-01 07:05:58] [INFO ] Deduced a trap composed of 70 places in 334 ms of which 3 ms to minimize.
[2024-06-01 07:05:58] [INFO ] Deduced a trap composed of 70 places in 258 ms of which 3 ms to minimize.
[2024-06-01 07:05:58] [INFO ] Deduced a trap composed of 97 places in 258 ms of which 3 ms to minimize.
[2024-06-01 07:05:59] [INFO ] Deduced a trap composed of 60 places in 279 ms of which 3 ms to minimize.
[2024-06-01 07:05:59] [INFO ] Deduced a trap composed of 70 places in 296 ms of which 4 ms to minimize.
[2024-06-01 07:06:00] [INFO ] Deduced a trap composed of 87 places in 315 ms of which 3 ms to minimize.
[2024-06-01 07:06:00] [INFO ] Deduced a trap composed of 83 places in 294 ms of which 4 ms to minimize.
[2024-06-01 07:06:00] [INFO ] Deduced a trap composed of 84 places in 295 ms of which 3 ms to minimize.
[2024-06-01 07:06:01] [INFO ] Deduced a trap composed of 72 places in 300 ms of which 4 ms to minimize.
[2024-06-01 07:06:01] [INFO ] Deduced a trap composed of 66 places in 225 ms of which 3 ms to minimize.
[2024-06-01 07:06:02] [INFO ] Deduced a trap composed of 76 places in 354 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 07:06:06] [INFO ] Deduced a trap composed of 69 places in 368 ms of which 3 ms to minimize.
[2024-06-01 07:06:06] [INFO ] Deduced a trap composed of 87 places in 330 ms of which 4 ms to minimize.
[2024-06-01 07:06:07] [INFO ] Deduced a trap composed of 89 places in 297 ms of which 5 ms to minimize.
[2024-06-01 07:06:07] [INFO ] Deduced a trap composed of 76 places in 318 ms of which 4 ms to minimize.
[2024-06-01 07:06:07] [INFO ] Deduced a trap composed of 46 places in 303 ms of which 3 ms to minimize.
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 70 places in 272 ms of which 4 ms to minimize.
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 74 places in 344 ms of which 3 ms to minimize.
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 76 places in 336 ms of which 4 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 60 places in 359 ms of which 4 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 85 places in 354 ms of which 4 ms to minimize.
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 55 places in 343 ms of which 4 ms to minimize.
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 80 places in 314 ms of which 3 ms to minimize.
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 96 places in 302 ms of which 3 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 68 places in 324 ms of which 3 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 42 places in 315 ms of which 3 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 91 places in 271 ms of which 3 ms to minimize.
[2024-06-01 07:06:12] [INFO ] Deduced a trap composed of 88 places in 297 ms of which 3 ms to minimize.
[2024-06-01 07:06:12] [INFO ] Deduced a trap composed of 79 places in 281 ms of which 3 ms to minimize.
[2024-06-01 07:06:12] [INFO ] Deduced a trap composed of 80 places in 298 ms of which 3 ms to minimize.
[2024-06-01 07:06:12] [INFO ] Deduced a trap composed of 90 places in 292 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 07:06:16] [INFO ] Deduced a trap composed of 101 places in 335 ms of which 3 ms to minimize.
[2024-06-01 07:06:16] [INFO ] Deduced a trap composed of 68 places in 318 ms of which 3 ms to minimize.
[2024-06-01 07:06:17] [INFO ] Deduced a trap composed of 66 places in 404 ms of which 3 ms to minimize.
[2024-06-01 07:06:17] [INFO ] Deduced a trap composed of 75 places in 333 ms of which 4 ms to minimize.
[2024-06-01 07:06:17] [INFO ] Deduced a trap composed of 74 places in 284 ms of which 3 ms to minimize.
[2024-06-01 07:06:18] [INFO ] Deduced a trap composed of 93 places in 331 ms of which 3 ms to minimize.
[2024-06-01 07:06:18] [INFO ] Deduced a trap composed of 100 places in 303 ms of which 3 ms to minimize.
[2024-06-01 07:06:18] [INFO ] Deduced a trap composed of 83 places in 299 ms of which 3 ms to minimize.
[2024-06-01 07:06:19] [INFO ] Deduced a trap composed of 72 places in 304 ms of which 4 ms to minimize.
[2024-06-01 07:06:19] [INFO ] Deduced a trap composed of 104 places in 305 ms of which 4 ms to minimize.
[2024-06-01 07:06:19] [INFO ] Deduced a trap composed of 106 places in 302 ms of which 3 ms to minimize.
[2024-06-01 07:06:20] [INFO ] Deduced a trap composed of 67 places in 323 ms of which 3 ms to minimize.
[2024-06-01 07:06:20] [INFO ] Deduced a trap composed of 69 places in 359 ms of which 3 ms to minimize.
[2024-06-01 07:06:21] [INFO ] Deduced a trap composed of 82 places in 347 ms of which 3 ms to minimize.
[2024-06-01 07:06:21] [INFO ] Deduced a trap composed of 107 places in 343 ms of which 3 ms to minimize.
[2024-06-01 07:06:21] [INFO ] Deduced a trap composed of 87 places in 215 ms of which 3 ms to minimize.
[2024-06-01 07:06:22] [INFO ] Deduced a trap composed of 89 places in 274 ms of which 3 ms to minimize.
[2024-06-01 07:06:22] [INFO ] Deduced a trap composed of 92 places in 250 ms of which 3 ms to minimize.
[2024-06-01 07:06:23] [INFO ] Deduced a trap composed of 70 places in 336 ms of which 4 ms to minimize.
[2024-06-01 07:06:23] [INFO ] Deduced a trap composed of 62 places in 410 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 07:06:28] [INFO ] Deduced a trap composed of 80 places in 287 ms of which 3 ms to minimize.
[2024-06-01 07:06:28] [INFO ] Deduced a trap composed of 64 places in 301 ms of which 4 ms to minimize.
[2024-06-01 07:06:28] [INFO ] Deduced a trap composed of 70 places in 256 ms of which 3 ms to minimize.
[2024-06-01 07:06:29] [INFO ] Deduced a trap composed of 50 places in 313 ms of which 3 ms to minimize.
[2024-06-01 07:06:29] [INFO ] Deduced a trap composed of 88 places in 354 ms of which 4 ms to minimize.
[2024-06-01 07:06:29] [INFO ] Deduced a trap composed of 66 places in 343 ms of which 3 ms to minimize.
[2024-06-01 07:06:30] [INFO ] Deduced a trap composed of 67 places in 321 ms of which 3 ms to minimize.
[2024-06-01 07:06:30] [INFO ] Deduced a trap composed of 60 places in 350 ms of which 4 ms to minimize.
[2024-06-01 07:06:30] [INFO ] Deduced a trap composed of 61 places in 310 ms of which 3 ms to minimize.
[2024-06-01 07:06:31] [INFO ] Deduced a trap composed of 82 places in 359 ms of which 3 ms to minimize.
[2024-06-01 07:06:31] [INFO ] Deduced a trap composed of 58 places in 361 ms of which 4 ms to minimize.
[2024-06-01 07:06:31] [INFO ] Deduced a trap composed of 59 places in 303 ms of which 3 ms to minimize.
[2024-06-01 07:06:32] [INFO ] Deduced a trap composed of 79 places in 339 ms of which 3 ms to minimize.
[2024-06-01 07:06:33] [INFO ] Deduced a trap composed of 116 places in 332 ms of which 3 ms to minimize.
[2024-06-01 07:06:33] [INFO ] Deduced a trap composed of 88 places in 315 ms of which 3 ms to minimize.
[2024-06-01 07:06:34] [INFO ] Deduced a trap composed of 79 places in 308 ms of which 3 ms to minimize.
[2024-06-01 07:06:34] [INFO ] Deduced a trap composed of 69 places in 352 ms of which 4 ms to minimize.
[2024-06-01 07:06:34] [INFO ] Deduced a trap composed of 59 places in 282 ms of which 3 ms to minimize.
[2024-06-01 07:06:35] [INFO ] Deduced a trap composed of 63 places in 290 ms of which 3 ms to minimize.
[2024-06-01 07:06:35] [INFO ] Deduced a trap composed of 57 places in 288 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 20/302 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 50 places in 372 ms of which 3 ms to minimize.
[2024-06-01 07:06:40] [INFO ] Deduced a trap composed of 64 places in 330 ms of which 3 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 69 places in 316 ms of which 4 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 81 places in 371 ms of which 3 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 95 places in 298 ms of which 3 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 81 places in 276 ms of which 3 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 89 places in 352 ms of which 5 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 85 places in 359 ms of which 4 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 76 places in 472 ms of which 3 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 88 places in 335 ms of which 3 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 2 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 100 places in 279 ms of which 4 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 45 places in 322 ms of which 3 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 74 places in 290 ms of which 3 ms to minimize.
[2024-06-01 07:06:46] [INFO ] Deduced a trap composed of 81 places in 303 ms of which 3 ms to minimize.
[2024-06-01 07:06:46] [INFO ] Deduced a trap composed of 68 places in 353 ms of which 3 ms to minimize.
[2024-06-01 07:06:46] [INFO ] Deduced a trap composed of 64 places in 302 ms of which 3 ms to minimize.
[2024-06-01 07:06:47] [INFO ] Deduced a trap composed of 44 places in 336 ms of which 3 ms to minimize.
[2024-06-01 07:06:47] [INFO ] Deduced a trap composed of 43 places in 210 ms of which 3 ms to minimize.
[2024-06-01 07:06:47] [INFO ] Deduced a trap composed of 68 places in 333 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 20/322 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 07:06:53] [INFO ] Deduced a trap composed of 101 places in 299 ms of which 3 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 78 places in 390 ms of which 5 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 85 places in 402 ms of which 3 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 135 places in 305 ms of which 4 ms to minimize.
[2024-06-01 07:06:55] [INFO ] Deduced a trap composed of 89 places in 351 ms of which 3 ms to minimize.
[2024-06-01 07:06:55] [INFO ] Deduced a trap composed of 70 places in 336 ms of which 4 ms to minimize.
[2024-06-01 07:06:55] [INFO ] Deduced a trap composed of 79 places in 322 ms of which 4 ms to minimize.
SMT process timed out in 240740ms, After SMT, problems are : Problem set: 0 solved, 956 unsolved
Fused 956 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 161 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 54 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 342/342 places, 1701/1701 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 52 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
[2024-06-01 07:06:56] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-06-01 07:06:56] [INFO ] Invariant cache hit.
[2024-06-01 07:06:56] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-06-01 07:06:56] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-06-01 07:06:56] [INFO ] Invariant cache hit.
[2024-06-01 07:06:56] [INFO ] State equation strengthened by 424 read => feed constraints.
[2024-06-01 07:06:57] [INFO ] Implicit Places using invariants and state equation in 1161 ms returned []
Implicit Place search using SMT with State Equation took 1429 ms to find 0 implicit places.
[2024-06-01 07:06:57] [INFO ] Redundant transitions in 55 ms returned []
Running 1694 sub problems to find dead transitions.
[2024-06-01 07:06:57] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-06-01 07:06:57] [INFO ] Invariant cache hit.
[2024-06-01 07:06:57] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 3 places in 252 ms of which 3 ms to minimize.
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 2 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 78 places in 199 ms of which 3 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 54 places in 318 ms of which 4 ms to minimize.
[2024-06-01 07:07:17] [INFO ] Deduced a trap composed of 66 places in 334 ms of which 3 ms to minimize.
[2024-06-01 07:07:17] [INFO ] Deduced a trap composed of 74 places in 359 ms of which 3 ms to minimize.
[2024-06-01 07:07:18] [INFO ] Deduced a trap composed of 64 places in 353 ms of which 3 ms to minimize.
[2024-06-01 07:07:18] [INFO ] Deduced a trap composed of 73 places in 293 ms of which 3 ms to minimize.
[2024-06-01 07:07:18] [INFO ] Deduced a trap composed of 70 places in 354 ms of which 4 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 74 places in 355 ms of which 3 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 73 places in 324 ms of which 4 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 72 places in 359 ms of which 3 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 66 places in 356 ms of which 4 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 70 places in 273 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2024-06-01 07:07:25] [INFO ] Deduced a trap composed of 60 places in 315 ms of which 4 ms to minimize.
[2024-06-01 07:07:25] [INFO ] Deduced a trap composed of 63 places in 309 ms of which 4 ms to minimize.
[2024-06-01 07:07:25] [INFO ] Deduced a trap composed of 62 places in 282 ms of which 3 ms to minimize.
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 68 places in 382 ms of which 4 ms to minimize.
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 77 places in 312 ms of which 3 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 74 places in 311 ms of which 3 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 72 places in 312 ms of which 3 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 106 places in 309 ms of which 4 ms to minimize.
[2024-06-01 07:07:28] [INFO ] Deduced a trap composed of 73 places in 372 ms of which 5 ms to minimize.
[2024-06-01 07:07:28] [INFO ] Deduced a trap composed of 70 places in 315 ms of which 3 ms to minimize.
SMT process timed out in 31011ms, After SMT, problems are : Problem set: 0 solved, 1694 unsolved
Search for dead transitions found 0 dead transitions in 31037ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32584 ms. Remains : 342/342 places, 1701/1701 transitions.
RANDOM walk for 400000 steps (8 resets) in 3729 ms. (107 steps per ms) remains 71/161 properties
Running SMT prover for 71 properties.
[2024-06-01 07:07:29] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-06-01 07:07:29] [INFO ] Invariant cache hit.
[2024-06-01 07:07:29] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2024-06-01 07:07:29] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 6 ms returned sat
[2024-06-01 07:07:30] [INFO ] After 373ms SMT Verify possible using state equation in real domain returned unsat :0 sat :71
[2024-06-01 07:07:30] [INFO ] State equation strengthened by 424 read => feed constraints.
[2024-06-01 07:07:30] [INFO ] After 422ms SMT Verify possible using 424 Read/Feed constraints in real domain returned unsat :0 sat :71
TRAPS : Iteration 0
[2024-06-01 07:07:34] [INFO ] After 3924ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:71
[2024-06-01 07:07:34] [INFO ] After 4482ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:71
[2024-06-01 07:07:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-06-01 07:07:34] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 5 ms returned sat
[2024-06-01 07:07:34] [INFO ] After 407ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :71
[2024-06-01 07:07:35] [INFO ] After 563ms SMT Verify possible using 424 Read/Feed constraints in natural domain returned unsat :0 sat :71
TRAPS : Iteration 0
[2024-06-01 07:07:35] [INFO ] Deduced a trap composed of 3 places in 275 ms of which 3 ms to minimize.
[2024-06-01 07:07:36] [INFO ] Deduced a trap composed of 3 places in 352 ms of which 3 ms to minimize.
[2024-06-01 07:07:36] [INFO ] Deduced a trap composed of 69 places in 356 ms of which 3 ms to minimize.
[2024-06-01 07:07:36] [INFO ] Deduced a trap composed of 59 places in 365 ms of which 3 ms to minimize.
[2024-06-01 07:07:37] [INFO ] Deduced a trap composed of 62 places in 404 ms of which 3 ms to minimize.
[2024-06-01 07:07:37] [INFO ] Deduced a trap composed of 44 places in 458 ms of which 4 ms to minimize.
[2024-06-01 07:07:38] [INFO ] Deduced a trap composed of 21 places in 386 ms of which 4 ms to minimize.
[2024-06-01 07:07:38] [INFO ] Deduced a trap composed of 47 places in 296 ms of which 3 ms to minimize.
[2024-06-01 07:07:38] [INFO ] Deduced a trap composed of 27 places in 361 ms of which 4 ms to minimize.
[2024-06-01 07:07:39] [INFO ] Deduced a trap composed of 29 places in 382 ms of which 4 ms to minimize.
[2024-06-01 07:07:39] [INFO ] Deduced a trap composed of 3 places in 373 ms of which 3 ms to minimize.
[2024-06-01 07:07:40] [INFO ] Deduced a trap composed of 15 places in 332 ms of which 4 ms to minimize.
[2024-06-01 07:07:40] [INFO ] Deduced a trap composed of 19 places in 297 ms of which 3 ms to minimize.
[2024-06-01 07:07:40] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 1 ms to minimize.
[2024-06-01 07:07:40] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:07:40] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:07:40] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 5511 ms
[2024-06-01 07:07:40] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:07:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2024-06-01 07:07:41] [INFO ] Deduced a trap composed of 16 places in 445 ms of which 4 ms to minimize.
[2024-06-01 07:07:41] [INFO ] Deduced a trap composed of 15 places in 372 ms of which 3 ms to minimize.
[2024-06-01 07:07:42] [INFO ] Deduced a trap composed of 18 places in 396 ms of which 4 ms to minimize.
[2024-06-01 07:07:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1374 ms
[2024-06-01 07:07:42] [INFO ] Deduced a trap composed of 17 places in 360 ms of which 4 ms to minimize.
[2024-06-01 07:07:43] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:07:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 568 ms
[2024-06-01 07:07:43] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 3 ms to minimize.
[2024-06-01 07:07:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2024-06-01 07:07:43] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:07:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2024-06-01 07:07:44] [INFO ] Deduced a trap composed of 71 places in 459 ms of which 5 ms to minimize.
[2024-06-01 07:07:44] [INFO ] Deduced a trap composed of 62 places in 402 ms of which 5 ms to minimize.
[2024-06-01 07:07:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 994 ms
[2024-06-01 07:07:45] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 2 ms to minimize.
[2024-06-01 07:07:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2024-06-01 07:07:45] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 3 ms to minimize.
[2024-06-01 07:07:48] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:07:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 444 ms
[2024-06-01 07:07:48] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:07:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2024-06-01 07:07:50] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:07:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
TRAPS : Iteration 1
[2024-06-01 07:07:52] [INFO ] Deduced a trap composed of 91 places in 414 ms of which 4 ms to minimize.
[2024-06-01 07:07:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 507 ms
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 19 places in 269 ms of which 3 ms to minimize.
[2024-06-01 07:07:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 356 ms
[2024-06-01 07:07:55] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:07:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2024-06-01 07:07:55] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2024-06-01 07:07:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
TRAPS : Iteration 2
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 382 ms
TRAPS : Iteration 3
[2024-06-01 07:08:08] [INFO ] After 33968ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :71
[2024-06-01 07:08:09] [INFO ] After 35471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :71
RANDOM walk for 399 steps (0 resets) in 5 ms. (66 steps per ms) remains 0/1 properties
RANDOM walk for 883 steps (0 resets) in 11 ms. (73 steps per ms) remains 0/1 properties
RANDOM walk for 1251 steps (0 resets) in 14 ms. (83 steps per ms) remains 0/1 properties
RANDOM walk for 821 steps (0 resets) in 9 ms. (82 steps per ms) remains 0/1 properties
RANDOM walk for 1772 steps (0 resets) in 12 ms. (136 steps per ms) remains 0/1 properties
RANDOM walk for 1307 steps (0 resets) in 9 ms. (130 steps per ms) remains 0/1 properties
RANDOM walk for 2189 steps (0 resets) in 14 ms. (145 steps per ms) remains 0/1 properties
RANDOM walk for 1797 steps (0 resets) in 11 ms. (149 steps per ms) remains 0/1 properties
RANDOM walk for 2775 steps (0 resets) in 13 ms. (198 steps per ms) remains 0/1 properties
RANDOM walk for 2240 steps (0 resets) in 14 ms. (149 steps per ms) remains 0/1 properties
RANDOM walk for 91 steps (0 resets) in 4 ms. (18 steps per ms) remains 0/1 properties
RANDOM walk for 2786 steps (0 resets) in 15 ms. (174 steps per ms) remains 0/1 properties
RANDOM walk for 1435 steps (0 resets) in 10 ms. (130 steps per ms) remains 0/1 properties
RANDOM walk for 1766 steps (0 resets) in 12 ms. (135 steps per ms) remains 0/1 properties
RANDOM walk for 1987 steps (0 resets) in 14 ms. (132 steps per ms) remains 0/1 properties
RANDOM walk for 2549 steps (0 resets) in 14 ms. (169 steps per ms) remains 0/1 properties
RANDOM walk for 89 steps (0 resets) in 7 ms. (11 steps per ms) remains 0/1 properties
RANDOM walk for 454 steps (0 resets) in 7 ms. (56 steps per ms) remains 0/1 properties
RANDOM walk for 2048 steps (0 resets) in 14 ms. (136 steps per ms) remains 0/1 properties
RANDOM walk for 2078 steps (0 resets) in 14 ms. (138 steps per ms) remains 0/1 properties
RANDOM walk for 2629 steps (0 resets) in 17 ms. (146 steps per ms) remains 0/1 properties
RANDOM walk for 138 steps (0 resets) in 4 ms. (27 steps per ms) remains 0/1 properties
RANDOM walk for 367 steps (0 resets) in 6 ms. (52 steps per ms) remains 0/1 properties
RANDOM walk for 943 steps (0 resets) in 9 ms. (94 steps per ms) remains 0/1 properties
RANDOM walk for 2091 steps (0 resets) in 14 ms. (139 steps per ms) remains 0/1 properties
RANDOM walk for 2799 steps (0 resets) in 14 ms. (186 steps per ms) remains 0/1 properties
RANDOM walk for 116 steps (0 resets) in 5 ms. (19 steps per ms) remains 0/1 properties
RANDOM walk for 504 steps (0 resets) in 6 ms. (72 steps per ms) remains 0/1 properties
RANDOM walk for 876 steps (0 resets) in 9 ms. (87 steps per ms) remains 0/1 properties
RANDOM walk for 1331 steps (0 resets) in 10 ms. (121 steps per ms) remains 0/1 properties
RANDOM walk for 2310 steps (0 resets) in 14 ms. (154 steps per ms) remains 0/1 properties
RANDOM walk for 76 steps (0 resets) in 5 ms. (12 steps per ms) remains 0/1 properties
RANDOM walk for 504 steps (0 resets) in 7 ms. (63 steps per ms) remains 0/1 properties
RANDOM walk for 908 steps (0 resets) in 9 ms. (90 steps per ms) remains 0/1 properties
RANDOM walk for 1239 steps (0 resets) in 12 ms. (95 steps per ms) remains 0/1 properties
RANDOM walk for 1743 steps (0 resets) in 13 ms. (124 steps per ms) remains 0/1 properties
RANDOM walk for 880 steps (0 resets) in 8 ms. (97 steps per ms) remains 0/1 properties
RANDOM walk for 1197 steps (0 resets) in 9 ms. (119 steps per ms) remains 0/1 properties
RANDOM walk for 1810 steps (0 resets) in 11 ms. (150 steps per ms) remains 0/1 properties
RANDOM walk for 2240 steps (0 resets) in 12 ms. (172 steps per ms) remains 0/1 properties
RANDOM walk for 15 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 26775 steps (6 resets) in 124 ms. (214 steps per ms) remains 0/1 properties
RANDOM walk for 543 steps (0 resets) in 7 ms. (67 steps per ms) remains 0/1 properties
RANDOM walk for 29 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 38 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
RANDOM walk for 900 steps (0 resets) in 8 ms. (100 steps per ms) remains 0/1 properties
RANDOM walk for 30 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 1256 steps (0 resets) in 8 ms. (139 steps per ms) remains 0/1 properties
RANDOM walk for 25 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
RANDOM walk for 1761 steps (0 resets) in 10 ms. (160 steps per ms) remains 0/1 properties
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 23 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 1987 steps (0 resets) in 12 ms. (152 steps per ms) remains 0/1 properties
RANDOM walk for 27 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
RANDOM walk for 2428 steps (0 resets) in 13 ms. (173 steps per ms) remains 0/1 properties
RANDOM walk for 17 steps (0 resets) in 6 ms. (2 steps per ms) remains 0/1 properties
RANDOM walk for 33401 steps (7 resets) in 157 ms. (211 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 364176 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 1
Probabilistic random walk after 364176 steps, saw 222102 distinct states, run finished after 3006 ms. (steps per millisecond=121 ) properties seen :0
[2024-06-01 07:08:13] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-06-01 07:08:13] [INFO ] Invariant cache hit.
[2024-06-01 07:08:13] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:13] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 361/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 559 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:14] [INFO ] Deduced a trap composed of 36 places in 311 ms of which 3 ms to minimize.
[2024-06-01 07:08:14] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 2 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 3 places in 214 ms of which 3 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 7/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 361/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1084 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 797 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2089 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 2683ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 214 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 101 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 308/342 places, 1463/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 216 ms. (184 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 463376 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 1
Probabilistic random walk after 463376 steps, saw 185819 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
[2024-06-01 07:08:19] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2024-06-01 07:08:19] [INFO ] Computed 22 invariants in 4 ms
[2024-06-01 07:08:19] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:19] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 24/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:20] [INFO ] Deduced a trap composed of 66 places in 373 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/518 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 294/812 variables, 204/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 187/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/812 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 552 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1076 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 24/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/518 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:21] [INFO ] Deduced a trap composed of 3 places in 373 ms of which 4 ms to minimize.
[2024-06-01 07:08:21] [INFO ] Deduced a trap composed of 3 places in 294 ms of which 4 ms to minimize.
[2024-06-01 07:08:21] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/518 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/518 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 294/812 variables, 204/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 187/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:22] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/812 variables, 1/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/812 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/812 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 557 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1674 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 2768ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 4116 steps, including 231 resets, run visited all 1 properties in 28 ms. (steps per millisecond=147 )
Parikh walk visited 1 properties in 40 ms.
RANDOM walk for 40000 steps (8 resets) in 208 ms. (191 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 374104 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :0 out of 1
Probabilistic random walk after 374104 steps, saw 226781 distinct states, run finished after 3005 ms. (steps per millisecond=124 ) properties seen :0
[2024-06-01 07:08:25] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
// Phase 1: matrix 742 rows 342 cols
[2024-06-01 07:08:25] [INFO ] Computed 22 invariants in 6 ms
[2024-06-01 07:08:25] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:25] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 361/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 624 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 3 places in 258 ms of which 3 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 3 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 2 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 2 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 10/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 361/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1084 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 800 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2295 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 2942ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 60 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 308/342 places, 1463/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 219398 steps, run visited all 1 properties in 1371 ms. (steps per millisecond=160 )
Probabilistic random walk after 219398 steps, saw 108562 distinct states, run finished after 1378 ms. (steps per millisecond=159 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 96174 steps, run visited all 1 properties in 658 ms. (steps per millisecond=146 )
Probabilistic random walk after 96174 steps, saw 65378 distinct states, run finished after 659 ms. (steps per millisecond=145 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 423024 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 1
Probabilistic random walk after 423024 steps, saw 253391 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
[2024-06-01 07:08:33] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-06-01 07:08:33] [INFO ] Invariant cache hit.
[2024-06-01 07:08:33] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 361/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 538 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 4 places in 316 ms of which 3 ms to minimize.
[2024-06-01 07:08:35] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 2 ms to minimize.
[2024-06-01 07:08:35] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:08:35] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 361/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:35] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 1/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1084 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 795 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1435 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1989ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 57 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 308/342 places, 1463/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 26934 steps, run visited all 1 properties in 178 ms. (steps per millisecond=151 )
Probabilistic random walk after 26934 steps, saw 18143 distinct states, run finished after 178 ms. (steps per millisecond=151 ) properties seen :1
RANDOM walk for 27225 steps (5 resets) in 79 ms. (340 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 442792 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 1
Probabilistic random walk after 442792 steps, saw 263748 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
[2024-06-01 07:08:39] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-06-01 07:08:39] [INFO ] Invariant cache hit.
[2024-06-01 07:08:39] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 80 places in 270 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 362/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 790 constraints, problems are : Problem set: 0 solved, 1 unsolved in 898 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 17 places in 256 ms of which 2 ms to minimize.
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 2 ms to minimize.
[2024-06-01 07:08:41] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:08:41] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:08:41] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 5/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/587 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 497/1084 variables, 233/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 362/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:41] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1084 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1084 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 797 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1345 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 2286ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 58 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=58 )
Parikh walk visited 1 properties in 1 ms.
RANDOM walk for 398 steps (0 resets) in 4 ms. (79 steps per ms) remains 0/1 properties
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 449456 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 1
Probabilistic random walk after 449456 steps, saw 267486 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
[2024-06-01 07:08:44] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-06-01 07:08:44] [INFO ] Invariant cache hit.
[2024-06-01 07:08:44] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:44] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 362/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 14 places in 224 ms of which 3 ms to minimize.
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 3 places in 252 ms of which 3 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 3 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 6/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 362/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1084 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 796 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1613 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 2160ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 6106 steps, including 213 resets, run visited all 1 properties in 22 ms. (steps per millisecond=277 )
Parikh walk visited 1 properties in 22 ms.
RANDOM walk for 22 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 101 steps (0 resets) in 4 ms. (20 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 128790 steps, run visited all 1 properties in 856 ms. (steps per millisecond=150 )
Probabilistic random walk after 128790 steps, saw 85754 distinct states, run finished after 859 ms. (steps per millisecond=149 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 172198 steps, run visited all 1 properties in 1183 ms. (steps per millisecond=145 )
Probabilistic random walk after 172198 steps, saw 111859 distinct states, run finished after 1184 ms. (steps per millisecond=145 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 90342 steps, run visited all 1 properties in 620 ms. (steps per millisecond=145 )
Probabilistic random walk after 90342 steps, saw 61693 distinct states, run finished after 620 ms. (steps per millisecond=145 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 133406 steps, run visited all 1 properties in 895 ms. (steps per millisecond=149 )
Probabilistic random walk after 133406 steps, saw 88796 distinct states, run finished after 895 ms. (steps per millisecond=149 ) properties seen :1
RANDOM walk for 35603 steps (7 resets) in 94 ms. (374 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 229926 steps, run visited all 1 properties in 1566 ms. (steps per millisecond=146 )
Probabilistic random walk after 229926 steps, saw 146021 distinct states, run finished after 1566 ms. (steps per millisecond=146 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 454112 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :0 out of 1
Probabilistic random walk after 454112 steps, saw 269551 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
[2024-06-01 07:08:55] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-06-01 07:08:55] [INFO ] Invariant cache hit.
[2024-06-01 07:08:55] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 83 places in 322 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 362/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 790 constraints, problems are : Problem set: 0 solved, 1 unsolved in 917 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 3 places in 335 ms of which 4 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 21 places in 260 ms of which 3 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 6/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/587 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 497/1084 variables, 233/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 362/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1084 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 797 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1479 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 2411ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 42 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
Parikh walk visited 1 properties in 1 ms.
RANDOM walk for 40000 steps (8 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 47790 steps, run visited all 1 properties in 316 ms. (steps per millisecond=151 )
Probabilistic random walk after 47790 steps, saw 34076 distinct states, run finished after 320 ms. (steps per millisecond=149 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 443016 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 1
Probabilistic random walk after 443016 steps, saw 263836 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
[2024-06-01 07:09:01] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-06-01 07:09:01] [INFO ] Invariant cache hit.
[2024-06-01 07:09:01] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 90 places in 295 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 362/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 790 constraints, problems are : Problem set: 0 solved, 1 unsolved in 880 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/587 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 497/1084 variables, 233/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 362/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 793 constraints, problems are : Problem set: 0 solved, 1 unsolved in 696 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1592ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 54 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 308/342 places, 1463/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 500840 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :0 out of 1
Probabilistic random walk after 500840 steps, saw 195333 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
[2024-06-01 07:09:05] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2024-06-01 07:09:05] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 07:09:05] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 294/812 variables, 204/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 188/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 551 constraints, problems are : Problem set: 0 solved, 1 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/518 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/518 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 294/812 variables, 204/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 188/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/812 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/812 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 556 constraints, problems are : Problem set: 0 solved, 1 unsolved in 955 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1392ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 56 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 55 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-06-01 07:09:07] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:09:07] [INFO ] Invariant cache hit.
[2024-06-01 07:09:07] [INFO ] Implicit Places using invariants in 529 ms returned []
[2024-06-01 07:09:07] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:09:07] [INFO ] Invariant cache hit.
[2024-06-01 07:09:08] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 07:09:09] [INFO ] Implicit Places using invariants and state equation in 1579 ms returned []
Implicit Place search using SMT with State Equation took 2110 ms to find 0 implicit places.
[2024-06-01 07:09:09] [INFO ] Redundant transitions in 40 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-06-01 07:09:09] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:09:09] [INFO ] Invariant cache hit.
[2024-06-01 07:09:09] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 3 places in 232 ms of which 3 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 54 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 59 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 2 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 60 places in 195 ms of which 3 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 58 places in 233 ms of which 3 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 60 places in 219 ms of which 3 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 51 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 58 places in 179 ms of which 3 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:09:29] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:09:29] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 2 ms to minimize.
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 22 places in 290 ms of which 3 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 54 places in 271 ms of which 3 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 64 places in 269 ms of which 3 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 3 ms to minimize.
[2024-06-01 07:09:39] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 3 ms to minimize.
[2024-06-01 07:09:39] [INFO ] Deduced a trap composed of 21 places in 253 ms of which 3 ms to minimize.
[2024-06-01 07:09:39] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:09:39] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:09:40] [INFO ] Deduced a trap composed of 25 places in 273 ms of which 4 ms to minimize.
[2024-06-01 07:09:40] [INFO ] Deduced a trap composed of 26 places in 269 ms of which 3 ms to minimize.
[2024-06-01 07:09:40] [INFO ] Deduced a trap composed of 67 places in 230 ms of which 3 ms to minimize.
SMT process timed out in 30987ms, After SMT, problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 31011ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33225 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1332 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 6 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 266 transition count 317
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 123 place count 205 transition count 302
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 160 place count 183 transition count 302
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 326 place count 100 transition count 219
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 366 place count 100 transition count 179
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 380 place count 93 transition count 179
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 387 place count 93 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 395 place count 93 transition count 164
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 438 place count 93 transition count 121
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 481 place count 50 transition count 121
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 488 place count 50 transition count 121
Applied a total of 488 rules in 60 ms. Remains 50 /308 variables (removed 258) and now considering 121/1463 (removed 1342) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 50 cols
[2024-06-01 07:09:40] [INFO ] Computed 15 invariants in 2 ms
[2024-06-01 07:09:40] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-06-01 07:09:40] [INFO ] After 45ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 07:09:40] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 07:09:40] [INFO ] After 9ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:09:40] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:09:40] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-06-01 07:09:40] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 07:09:40] [INFO ] After 7ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:09:40] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:09:40] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 252 ms.
RANDOM walk for 40000 steps (8 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 364350 steps, run visited all 1 properties in 2525 ms. (steps per millisecond=144 )
Probabilistic random walk after 364350 steps, saw 222216 distinct states, run finished after 2526 ms. (steps per millisecond=144 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 113158 steps, run visited all 1 properties in 792 ms. (steps per millisecond=142 )
Probabilistic random walk after 113158 steps, saw 76084 distinct states, run finished after 792 ms. (steps per millisecond=142 ) properties seen :1
RANDOM walk for 22178 steps (4 resets) in 59 ms. (369 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 22478 steps, run visited all 1 properties in 151 ms. (steps per millisecond=148 )
Probabilistic random walk after 22478 steps, saw 16711 distinct states, run finished after 151 ms. (steps per millisecond=148 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 9766 steps, run visited all 1 properties in 73 ms. (steps per millisecond=133 )
Probabilistic random walk after 9766 steps, saw 7506 distinct states, run finished after 74 ms. (steps per millisecond=131 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 69470 steps, run visited all 1 properties in 509 ms. (steps per millisecond=136 )
Probabilistic random walk after 69470 steps, saw 48247 distinct states, run finished after 512 ms. (steps per millisecond=135 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 156830 steps, run visited all 1 properties in 1043 ms. (steps per millisecond=150 )
Probabilistic random walk after 156830 steps, saw 102967 distinct states, run finished after 1043 ms. (steps per millisecond=150 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 137334 steps, run visited all 1 properties in 927 ms. (steps per millisecond=148 )
Probabilistic random walk after 137334 steps, saw 91235 distinct states, run finished after 928 ms. (steps per millisecond=147 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 65622 steps, run visited all 1 properties in 443 ms. (steps per millisecond=148 )
Probabilistic random walk after 65622 steps, saw 45757 distinct states, run finished after 444 ms. (steps per millisecond=147 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2966 steps, run visited all 1 properties in 23 ms. (steps per millisecond=128 )
Probabilistic random walk after 2966 steps, saw 2436 distinct states, run finished after 23 ms. (steps per millisecond=128 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2246 steps, run visited all 1 properties in 19 ms. (steps per millisecond=118 )
Probabilistic random walk after 2246 steps, saw 1845 distinct states, run finished after 19 ms. (steps per millisecond=118 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 449376 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 1
Probabilistic random walk after 449376 steps, saw 267434 distinct states, run finished after 3005 ms. (steps per millisecond=149 ) properties seen :0
[2024-06-01 07:09:50] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
// Phase 1: matrix 742 rows 342 cols
[2024-06-01 07:09:50] [INFO ] Computed 22 invariants in 8 ms
[2024-06-01 07:09:50] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:09:50] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 362/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:09:51] [INFO ] Deduced a trap composed of 3 places in 280 ms of which 3 ms to minimize.
[2024-06-01 07:09:51] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 362/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:09:52] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 1/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 793 constraints, problems are : Problem set: 0 solved, 1 unsolved in 973 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1527ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 53 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 86 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 308/342 places, 1463/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 484272 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 1
Probabilistic random walk after 484272 steps, saw 192014 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
[2024-06-01 07:09:55] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2024-06-01 07:09:55] [INFO ] Computed 22 invariants in 5 ms
[2024-06-01 07:09:55] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:09:55] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 294/812 variables, 204/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 188/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 551 constraints, problems are : Problem set: 0 solved, 1 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/518 variables, 5/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/518 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 294/812 variables, 204/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 188/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/812 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 557 constraints, problems are : Problem set: 0 solved, 1 unsolved in 920 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1361ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 41 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 42 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-06-01 07:09:57] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:09:57] [INFO ] Invariant cache hit.
[2024-06-01 07:09:57] [INFO ] Implicit Places using invariants in 540 ms returned []
[2024-06-01 07:09:57] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:09:57] [INFO ] Invariant cache hit.
[2024-06-01 07:09:57] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 07:09:59] [INFO ] Implicit Places using invariants and state equation in 1540 ms returned []
Implicit Place search using SMT with State Equation took 2084 ms to find 0 implicit places.
[2024-06-01 07:09:59] [INFO ] Redundant transitions in 28 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-06-01 07:09:59] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:09:59] [INFO ] Invariant cache hit.
[2024-06-01 07:09:59] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 3 places in 296 ms of which 3 ms to minimize.
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 54 places in 173 ms of which 2 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 59 places in 233 ms of which 3 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 2 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 60 places in 211 ms of which 2 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 58 places in 200 ms of which 2 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 60 places in 209 ms of which 3 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 55 places in 193 ms of which 3 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 51 places in 185 ms of which 3 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 58 places in 222 ms of which 2 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:10:20] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:10:20] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 2 ms to minimize.
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:10:25] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 48 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 26/48 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 16 places in 290 ms of which 4 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 17 places in 466 ms of which 4 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 19 places in 447 ms of which 5 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 21 places in 381 ms of which 5 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 18 places in 393 ms of which 5 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 23 places in 375 ms of which 5 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 19 places in 340 ms of which 5 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 1 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 65 places in 270 ms of which 3 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 68 places in 265 ms of which 3 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 74 places in 259 ms of which 3 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 62 places in 256 ms of which 3 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 66 places in 307 ms of which 3 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 69 places in 308 ms of which 3 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 63 places in 249 ms of which 3 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 64 places in 340 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 38 places in 424 ms of which 8 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 40 places in 294 ms of which 4 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 42 places in 265 ms of which 3 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 52 places in 279 ms of which 4 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 53 places in 327 ms of which 4 ms to minimize.
SMT process timed out in 61025ms, After SMT, problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 61041ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63204 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1332 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 266 transition count 317
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 123 place count 205 transition count 302
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 160 place count 183 transition count 302
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 326 place count 100 transition count 219
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 366 place count 100 transition count 179
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 380 place count 93 transition count 179
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 387 place count 93 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 395 place count 93 transition count 164
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 438 place count 93 transition count 121
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 481 place count 50 transition count 121
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 488 place count 50 transition count 121
Applied a total of 488 rules in 44 ms. Remains 50 /308 variables (removed 258) and now considering 121/1463 (removed 1342) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 50 cols
[2024-06-01 07:11:00] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 07:11:00] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-06-01 07:11:00] [INFO ] After 66ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 07:11:00] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 07:11:00] [INFO ] After 13ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:11:00] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:11:00] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-06-01 07:11:00] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 07:11:00] [INFO ] After 11ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:11:00] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:11:00] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 308 ms.
RANDOM walk for 40000 steps (8 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 423064 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 1
Probabilistic random walk after 423064 steps, saw 253409 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
[2024-06-01 07:11:03] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
// Phase 1: matrix 742 rows 342 cols
[2024-06-01 07:11:03] [INFO ] Computed 22 invariants in 5 ms
[2024-06-01 07:11:03] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 362/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 717 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 3 places in 258 ms of which 3 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 3 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 362/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1084 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 794 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1613 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 2350ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 78 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 308/342 places, 1463/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 51886 steps, run visited all 1 properties in 527 ms. (steps per millisecond=98 )
Probabilistic random walk after 51886 steps, saw 32735 distinct states, run finished after 528 ms. (steps per millisecond=98 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 102246 steps, run visited all 1 properties in 889 ms. (steps per millisecond=115 )
Probabilistic random walk after 102246 steps, saw 69177 distinct states, run finished after 890 ms. (steps per millisecond=114 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 151782 steps, run visited all 1 properties in 1189 ms. (steps per millisecond=127 )
Probabilistic random walk after 151782 steps, saw 99847 distinct states, run finished after 1193 ms. (steps per millisecond=127 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 69038 steps, run visited all 1 properties in 562 ms. (steps per millisecond=122 )
Probabilistic random walk after 69038 steps, saw 48014 distinct states, run finished after 563 ms. (steps per millisecond=122 ) properties seen :1
RANDOM walk for 32017 steps (6 resets) in 131 ms. (242 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 758 steps, run visited all 1 properties in 13 ms. (steps per millisecond=58 )
Probabilistic random walk after 758 steps, saw 651 distinct states, run finished after 13 ms. (steps per millisecond=58 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 72278 steps, run visited all 1 properties in 678 ms. (steps per millisecond=106 )
Probabilistic random walk after 72278 steps, saw 50032 distinct states, run finished after 678 ms. (steps per millisecond=106 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 49510 steps, run visited all 1 properties in 325 ms. (steps per millisecond=152 )
Probabilistic random walk after 49510 steps, saw 35268 distinct states, run finished after 325 ms. (steps per millisecond=152 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 23638 steps, run visited all 1 properties in 163 ms. (steps per millisecond=145 )
Probabilistic random walk after 23638 steps, saw 17572 distinct states, run finished after 163 ms. (steps per millisecond=145 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 9014 steps, run visited all 1 properties in 101 ms. (steps per millisecond=89 )
Probabilistic random walk after 9014 steps, saw 6971 distinct states, run finished after 101 ms. (steps per millisecond=89 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 10662 steps, run visited all 1 properties in 118 ms. (steps per millisecond=90 )
Probabilistic random walk after 10662 steps, saw 8235 distinct states, run finished after 118 ms. (steps per millisecond=90 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3854 steps, run visited all 1 properties in 44 ms. (steps per millisecond=87 )
Probabilistic random walk after 3854 steps, saw 3124 distinct states, run finished after 45 ms. (steps per millisecond=85 ) properties seen :1
RANDOM walk for 392 steps (0 resets) in 8 ms. (43 steps per ms) remains 0/1 properties
RANDOM walk for 604 steps (0 resets) in 8 ms. (67 steps per ms) remains 0/1 properties
RANDOM walk for 1052 steps (0 resets) in 9 ms. (105 steps per ms) remains 0/1 properties
RANDOM walk for 1488 steps (0 resets) in 10 ms. (135 steps per ms) remains 0/1 properties
RANDOM walk for 1938 steps (0 resets) in 13 ms. (138 steps per ms) remains 0/1 properties
RANDOM walk for 2345 steps (0 resets) in 13 ms. (167 steps per ms) remains 0/1 properties
RANDOM walk for 392 steps (0 resets) in 7 ms. (49 steps per ms) remains 0/1 properties
RANDOM walk for 879 steps (0 resets) in 8 ms. (97 steps per ms) remains 0/1 properties
RANDOM walk for 1299 steps (0 resets) in 11 ms. (108 steps per ms) remains 0/1 properties
RANDOM walk for 1369 steps (0 resets) in 12 ms. (105 steps per ms) remains 0/1 properties
RANDOM walk for 2053 steps (0 resets) in 13 ms. (146 steps per ms) remains 0/1 properties
RANDOM walk for 2415 steps (0 resets) in 13 ms. (172 steps per ms) remains 0/1 properties
RANDOM walk for 2795 steps (0 resets) in 15 ms. (174 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 331800 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 1
Probabilistic random walk after 331800 steps, saw 203793 distinct states, run finished after 3004 ms. (steps per millisecond=110 ) properties seen :0
[2024-06-01 07:11:14] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-06-01 07:11:14] [INFO ] Invariant cache hit.
[2024-06-01 07:11:14] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 362/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 808 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 362/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1084 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 792 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1861ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 65 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 76 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 308/342 places, 1463/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 448344 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 1
Probabilistic random walk after 448344 steps, saw 180805 distinct states, run finished after 3004 ms. (steps per millisecond=149 ) properties seen :0
[2024-06-01 07:11:19] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2024-06-01 07:11:20] [INFO ] Computed 22 invariants in 4 ms
[2024-06-01 07:11:20] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 294/812 variables, 204/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 188/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 551 constraints, problems are : Problem set: 0 solved, 1 unsolved in 529 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/518 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 294/812 variables, 204/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 188/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/812 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 552 constraints, problems are : Problem set: 0 solved, 1 unsolved in 516 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1078ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 56 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 58 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-06-01 07:11:21] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:11:21] [INFO ] Invariant cache hit.
[2024-06-01 07:11:22] [INFO ] Implicit Places using invariants in 832 ms returned []
[2024-06-01 07:11:22] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:11:22] [INFO ] Invariant cache hit.
[2024-06-01 07:11:22] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 07:11:23] [INFO ] Implicit Places using invariants and state equation in 1708 ms returned []
Implicit Place search using SMT with State Equation took 2542 ms to find 0 implicit places.
[2024-06-01 07:11:23] [INFO ] Redundant transitions in 29 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-06-01 07:11:23] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:11:23] [INFO ] Invariant cache hit.
[2024-06-01 07:11:23] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:11:40] [INFO ] Deduced a trap composed of 3 places in 283 ms of which 3 ms to minimize.
[2024-06-01 07:11:40] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:11:40] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:11:40] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:11:40] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:11:40] [INFO ] Deduced a trap composed of 39 places in 226 ms of which 2 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 54 places in 187 ms of which 3 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 59 places in 192 ms of which 3 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 60 places in 215 ms of which 3 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 58 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 60 places in 206 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 55 places in 183 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 51 places in 193 ms of which 3 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 58 places in 216 ms of which 3 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 48 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 26/48 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 2 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 17 places in 320 ms of which 3 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 19 places in 352 ms of which 5 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 21 places in 405 ms of which 4 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 18 places in 353 ms of which 5 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 23 places in 353 ms of which 4 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 19 places in 339 ms of which 4 ms to minimize.
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 1 ms to minimize.
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 2 ms to minimize.
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 65 places in 452 ms of which 5 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 68 places in 483 ms of which 5 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 74 places in 468 ms of which 5 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 62 places in 478 ms of which 5 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 66 places in 446 ms of which 5 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 69 places in 467 ms of which 5 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 63 places in 403 ms of which 4 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 64 places in 393 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 38 places in 197 ms of which 3 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 40 places in 202 ms of which 3 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 52 places in 179 ms of which 3 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 53 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 3 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 43 places in 218 ms of which 3 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 56 places in 242 ms of which 3 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 56 places in 279 ms of which 3 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 61 places in 227 ms of which 4 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 60 places in 317 ms of which 4 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 41 places in 316 ms of which 4 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 39 places in 284 ms of which 4 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 43 places in 268 ms of which 4 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 44 places in 192 ms of which 3 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 71 places in 184 ms of which 2 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 67 places in 228 ms of which 4 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 59 places in 299 ms of which 4 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 81 places in 326 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/812 variables, and 88 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1456 constraints, Known Traps: 66/66 constraints]
After SMT, in 60901ms problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 60916ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63554 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1349 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 266 transition count 316
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 204 transition count 316
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 125 place count 204 transition count 301
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 162 place count 182 transition count 301
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 328 place count 99 transition count 218
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 370 place count 99 transition count 176
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 384 place count 92 transition count 176
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 391 place count 92 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 398 place count 92 transition count 162
Free-agglomeration rule applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 440 place count 92 transition count 120
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 482 place count 50 transition count 120
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 489 place count 50 transition count 120
Applied a total of 489 rules in 44 ms. Remains 50 /308 variables (removed 258) and now considering 120/1463 (removed 1343) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 120 rows 50 cols
[2024-06-01 07:12:24] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 07:12:24] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-01 07:12:24] [INFO ] After 57ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 07:12:24] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 07:12:24] [INFO ] After 9ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:12:24] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:12:24] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-01 07:12:25] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 07:12:25] [INFO ] After 9ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:12:25] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:12:25] [INFO ] After 126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 302 ms.
RANDOM walk for 40000 steps (8 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 412272 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 1
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 Liveness -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="EisenbergMcGuire-PT-07"
export BK_EXAMINATION="Liveness"
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 EisenbergMcGuire-PT-07, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r494-smll-171636275100114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-07.tgz
mv EisenbergMcGuire-PT-07 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.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 [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;