About the Execution of LTSMin+red for EisenbergMcGuire-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4866.231 | 1800000.00 | 3013022.00 | 4733.40 | [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-171636275100128.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-10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r494-smll-171636275100128
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 7.7K 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 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K 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 51K 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 3.1M 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 StableMarking
=== Now, execution of the tool begins
BK_START 1717230977352
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:36:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 08:36:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:36:20] [INFO ] Load time of PNML (sax parser for PT used): 715 ms
[2024-06-01 08:36:20] [INFO ] Transformed 1090 places.
[2024-06-01 08:36:20] [INFO ] Transformed 5200 transitions.
[2024-06-01 08:36:20] [INFO ] Found NUPN structural information;
[2024-06-01 08:36:20] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 1124 ms.
RANDOM walk for 40000 steps (8 resets) in 3860 ms. (10 steps per ms) remains 367/1090 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 367/367 properties
[2024-06-01 08:36:22] [INFO ] Flow matrix only has 2330 transitions (discarded 2870 similar events)
// Phase 1: matrix 2330 rows 1090 cols
[2024-06-01 08:36:22] [INFO ] Computed 31 invariants in 35 ms
[2024-06-01 08:36:22] [INFO ] State equation strengthened by 1246 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s345 (/ 1.0 2.0))
(s351 (/ 1.0 2.0))
(s361 (/ 1.0 2.0))
(s366 (/ 1.0 2.0))
(s372 (/ 1.0 2.0))
(s373 (/ 1.0 2.0))
(s384 (/ 1.0 2.0))
(s397 (/ 1.0 2.0))
(s400 (/ 1.0 2.0))
(s430 (/ 1.0 2.0))
(s431 (/ 1.0 2.0))
(s432 (/ 1.0 2.0))
(s433 (/ 1.0 2.0))
(s434 (/ 1.0 2.0))
(s435 (/ 1.0 2.0))
(s436 (/ 1.0 2.0))
(s437 (/ 1.0 2.0))
(s438 (/ 1.0 2.0))
(s439 (/ 1.0 2.0))
(s440 (/ 1.0 2.0))
(s441 (/ 1.0 2.0))
(s442 (/ 1.0 2.0))
(s443 (/ 1.0 2.0))
(s444 (/ 1.0 2.0))
(s445 (/ 1.0 2.0))
(s446 (/ 1.0 2.0))
(s447 (/ 1.0 2.0))
(s448 (/ 1.0 2.0))
(s449 (/ 1.0 2.0))
(s450 (/ 1.0 2.0))
(s451 (/ 1.0 2.0))
(s452 (/ 1.0 2.0))
(s453 (/ 1.0 2.0))
(s454 (/ 1.0 2.0))
(s455 (/ 1.0 2.0))
(s456 (/ 1.0 2.0))
(s457 (/ 1.0 2.0))
(s458 (/ 1.0 2.0))
(s459 (/ 1.0 2.0))
(s460 (/ 1.0 2.0))
(s461 (/ 1.0 2.0))
(s462 (/ 1.0 2.0))
(s463 (/ 1.0 2.0))
(s464 (/ 1.0 2.0))
(s465 (/ 1.0 2.0))
(s466 (/ 1.0 2.0))
(s467 (/ 1.0 2.0))
(s468 (/ 1.0 2.0))
(s469 (/ 1.0 2.0))
(s470 (/ 1.0 2.0))
(s471 (/ 1.0 2.0))
(s472 (/ 1.0 2.0))
(s473 (/ 1.0 2.0))
(s474 (/ 1.0 2.0))
(s475 (/ 1.0 2.0))
(s476 (/ 1.0 2.0))
(s477 (/ 1.0 2.0))
(s478 (/ 1.0 2.0))
(s479 (/ 1.0 2.0))
(s480 (/ 1.0 2.0))
(s481 (/ 1.0 2.0))
(s482 (/ 1.0 2.0))
(s483 (/ 1.0 2.0))
(s484 (/ 1.0 2.0))
(s485 (/ 1.0 2.0))
(s486 (/ 1.0 2.0))
(s487 (/ 1.0 2.0))
(s488 (/ 1.0 2.0))
(s489 (/ 1.0 2.0))
(s490 (/ 1.0 2.0))
(s491 (/ 1.0 2.0))
(s492 (/ 1.0 2.0))
(s493 (/ 1.0 2.0))
(s494 (/ 1.0 2.0))
(s495 (/ 1.0 2.0))
(s496 (/ 1.0 2.0))
(s497 (/ 1.0 2.0))
(s498 (/ 1.0 2.0))
(s499 (/ 1.0 2.0))
(s500 (/ 1.0 2.0))
(s501 (/ 1.0 2.0))
(s502 (/ 1.0 2.0))
(s503 (/ 1.0 2.0))
(s504 (/ 1.0 2.0))
(s505 (/ 1.0 2.0))
(s506 (/ 1.0 2.0))
(s507 (/ 1.0 2.0))
(s508 (/ 1.0 2.0))
(s509 (/ 1.0 2.0))
(s510 (/ 1.0 2.0))
(s511 (/ 1.0 2.0))
(s512 (/ 1.0 2.0))
(s513 (/ 1.0 2.0))
(s514 (/ 1.0 2.0))
(s515 (/ 1.0 2.0))
(s516 (/ 1.0 2.0))
(s517 (/ 1.0 2.0))
(s518 (/ 1.0 2.0))
(s519 (/ 1.0 2.0))
(s751 (/ 1.0 2.0))
(s752 (/ 1.0 2.0))
(s753 (/ 1.0 2.0))
(s754 (/ 1.0 2.0))
(s755 (/ 1.0 2.0))
(s756 (/ 1.0 2.0))
(s757 (/ 1.0 2.0))
(s758 (/ 1.0 2.0))
(s761 (/ 1.0 2.0))
(s762 (/ 1.0 2.0))
(s763 (/ 1.0 2.0))
(s764 (/ 1.0 2.0))
(s765 (/ 1.0 2.0))
(s766 (/ 1.0 2.0))
(s767 (/ 1.0 2.0))
(s768 (/ 1.0 2.0))
(s770 (/ 1.0 2.0))
(s771 (/ 1.0 2.0))
(s772 (/ 1.0 2.0))
(s773 (/ 1.0 2.0))
(s774 (/ 1.0 2.0))
(s775 (/ 1.0 2.0))
(s776 (/ 1.0 2.0))
(s777 (/ 1.0 2.0))
(s778 (/ 1.0 2.0))
(s780 (/ 1.0 2.0))
(s781 (/ 1.0 2.0))
(s782 (/ 1.0 2.0))
(s783 (/ 1.0 2.0))
(s784 (/ 1.0 2.0))
(s785 (/ 1.0 2.0))
(s786 (/ 1.0 2.0))
(s787 (/ 1.0 2.0))
(s788 (/ 1.0 2.0))
(s790 (/ 1.0 2.0))
(s791 (/ 1.0 2.0))
(s792 (/ 1.0 2.0))
(s793 (/ 1.0 2.0))
(s794 (/ 1.0 2.0))
(s795 (/ 1.0 2.0))
(s796 (/ 1.0 2.0))
(s797 (/ 1.0 2.0))
(s798 (/ 1.0 2.0))
(s800 (/ 1.0 2.0))
(s801 (/ 1.0 2.0))
(s802 (/ 1.0 2.0))
(s803 (/ 1.0 2.0))
(s804 (/ 1.0 2.0))
(s805 (/ 1.0 2.0))
(s806 (/ 1.0 2.0))
(s807 (/ 1.0 2.0))
(s808 (/ 1.0 2.0))
(s810 (/ 1.0 2.0))
(s811 (/ 1.0 2.0))
(s812 (/ 1.0 2.0))
(s813 (/ 1.0 2.0))
(s814 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 367/367 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 367/3420 variables, and 367 constraints, problems are : Problem set: 0 solved, 367 unsolved in 5109 ms.
Refiners :[Domain max(s): 367/1090 constraints, Positive P Invariants (semi-flows): 0/21 constraints, Generalized P Invariants (flows): 0/10 constraints, State Equation: 0/1090 constraints, ReadFeed: 0/1246 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 367/367 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 693/1060 variables, 20/387 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1060 variables, 693/1080 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1060/3420 variables, and 1080 constraints, problems are : Problem set: 0 solved, 367 unsolved in 5018 ms.
Refiners :[Domain max(s): 1060/1090 constraints, Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 0/10 constraints, State Equation: 0/1090 constraints, ReadFeed: 0/1246 constraints, PredecessorRefiner: 0/367 constraints, Known Traps: 0/0 constraints]
After SMT, in 10644ms problems are : Problem set: 0 solved, 367 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 367 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1090 transition count 5190
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1080 transition count 5190
Performed 220 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 220 Pre rules applied. Total rules applied 20 place count 1080 transition count 4970
Deduced a syphon composed of 220 places in 6 ms
Reduce places removed 220 places and 0 transitions.
Iterating global reduction 2 with 440 rules applied. Total rules applied 460 place count 860 transition count 4970
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 550 place count 770 transition count 4070
Iterating global reduction 2 with 90 rules applied. Total rules applied 640 place count 770 transition count 4070
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 22 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 802 place count 689 transition count 3989
Applied a total of 802 rules in 1134 ms. Remains 689 /1090 variables (removed 401) and now considering 3989/5200 (removed 1211) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1159 ms. Remains : 689/1090 places, 3989/5200 transitions.
RANDOM walk for 4000000 steps (8 resets) in 113272 ms. (35 steps per ms) remains 350/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 350/350 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 350/350 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 350/350 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 350/350 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 350/350 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 350/350 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 349/350 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 349/349 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 349/349 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 349/349 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 349/349 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 349/349 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 349/349 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 349/349 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 349/349 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 349/349 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 349/349 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 348/349 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 347/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 346/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 345/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 345/345 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 345/345 properties
Interrupted probabilistic random walk after 3589894 steps, run timeout after 102001 ms. (steps per millisecond=35 ) properties seen :318 out of 345
Probabilistic random walk after 3589894 steps, saw 1979780 distinct states, run finished after 102015 ms. (steps per millisecond=35 ) properties seen :318
[2024-06-01 08:38:50] [INFO ] Flow matrix only has 1119 transitions (discarded 2870 similar events)
// Phase 1: matrix 1119 rows 689 cols
[2024-06-01 08:38:50] [INFO ] Computed 31 invariants in 8 ms
[2024-06-01 08:38:50] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 567/594 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 18/612 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 1008/1620 variables, 612/639 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1620 variables, 234/873 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1620 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 28/1648 variables, 10/883 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1648 variables, 1/884 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1648 variables, 106/990 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1648 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 26/1674 variables, 12/1002 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1674 variables, 12/1014 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1674 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (OVERLAPS) 53/1727 variables, 2/1016 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1727 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 17 (OVERLAPS) 2/1729 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1729 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 19 (OVERLAPS) 79/1808 variables, 55/1072 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1808 variables, 84/1156 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1808 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 22 (OVERLAPS) 0/1808 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1808/1808 variables, and 1156 constraints, problems are : Problem set: 0 solved, 27 unsolved in 17392 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 689/689 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 567/594 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 18/612 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-01 08:39:10] [INFO ] Deduced a trap composed of 3 places in 1033 ms of which 93 ms to minimize.
[2024-06-01 08:39:11] [INFO ] Deduced a trap composed of 3 places in 1010 ms of which 10 ms to minimize.
[2024-06-01 08:39:12] [INFO ] Deduced a trap composed of 3 places in 909 ms of which 7 ms to minimize.
[2024-06-01 08:39:13] [INFO ] Deduced a trap composed of 15 places in 624 ms of which 6 ms to minimize.
[2024-06-01 08:39:13] [INFO ] Deduced a trap composed of 3 places in 429 ms of which 6 ms to minimize.
[2024-06-01 08:39:14] [INFO ] Deduced a trap composed of 13 places in 312 ms of which 4 ms to minimize.
[2024-06-01 08:39:14] [INFO ] Deduced a trap composed of 37 places in 559 ms of which 6 ms to minimize.
[2024-06-01 08:39:15] [INFO ] Deduced a trap composed of 5 places in 539 ms of which 6 ms to minimize.
[2024-06-01 08:39:15] [INFO ] Deduced a trap composed of 3 places in 524 ms of which 5 ms to minimize.
[2024-06-01 08:39:16] [INFO ] Deduced a trap composed of 35 places in 499 ms of which 5 ms to minimize.
[2024-06-01 08:39:16] [INFO ] Deduced a trap composed of 56 places in 521 ms of which 6 ms to minimize.
[2024-06-01 08:39:17] [INFO ] Deduced a trap composed of 11 places in 477 ms of which 5 ms to minimize.
[2024-06-01 08:39:17] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2024-06-01 08:39:17] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 1 ms to minimize.
[2024-06-01 08:39:18] [INFO ] Deduced a trap composed of 15 places in 506 ms of which 5 ms to minimize.
[2024-06-01 08:39:18] [INFO ] Deduced a trap composed of 19 places in 369 ms of which 4 ms to minimize.
[2024-06-01 08:39:19] [INFO ] Deduced a trap composed of 23 places in 412 ms of which 4 ms to minimize.
[2024-06-01 08:39:19] [INFO ] Deduced a trap composed of 27 places in 304 ms of which 4 ms to minimize.
[2024-06-01 08:39:19] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2024-06-01 08:39:20] [INFO ] Deduced a trap composed of 15 places in 733 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-01 08:39:21] [INFO ] Deduced a trap composed of 15 places in 514 ms of which 5 ms to minimize.
[2024-06-01 08:39:21] [INFO ] Deduced a trap composed of 55 places in 182 ms of which 2 ms to minimize.
[2024-06-01 08:39:22] [INFO ] Deduced a trap composed of 17 places in 517 ms of which 6 ms to minimize.
[2024-06-01 08:39:23] [INFO ] Deduced a trap composed of 61 places in 530 ms of which 6 ms to minimize.
[2024-06-01 08:39:23] [INFO ] Deduced a trap composed of 22 places in 408 ms of which 5 ms to minimize.
[2024-06-01 08:39:23] [INFO ] Deduced a trap composed of 55 places in 299 ms of which 4 ms to minimize.
[2024-06-01 08:39:24] [INFO ] Deduced a trap composed of 60 places in 200 ms of which 3 ms to minimize.
[2024-06-01 08:39:24] [INFO ] Deduced a trap composed of 52 places in 307 ms of which 3 ms to minimize.
[2024-06-01 08:39:24] [INFO ] Deduced a trap composed of 59 places in 207 ms of which 3 ms to minimize.
[2024-06-01 08:39:25] [INFO ] Deduced a trap composed of 59 places in 488 ms of which 5 ms to minimize.
[2024-06-01 08:39:25] [INFO ] Deduced a trap composed of 38 places in 537 ms of which 6 ms to minimize.
[2024-06-01 08:39:26] [INFO ] Deduced a trap composed of 34 places in 517 ms of which 5 ms to minimize.
[2024-06-01 08:39:26] [INFO ] Deduced a trap composed of 26 places in 518 ms of which 5 ms to minimize.
[2024-06-01 08:39:27] [INFO ] Deduced a trap composed of 56 places in 258 ms of which 4 ms to minimize.
[2024-06-01 08:39:27] [INFO ] Deduced a trap composed of 58 places in 183 ms of which 2 ms to minimize.
[2024-06-01 08:39:27] [INFO ] Deduced a trap composed of 56 places in 310 ms of which 4 ms to minimize.
[2024-06-01 08:39:28] [INFO ] Deduced a trap composed of 57 places in 158 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 17/64 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-01 08:39:28] [INFO ] Deduced a trap composed of 31 places in 305 ms of which 3 ms to minimize.
[2024-06-01 08:39:29] [INFO ] Deduced a trap composed of 54 places in 120 ms of which 2 ms to minimize.
[2024-06-01 08:39:29] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 2 ms to minimize.
[2024-06-01 08:39:29] [INFO ] Deduced a trap composed of 52 places in 199 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/612 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 1008/1620 variables, 612/680 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1620 variables, 234/914 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-01 08:39:32] [INFO ] Deduced a trap composed of 25 places in 295 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1620 variables, 1/915 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1620 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 28/1648 variables, 10/925 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1648 variables, 1/926 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1648 variables, 106/1032 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1648 variables, 15/1047 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-01 08:39:41] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 3 ms to minimize.
[2024-06-01 08:39:43] [INFO ] Deduced a trap composed of 27 places in 178 ms of which 2 ms to minimize.
[2024-06-01 08:39:43] [INFO ] Deduced a trap composed of 29 places in 207 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1648 variables, 3/1050 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1648 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 18 (OVERLAPS) 26/1674 variables, 12/1062 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1674 variables, 12/1074 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1674 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 27 unsolved
SMT process timed out in 62493ms, After SMT, problems are : Problem set: 0 solved, 27 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 27 out of 689 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 689/689 places, 3989/3989 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 689 transition count 3899
Deduced a syphon composed of 90 places in 8 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 599 transition count 3899
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 8 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 198 place count 590 transition count 3890
Applied a total of 198 rules in 591 ms. Remains 590 /689 variables (removed 99) and now considering 3890/3989 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 591 ms. Remains : 590/689 places, 3890/3989 transitions.
RANDOM walk for 4000000 steps (8 resets) in 28303 ms. (141 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 411 ms. (970 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 767 ms. (520 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 682 ms. (585 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 561 ms. (711 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 608 ms. (656 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 601 ms. (664 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 509 ms. (784 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 416 ms. (959 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 409 ms. (975 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 417 ms. (956 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 414 ms. (963 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 416 ms. (959 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 409 ms. (975 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 415 ms. (961 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 414 ms. (963 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 410 ms. (973 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 415 ms. (961 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 412 ms. (968 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 414 ms. (963 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 414 ms. (963 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 414 ms. (963 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 419 ms. (952 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 419 ms. (952 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 421 ms. (947 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 411 ms. (970 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 420 ms. (950 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 418 ms. (954 steps per ms) remains 27/27 properties
Interrupted probabilistic random walk after 1241471 steps, run timeout after 33001 ms. (steps per millisecond=37 ) properties seen :2 out of 27
Probabilistic random walk after 1241471 steps, saw 752827 distinct states, run finished after 33001 ms. (steps per millisecond=37 ) properties seen :2
[2024-06-01 08:40:38] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-06-01 08:40:38] [INFO ] Computed 31 invariants in 5 ms
[2024-06-01 08:40:38] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 479/504 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 18/522 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 918/1440 variables, 522/549 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1440 variables, 234/783 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1440 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 28/1468 variables, 10/793 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1468 variables, 1/794 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1468 variables, 106/900 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1468 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (OVERLAPS) 26/1494 variables, 12/912 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1494 variables, 12/924 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1494 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 15 (OVERLAPS) 44/1538 variables, 2/926 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1538 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 17 (OVERLAPS) 2/1540 variables, 1/927 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1540 variables, 0/927 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 19 (OVERLAPS) 70/1610 variables, 46/973 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 84/1057 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 25 unsolved in 9820 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 479/504 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 18/522 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 08:40:50] [INFO ] Deduced a trap composed of 3 places in 796 ms of which 7 ms to minimize.
[2024-06-01 08:40:50] [INFO ] Deduced a trap composed of 25 places in 784 ms of which 6 ms to minimize.
[2024-06-01 08:40:51] [INFO ] Deduced a trap composed of 3 places in 819 ms of which 7 ms to minimize.
[2024-06-01 08:40:52] [INFO ] Deduced a trap composed of 3 places in 709 ms of which 6 ms to minimize.
[2024-06-01 08:40:53] [INFO ] Deduced a trap composed of 3 places in 706 ms of which 7 ms to minimize.
[2024-06-01 08:40:53] [INFO ] Deduced a trap composed of 38 places in 530 ms of which 6 ms to minimize.
[2024-06-01 08:40:54] [INFO ] Deduced a trap composed of 27 places in 585 ms of which 6 ms to minimize.
[2024-06-01 08:40:54] [INFO ] Deduced a trap composed of 13 places in 576 ms of which 6 ms to minimize.
[2024-06-01 08:40:55] [INFO ] Deduced a trap composed of 16 places in 466 ms of which 5 ms to minimize.
[2024-06-01 08:40:55] [INFO ] Deduced a trap composed of 15 places in 498 ms of which 5 ms to minimize.
[2024-06-01 08:40:56] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 2 ms to minimize.
[2024-06-01 08:40:56] [INFO ] Deduced a trap composed of 29 places in 342 ms of which 8 ms to minimize.
[2024-06-01 08:40:56] [INFO ] Deduced a trap composed of 16 places in 262 ms of which 2 ms to minimize.
[2024-06-01 08:40:56] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2024-06-01 08:40:57] [INFO ] Deduced a trap composed of 19 places in 375 ms of which 4 ms to minimize.
[2024-06-01 08:40:57] [INFO ] Deduced a trap composed of 15 places in 334 ms of which 3 ms to minimize.
[2024-06-01 08:40:57] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 3 ms to minimize.
[2024-06-01 08:40:58] [INFO ] Deduced a trap composed of 4 places in 275 ms of which 3 ms to minimize.
[2024-06-01 08:40:58] [INFO ] Deduced a trap composed of 3 places in 261 ms of which 3 ms to minimize.
[2024-06-01 08:40:58] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 08:40:59] [INFO ] Deduced a trap composed of 3 places in 392 ms of which 5 ms to minimize.
[2024-06-01 08:40:59] [INFO ] Deduced a trap composed of 50 places in 390 ms of which 3 ms to minimize.
[2024-06-01 08:40:59] [INFO ] Deduced a trap composed of 31 places in 366 ms of which 4 ms to minimize.
[2024-06-01 08:41:00] [INFO ] Deduced a trap composed of 35 places in 240 ms of which 3 ms to minimize.
[2024-06-01 08:41:00] [INFO ] Deduced a trap composed of 53 places in 302 ms of which 3 ms to minimize.
[2024-06-01 08:41:00] [INFO ] Deduced a trap composed of 29 places in 284 ms of which 3 ms to minimize.
[2024-06-01 08:41:01] [INFO ] Deduced a trap composed of 23 places in 313 ms of which 4 ms to minimize.
[2024-06-01 08:41:01] [INFO ] Deduced a trap composed of 21 places in 359 ms of which 4 ms to minimize.
[2024-06-01 08:41:01] [INFO ] Deduced a trap composed of 33 places in 289 ms of which 3 ms to minimize.
[2024-06-01 08:41:02] [INFO ] Deduced a trap composed of 51 places in 455 ms of which 4 ms to minimize.
[2024-06-01 08:41:03] [INFO ] Deduced a trap composed of 53 places in 593 ms of which 5 ms to minimize.
[2024-06-01 08:41:03] [INFO ] Deduced a trap composed of 43 places in 464 ms of which 4 ms to minimize.
[2024-06-01 08:41:04] [INFO ] Deduced a trap composed of 33 places in 480 ms of which 4 ms to minimize.
[2024-06-01 08:41:04] [INFO ] Deduced a trap composed of 25 places in 513 ms of which 5 ms to minimize.
[2024-06-01 08:41:05] [INFO ] Deduced a trap composed of 18 places in 475 ms of which 5 ms to minimize.
[2024-06-01 08:41:05] [INFO ] Deduced a trap composed of 15 places in 468 ms of which 4 ms to minimize.
[2024-06-01 08:41:06] [INFO ] Deduced a trap composed of 48 places in 387 ms of which 4 ms to minimize.
[2024-06-01 08:41:06] [INFO ] Deduced a trap composed of 17 places in 396 ms of which 5 ms to minimize.
[2024-06-01 08:41:06] [INFO ] Deduced a trap composed of 51 places in 292 ms of which 3 ms to minimize.
[2024-06-01 08:41:06] [INFO ] Deduced a trap composed of 55 places in 193 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 08:41:07] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 2 ms to minimize.
[2024-06-01 08:41:07] [INFO ] Deduced a trap composed of 17 places in 304 ms of which 3 ms to minimize.
[2024-06-01 08:41:08] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 3 ms to minimize.
[2024-06-01 08:41:08] [INFO ] Deduced a trap composed of 51 places in 159 ms of which 2 ms to minimize.
[2024-06-01 08:41:08] [INFO ] Deduced a trap composed of 53 places in 110 ms of which 1 ms to minimize.
[2024-06-01 08:41:08] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 2 ms to minimize.
[2024-06-01 08:41:08] [INFO ] Deduced a trap composed of 51 places in 193 ms of which 3 ms to minimize.
[2024-06-01 08:41:09] [INFO ] Deduced a trap composed of 53 places in 185 ms of which 2 ms to minimize.
[2024-06-01 08:41:09] [INFO ] Deduced a trap composed of 53 places in 177 ms of which 2 ms to minimize.
[2024-06-01 08:41:09] [INFO ] Deduced a trap composed of 49 places in 181 ms of which 2 ms to minimize.
[2024-06-01 08:41:09] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 2 ms to minimize.
[2024-06-01 08:41:10] [INFO ] Deduced a trap composed of 55 places in 216 ms of which 2 ms to minimize.
[2024-06-01 08:41:10] [INFO ] Deduced a trap composed of 27 places in 233 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 13/80 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 918/1440 variables, 522/602 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1440 variables, 234/836 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1440 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 28/1468 variables, 10/846 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1468 variables, 1/847 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1468 variables, 106/953 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1468 variables, 14/967 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 08:41:18] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1468 variables, 1/968 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 08:41:22] [INFO ] Deduced a trap composed of 21 places in 176 ms of which 2 ms to minimize.
[2024-06-01 08:41:22] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1468 variables, 2/970 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1468 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 18 (OVERLAPS) 26/1494 variables, 12/982 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1494 variables, 12/994 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1494 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 21 (OVERLAPS) 44/1538 variables, 2/996 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1538 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 23 (OVERLAPS) 2/1540 variables, 1/997 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1540 variables, 11/1008 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1540 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 26 (OVERLAPS) 70/1610 variables, 46/1054 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1610 variables, 84/1138 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 08:41:38] [INFO ] Deduced a trap composed of 3 places in 715 ms of which 6 ms to minimize.
[2024-06-01 08:41:39] [INFO ] Deduced a trap composed of 77 places in 789 ms of which 9 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1610 variables, 2/1140 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 08:41:44] [INFO ] Deduced a trap composed of 72 places in 998 ms of which 9 ms to minimize.
[2024-06-01 08:41:45] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 3 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1610 variables, 2/1142 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 08:41:47] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 2 ms to minimize.
[2024-06-01 08:41:50] [INFO ] Deduced a trap composed of 31 places in 1140 ms of which 9 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1610 variables, 2/1144 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1610 variables, 0/1144 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 08:41:59] [INFO ] Deduced a trap composed of 72 places in 1019 ms of which 9 ms to minimize.
At refinement iteration 32 (OVERLAPS) 0/1610 variables, 1/1145 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1145 constraints, problems are : Problem set: 0 solved, 25 unsolved in 75014 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 63/63 constraints]
After SMT, in 84894ms problems are : Problem set: 0 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 290 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 290 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 4000000 steps (8 resets) in 29293 ms. (136 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1289 ms. (310 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1232 ms. (324 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1216 ms. (328 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1239 ms. (322 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1605 ms. (249 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1333 ms. (299 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1301 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1419 ms. (281 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1422 ms. (281 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1066 ms. (374 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1357 ms. (294 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1322 ms. (302 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1579 ms. (253 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1387 ms. (288 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1713 ms. (233 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1404 ms. (284 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1656 ms. (241 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1406 ms. (284 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1488 ms. (268 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1288 ms. (310 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1339 ms. (298 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1357 ms. (294 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1653 ms. (241 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1559 ms. (256 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1326 ms. (301 steps per ms) remains 25/25 properties
Interrupted probabilistic random walk after 1987722 steps, run timeout after 63001 ms. (steps per millisecond=31 ) properties seen :2 out of 25
Probabilistic random walk after 1987722 steps, saw 1155521 distinct states, run finished after 63001 ms. (steps per millisecond=31 ) properties seen :2
[2024-06-01 08:43:27] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:43:27] [INFO ] Invariant cache hit.
[2024-06-01 08:43:27] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 425/448 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 16/464 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 816/1280 variables, 464/488 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1280 variables, 184/672 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1280 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 46/1326 variables, 10/682 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1326 variables, 1/683 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1326 variables, 94/777 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1326 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 52/1378 variables, 24/801 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1378 variables, 22/823 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1378 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (OVERLAPS) 88/1466 variables, 4/827 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1466 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 17 (OVERLAPS) 4/1470 variables, 2/829 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1470 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 19 (OVERLAPS) 140/1610 variables, 92/921 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 136/1057 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 23 unsolved in 8390 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 425/448 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 16/464 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 08:43:37] [INFO ] Deduced a trap composed of 3 places in 732 ms of which 7 ms to minimize.
[2024-06-01 08:43:38] [INFO ] Deduced a trap composed of 61 places in 657 ms of which 6 ms to minimize.
[2024-06-01 08:43:38] [INFO ] Deduced a trap composed of 46 places in 676 ms of which 6 ms to minimize.
[2024-06-01 08:43:39] [INFO ] Deduced a trap composed of 51 places in 559 ms of which 5 ms to minimize.
[2024-06-01 08:43:40] [INFO ] Deduced a trap composed of 48 places in 539 ms of which 5 ms to minimize.
[2024-06-01 08:43:40] [INFO ] Deduced a trap composed of 49 places in 595 ms of which 6 ms to minimize.
[2024-06-01 08:43:41] [INFO ] Deduced a trap composed of 17 places in 591 ms of which 6 ms to minimize.
[2024-06-01 08:43:41] [INFO ] Deduced a trap composed of 15 places in 600 ms of which 5 ms to minimize.
[2024-06-01 08:43:42] [INFO ] Deduced a trap composed of 33 places in 474 ms of which 5 ms to minimize.
[2024-06-01 08:43:42] [INFO ] Deduced a trap composed of 55 places in 490 ms of which 5 ms to minimize.
[2024-06-01 08:43:43] [INFO ] Deduced a trap composed of 68 places in 474 ms of which 5 ms to minimize.
[2024-06-01 08:43:43] [INFO ] Deduced a trap composed of 23 places in 502 ms of which 5 ms to minimize.
[2024-06-01 08:43:44] [INFO ] Deduced a trap composed of 25 places in 613 ms of which 6 ms to minimize.
[2024-06-01 08:43:45] [INFO ] Deduced a trap composed of 25 places in 583 ms of which 5 ms to minimize.
[2024-06-01 08:43:45] [INFO ] Deduced a trap composed of 67 places in 269 ms of which 4 ms to minimize.
[2024-06-01 08:43:45] [INFO ] Deduced a trap composed of 3 places in 276 ms of which 3 ms to minimize.
[2024-06-01 08:43:46] [INFO ] Deduced a trap composed of 13 places in 514 ms of which 5 ms to minimize.
[2024-06-01 08:43:46] [INFO ] Deduced a trap composed of 15 places in 369 ms of which 4 ms to minimize.
[2024-06-01 08:43:46] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 1 ms to minimize.
[2024-06-01 08:43:47] [INFO ] Deduced a trap composed of 11 places in 274 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 08:43:47] [INFO ] Deduced a trap composed of 51 places in 285 ms of which 3 ms to minimize.
[2024-06-01 08:43:47] [INFO ] Deduced a trap composed of 27 places in 284 ms of which 3 ms to minimize.
[2024-06-01 08:43:47] [INFO ] Deduced a trap composed of 3 places in 212 ms of which 3 ms to minimize.
[2024-06-01 08:43:48] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 2 ms to minimize.
[2024-06-01 08:43:48] [INFO ] Deduced a trap composed of 37 places in 362 ms of which 4 ms to minimize.
[2024-06-01 08:43:49] [INFO ] Deduced a trap composed of 44 places in 449 ms of which 4 ms to minimize.
[2024-06-01 08:43:49] [INFO ] Deduced a trap composed of 34 places in 389 ms of which 4 ms to minimize.
[2024-06-01 08:43:49] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 2 ms to minimize.
[2024-06-01 08:43:50] [INFO ] Deduced a trap composed of 17 places in 377 ms of which 4 ms to minimize.
[2024-06-01 08:43:50] [INFO ] Deduced a trap composed of 51 places in 289 ms of which 4 ms to minimize.
[2024-06-01 08:43:50] [INFO ] Deduced a trap composed of 55 places in 187 ms of which 3 ms to minimize.
[2024-06-01 08:43:51] [INFO ] Deduced a trap composed of 33 places in 409 ms of which 4 ms to minimize.
[2024-06-01 08:43:51] [INFO ] Deduced a trap composed of 19 places in 387 ms of which 4 ms to minimize.
[2024-06-01 08:43:51] [INFO ] Deduced a trap composed of 51 places in 286 ms of which 3 ms to minimize.
[2024-06-01 08:43:52] [INFO ] Deduced a trap composed of 55 places in 195 ms of which 5 ms to minimize.
[2024-06-01 08:43:52] [INFO ] Deduced a trap composed of 23 places in 276 ms of which 3 ms to minimize.
[2024-06-01 08:43:52] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 2 ms to minimize.
[2024-06-01 08:43:52] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 3 ms to minimize.
[2024-06-01 08:43:53] [INFO ] Deduced a trap composed of 29 places in 382 ms of which 4 ms to minimize.
[2024-06-01 08:43:53] [INFO ] Deduced a trap composed of 19 places in 350 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 08:43:54] [INFO ] Deduced a trap composed of 55 places in 209 ms of which 3 ms to minimize.
[2024-06-01 08:43:55] [INFO ] Deduced a trap composed of 13 places in 391 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 08:43:56] [INFO ] Deduced a trap composed of 21 places in 291 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 816/1280 variables, 464/531 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1280 variables, 184/715 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 08:43:58] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1280 variables, 1/716 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1280 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (OVERLAPS) 46/1326 variables, 10/726 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1326 variables, 1/727 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1326 variables, 94/821 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1326 variables, 13/834 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1326 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 18 (OVERLAPS) 52/1378 variables, 24/858 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1378 variables, 22/880 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1378 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 21 (OVERLAPS) 88/1466 variables, 4/884 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 08:44:10] [INFO ] Deduced a trap composed of 81 places in 1036 ms of which 8 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1466 variables, 1/885 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1466 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 24 (OVERLAPS) 4/1470 variables, 2/887 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1470 variables, 10/897 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 08:44:14] [INFO ] Deduced a trap composed of 3 places in 223 ms of which 3 ms to minimize.
[2024-06-01 08:44:14] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1470 variables, 2/899 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1470 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 28 (OVERLAPS) 140/1610 variables, 92/991 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1610 variables, 136/1127 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1610 variables, 0/1127 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 08:44:25] [INFO ] Deduced a trap composed of 93 places in 993 ms of which 8 ms to minimize.
[2024-06-01 08:44:26] [INFO ] Deduced a trap composed of 89 places in 933 ms of which 8 ms to minimize.
At refinement iteration 31 (OVERLAPS) 0/1610 variables, 2/1129 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1610 variables, 0/1129 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 33 (OVERLAPS) 0/1610 variables, 0/1129 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1129 constraints, problems are : Problem set: 0 solved, 23 unsolved in 59664 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 49/49 constraints]
After SMT, in 68134ms problems are : Problem set: 0 solved, 23 unsolved
Fused 23 Parikh solutions to 22 different solutions.
Parikh walk visited 5 properties in 7521 ms.
Support contains 18 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 270 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 4000000 steps (8 resets) in 90676 ms. (44 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1214 ms. (329 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1519 ms. (263 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1321 ms. (302 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1155 ms. (346 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1416 ms. (282 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1056 ms. (378 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1531 ms. (261 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1477 ms. (270 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1282 ms. (311 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1120 ms. (356 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1448 ms. (276 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1262 ms. (316 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1550 ms. (257 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1578 ms. (253 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1640 ms. (243 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1429 ms. (279 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1580 ms. (253 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1306 ms. (306 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 3532221 steps, run timeout after 111001 ms. (steps per millisecond=31 ) properties seen :0 out of 18
Probabilistic random walk after 3532221 steps, saw 1941238 distinct states, run finished after 111002 ms. (steps per millisecond=31 ) properties seen :0
[2024-06-01 08:47:11] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:47:11] [INFO ] Invariant cache hit.
[2024-06-01 08:47:11] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 318/336 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 12/348 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 612/960 variables, 348/366 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/960 variables, 102/468 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/960 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 82/1042 variables, 10/478 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1042 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1042 variables, 70/549 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1042 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 104/1146 variables, 48/597 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1146 variables, 36/633 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1146 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 176/1322 variables, 8/641 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1322 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 8/1330 variables, 4/645 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1330 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 19 (OVERLAPS) 280/1610 variables, 184/829 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 228/1057 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 18 unsolved in 6092 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 318/336 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 12/348 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 08:47:18] [INFO ] Deduced a trap composed of 7 places in 540 ms of which 6 ms to minimize.
[2024-06-01 08:47:19] [INFO ] Deduced a trap composed of 5 places in 561 ms of which 5 ms to minimize.
[2024-06-01 08:47:19] [INFO ] Deduced a trap composed of 13 places in 445 ms of which 5 ms to minimize.
[2024-06-01 08:47:20] [INFO ] Deduced a trap composed of 13 places in 279 ms of which 3 ms to minimize.
[2024-06-01 08:47:20] [INFO ] Deduced a trap composed of 88 places in 357 ms of which 4 ms to minimize.
[2024-06-01 08:47:20] [INFO ] Deduced a trap composed of 42 places in 356 ms of which 4 ms to minimize.
[2024-06-01 08:47:21] [INFO ] Deduced a trap composed of 45 places in 365 ms of which 4 ms to minimize.
[2024-06-01 08:47:21] [INFO ] Deduced a trap composed of 11 places in 362 ms of which 4 ms to minimize.
[2024-06-01 08:47:21] [INFO ] Deduced a trap composed of 13 places in 272 ms of which 3 ms to minimize.
[2024-06-01 08:47:22] [INFO ] Deduced a trap composed of 64 places in 189 ms of which 3 ms to minimize.
[2024-06-01 08:47:22] [INFO ] Deduced a trap composed of 27 places in 249 ms of which 3 ms to minimize.
[2024-06-01 08:47:22] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 3 ms to minimize.
[2024-06-01 08:47:22] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 3 ms to minimize.
[2024-06-01 08:47:23] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 2 ms to minimize.
[2024-06-01 08:47:23] [INFO ] Deduced a trap composed of 15 places in 265 ms of which 3 ms to minimize.
[2024-06-01 08:47:23] [INFO ] Deduced a trap composed of 28 places in 271 ms of which 3 ms to minimize.
[2024-06-01 08:47:23] [INFO ] Deduced a trap composed of 19 places in 291 ms of which 3 ms to minimize.
[2024-06-01 08:47:24] [INFO ] Deduced a trap composed of 18 places in 305 ms of which 3 ms to minimize.
[2024-06-01 08:47:24] [INFO ] Deduced a trap composed of 47 places in 282 ms of which 3 ms to minimize.
[2024-06-01 08:47:24] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 08:47:25] [INFO ] Deduced a trap composed of 27 places in 373 ms of which 4 ms to minimize.
[2024-06-01 08:47:25] [INFO ] Deduced a trap composed of 15 places in 274 ms of which 3 ms to minimize.
[2024-06-01 08:47:25] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 08:47:26] [INFO ] Deduced a trap composed of 51 places in 190 ms of which 2 ms to minimize.
[2024-06-01 08:47:26] [INFO ] Deduced a trap composed of 51 places in 197 ms of which 2 ms to minimize.
[2024-06-01 08:47:27] [INFO ] Deduced a trap composed of 51 places in 185 ms of which 2 ms to minimize.
[2024-06-01 08:47:27] [INFO ] Deduced a trap composed of 51 places in 185 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 08:47:27] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 3 ms to minimize.
[2024-06-01 08:47:28] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 2 ms to minimize.
[2024-06-01 08:47:28] [INFO ] Deduced a trap composed of 49 places in 201 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 612/960 variables, 348/396 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/960 variables, 102/498 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/960 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 82/1042 variables, 10/508 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1042 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1042 variables, 70/579 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1042 variables, 12/591 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1042 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 104/1146 variables, 48/639 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1146 variables, 36/675 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1146 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 20 (OVERLAPS) 176/1322 variables, 8/683 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1322 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 22 (OVERLAPS) 8/1330 variables, 4/687 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1330 variables, 6/693 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 08:47:36] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 3 ms to minimize.
[2024-06-01 08:47:36] [INFO ] Deduced a trap composed of 3 places in 199 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1330 variables, 2/695 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1330 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 26 (OVERLAPS) 280/1610 variables, 184/879 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1610 variables, 228/1107 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1610 variables, 0/1107 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 29 (OVERLAPS) 0/1610 variables, 0/1107 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1107 constraints, problems are : Problem set: 0 solved, 18 unsolved in 27499 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 32/32 constraints]
After SMT, in 33637ms problems are : Problem set: 0 solved, 18 unsolved
Parikh walk visited 1 properties in 4124 ms.
Support contains 17 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 165 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 4000000 steps (8 resets) in 92705 ms. (43 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1129 ms. (353 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1949 ms. (205 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1511 ms. (264 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1211 ms. (330 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1129 ms. (353 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1225 ms. (326 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1216 ms. (328 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1229 ms. (325 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1280 ms. (312 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1284 ms. (311 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1457 ms. (274 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1323 ms. (302 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1361 ms. (293 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1195 ms. (334 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1406 ms. (284 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1158 ms. (345 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1193 ms. (335 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 3313244 steps, run timeout after 111001 ms. (steps per millisecond=29 ) properties seen :0 out of 17
Probabilistic random walk after 3313244 steps, saw 1833679 distinct states, run finished after 111002 ms. (steps per millisecond=29 ) properties seen :0
[2024-06-01 08:50:18] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:50:18] [INFO ] Invariant cache hit.
[2024-06-01 08:50:18] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 319/336 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 12/348 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 612/960 variables, 348/366 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/960 variables, 102/468 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/960 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 82/1042 variables, 10/478 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1042 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1042 variables, 70/549 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1042 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 104/1146 variables, 48/597 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1146 variables, 36/633 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1146 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 176/1322 variables, 8/641 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1322 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 8/1330 variables, 4/645 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1330 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (OVERLAPS) 280/1610 variables, 184/829 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 228/1057 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 17 unsolved in 6602 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 319/336 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 12/348 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 08:50:26] [INFO ] Deduced a trap composed of 3 places in 572 ms of which 5 ms to minimize.
[2024-06-01 08:50:26] [INFO ] Deduced a trap composed of 3 places in 590 ms of which 6 ms to minimize.
[2024-06-01 08:50:27] [INFO ] Deduced a trap composed of 3 places in 498 ms of which 5 ms to minimize.
[2024-06-01 08:50:27] [INFO ] Deduced a trap composed of 92 places in 475 ms of which 5 ms to minimize.
[2024-06-01 08:50:28] [INFO ] Deduced a trap composed of 30 places in 493 ms of which 5 ms to minimize.
[2024-06-01 08:50:28] [INFO ] Deduced a trap composed of 64 places in 473 ms of which 6 ms to minimize.
[2024-06-01 08:50:29] [INFO ] Deduced a trap composed of 11 places in 491 ms of which 5 ms to minimize.
[2024-06-01 08:50:29] [INFO ] Deduced a trap composed of 3 places in 496 ms of which 6 ms to minimize.
[2024-06-01 08:50:30] [INFO ] Deduced a trap composed of 66 places in 390 ms of which 4 ms to minimize.
[2024-06-01 08:50:30] [INFO ] Deduced a trap composed of 57 places in 395 ms of which 4 ms to minimize.
[2024-06-01 08:50:30] [INFO ] Deduced a trap composed of 30 places in 375 ms of which 4 ms to minimize.
[2024-06-01 08:50:31] [INFO ] Deduced a trap composed of 39 places in 380 ms of which 4 ms to minimize.
[2024-06-01 08:50:31] [INFO ] Deduced a trap composed of 49 places in 375 ms of which 4 ms to minimize.
[2024-06-01 08:50:32] [INFO ] Deduced a trap composed of 15 places in 385 ms of which 3 ms to minimize.
[2024-06-01 08:50:32] [INFO ] Deduced a trap composed of 47 places in 267 ms of which 3 ms to minimize.
[2024-06-01 08:50:32] [INFO ] Deduced a trap composed of 3 places in 247 ms of which 3 ms to minimize.
[2024-06-01 08:50:32] [INFO ] Deduced a trap composed of 51 places in 174 ms of which 2 ms to minimize.
[2024-06-01 08:50:33] [INFO ] Deduced a trap composed of 17 places in 287 ms of which 3 ms to minimize.
[2024-06-01 08:50:33] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 2 ms to minimize.
[2024-06-01 08:50:33] [INFO ] Deduced a trap composed of 15 places in 415 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 08:50:34] [INFO ] Deduced a trap composed of 50 places in 395 ms of which 4 ms to minimize.
[2024-06-01 08:50:34] [INFO ] Deduced a trap composed of 22 places in 385 ms of which 4 ms to minimize.
[2024-06-01 08:50:35] [INFO ] Deduced a trap composed of 3 places in 385 ms of which 4 ms to minimize.
[2024-06-01 08:50:35] [INFO ] Deduced a trap composed of 13 places in 281 ms of which 4 ms to minimize.
[2024-06-01 08:50:35] [INFO ] Deduced a trap composed of 28 places in 382 ms of which 4 ms to minimize.
[2024-06-01 08:50:36] [INFO ] Deduced a trap composed of 19 places in 276 ms of which 3 ms to minimize.
[2024-06-01 08:50:36] [INFO ] Deduced a trap composed of 49 places in 285 ms of which 3 ms to minimize.
[2024-06-01 08:50:36] [INFO ] Deduced a trap composed of 51 places in 195 ms of which 2 ms to minimize.
[2024-06-01 08:50:36] [INFO ] Deduced a trap composed of 51 places in 198 ms of which 2 ms to minimize.
[2024-06-01 08:50:37] [INFO ] Deduced a trap composed of 49 places in 272 ms of which 3 ms to minimize.
[2024-06-01 08:50:37] [INFO ] Deduced a trap composed of 51 places in 189 ms of which 2 ms to minimize.
[2024-06-01 08:50:37] [INFO ] Deduced a trap composed of 51 places in 215 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 08:50:38] [INFO ] Deduced a trap composed of 23 places in 283 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 612/960 variables, 348/399 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/960 variables, 102/501 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/960 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 82/1042 variables, 10/511 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1042 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1042 variables, 70/582 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1042 variables, 12/594 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1042 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 104/1146 variables, 48/642 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1146 variables, 36/678 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 08:50:43] [INFO ] Deduced a trap composed of 19 places in 269 ms of which 3 ms to minimize.
[2024-06-01 08:50:44] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1146 variables, 2/680 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1146 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (OVERLAPS) 176/1322 variables, 8/688 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1322 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (OVERLAPS) 8/1330 variables, 4/692 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1330 variables, 5/697 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 08:50:47] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 1 ms to minimize.
[2024-06-01 08:50:47] [INFO ] Deduced a trap composed of 3 places in 289 ms of which 3 ms to minimize.
[2024-06-01 08:50:48] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1330 variables, 3/700 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1330 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 26 (OVERLAPS) 280/1610 variables, 184/884 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1610 variables, 228/1112 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1610 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 29 (OVERLAPS) 0/1610 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1112 constraints, problems are : Problem set: 0 solved, 17 unsolved in 29778 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 38/38 constraints]
After SMT, in 36425ms problems are : Problem set: 0 solved, 17 unsolved
Parikh walk visited 1 properties in 3881 ms.
Support contains 16 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 250 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 4000000 steps (8 resets) in 92061 ms. (43 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1226 ms. (326 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1320 ms. (302 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1251 ms. (319 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1118 ms. (357 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1412 ms. (283 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1167 ms. (342 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1642 ms. (243 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1422 ms. (281 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1644 ms. (243 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1173 ms. (340 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1198 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 932 ms. (428 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1252 ms. (319 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1483 ms. (269 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1614 ms. (247 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1295 ms. (308 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 3426016 steps, run timeout after 108001 ms. (steps per millisecond=31 ) properties seen :0 out of 16
Probabilistic random walk after 3426016 steps, saw 1890321 distinct states, run finished after 108001 ms. (steps per millisecond=31 ) properties seen :0
[2024-06-01 08:53:23] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:53:23] [INFO ] Invariant cache hit.
[2024-06-01 08:53:23] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 320/336 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 12/348 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 612/960 variables, 348/366 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/960 variables, 102/468 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/960 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 82/1042 variables, 10/478 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1042 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1042 variables, 70/549 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1042 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 104/1146 variables, 48/597 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1146 variables, 36/633 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1146 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 176/1322 variables, 8/641 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1322 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (OVERLAPS) 8/1330 variables, 4/645 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1330 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (OVERLAPS) 280/1610 variables, 184/829 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 228/1057 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 16 unsolved in 6451 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 320/336 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 12/348 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 08:53:30] [INFO ] Deduced a trap composed of 3 places in 652 ms of which 7 ms to minimize.
[2024-06-01 08:53:31] [INFO ] Deduced a trap composed of 3 places in 497 ms of which 5 ms to minimize.
[2024-06-01 08:53:31] [INFO ] Deduced a trap composed of 13 places in 438 ms of which 5 ms to minimize.
[2024-06-01 08:53:32] [INFO ] Deduced a trap composed of 22 places in 412 ms of which 4 ms to minimize.
[2024-06-01 08:53:32] [INFO ] Deduced a trap composed of 3 places in 364 ms of which 4 ms to minimize.
[2024-06-01 08:53:32] [INFO ] Deduced a trap composed of 43 places in 286 ms of which 3 ms to minimize.
[2024-06-01 08:53:33] [INFO ] Deduced a trap composed of 11 places in 289 ms of which 3 ms to minimize.
[2024-06-01 08:53:33] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 2 ms to minimize.
[2024-06-01 08:53:33] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 1 ms to minimize.
[2024-06-01 08:53:33] [INFO ] Deduced a trap composed of 45 places in 178 ms of which 3 ms to minimize.
[2024-06-01 08:53:34] [INFO ] Deduced a trap composed of 13 places in 285 ms of which 2 ms to minimize.
[2024-06-01 08:53:34] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 3 ms to minimize.
[2024-06-01 08:53:34] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 2 ms to minimize.
[2024-06-01 08:53:34] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2024-06-01 08:53:34] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 2 ms to minimize.
[2024-06-01 08:53:35] [INFO ] Deduced a trap composed of 49 places in 172 ms of which 2 ms to minimize.
[2024-06-01 08:53:35] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 2 ms to minimize.
[2024-06-01 08:53:35] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 3 ms to minimize.
[2024-06-01 08:53:35] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 08:53:36] [INFO ] Deduced a trap composed of 49 places in 309 ms of which 3 ms to minimize.
[2024-06-01 08:53:36] [INFO ] Deduced a trap composed of 51 places in 205 ms of which 2 ms to minimize.
[2024-06-01 08:53:36] [INFO ] Deduced a trap composed of 49 places in 278 ms of which 3 ms to minimize.
[2024-06-01 08:53:37] [INFO ] Deduced a trap composed of 51 places in 193 ms of which 2 ms to minimize.
[2024-06-01 08:53:37] [INFO ] Deduced a trap composed of 49 places in 297 ms of which 3 ms to minimize.
[2024-06-01 08:53:37] [INFO ] Deduced a trap composed of 51 places in 185 ms of which 2 ms to minimize.
[2024-06-01 08:53:37] [INFO ] Deduced a trap composed of 51 places in 195 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 612/960 variables, 348/392 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/960 variables, 102/494 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/960 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 82/1042 variables, 10/504 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1042 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1042 variables, 70/575 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1042 variables, 12/587 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 08:53:41] [INFO ] Deduced a trap composed of 25 places in 279 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1042 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1042 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 104/1146 variables, 48/636 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1146 variables, 36/672 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 08:53:43] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1146 variables, 1/673 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1146 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (OVERLAPS) 176/1322 variables, 8/681 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 08:53:46] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1322 variables, 1/682 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1322 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 23 (OVERLAPS) 8/1330 variables, 4/686 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1330 variables, 4/690 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 08:53:49] [INFO ] Deduced a trap composed of 3 places in 1189 ms of which 8 ms to minimize.
[2024-06-01 08:53:49] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1330 variables, 2/692 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1330 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 27 (OVERLAPS) 280/1610 variables, 184/876 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1610 variables, 228/1104 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1610 variables, 0/1104 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 30 (OVERLAPS) 0/1610 variables, 0/1104 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1104 constraints, problems are : Problem set: 0 solved, 16 unsolved in 27345 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 31/31 constraints]
After SMT, in 33847ms problems are : Problem set: 0 solved, 16 unsolved
Parikh walk visited 0 properties in 3983 ms.
Support contains 16 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 168 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 166 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-06-01 08:54:01] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:54:01] [INFO ] Invariant cache hit.
[2024-06-01 08:54:02] [INFO ] Implicit Places using invariants in 1317 ms returned []
[2024-06-01 08:54:02] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:54:02] [INFO ] Invariant cache hit.
[2024-06-01 08:54:03] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 08:54:09] [INFO ] Implicit Places using invariants and state equation in 6665 ms returned []
Implicit Place search using SMT with State Equation took 7996 ms to find 0 implicit places.
[2024-06-01 08:54:09] [INFO ] Redundant transitions in 516 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-06-01 08:54:09] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:54:09] [INFO ] Invariant cache hit.
[2024-06-01 08:54:09] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 33773ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 33834ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42539 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 400000 steps (8 resets) in 10399 ms. (38 steps per ms) remains 16/16 properties
Running SMT prover for 16 properties.
[2024-06-01 08:54:47] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:54:47] [INFO ] Invariant cache hit.
[2024-06-01 08:54:47] [INFO ] [Real]Absence check using 21 positive place invariants in 19 ms returned sat
[2024-06-01 08:54:47] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 9 ms returned sat
[2024-06-01 08:54:47] [INFO ] After 565ms SMT Verify possible using state equation in real domain returned unsat :0 sat :16
[2024-06-01 08:54:47] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 08:54:48] [INFO ] After 229ms SMT Verify possible using 436 Read/Feed constraints in real domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2024-06-01 08:54:49] [INFO ] After 1878ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:16
[2024-06-01 08:54:49] [INFO ] After 2677ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-06-01 08:54:49] [INFO ] [Nat]Absence check using 21 positive place invariants in 32 ms returned sat
[2024-06-01 08:54:49] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 13 ms returned sat
[2024-06-01 08:54:50] [INFO ] After 558ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2024-06-01 08:54:50] [INFO ] After 261ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2024-06-01 08:54:51] [INFO ] Deduced a trap composed of 6 places in 367 ms of which 4 ms to minimize.
[2024-06-01 08:54:51] [INFO ] Deduced a trap composed of 6 places in 301 ms of which 2 ms to minimize.
[2024-06-01 08:54:51] [INFO ] Deduced a trap composed of 3 places in 268 ms of which 4 ms to minimize.
[2024-06-01 08:54:52] [INFO ] Deduced a trap composed of 35 places in 396 ms of which 4 ms to minimize.
[2024-06-01 08:54:52] [INFO ] Deduced a trap composed of 41 places in 280 ms of which 3 ms to minimize.
[2024-06-01 08:54:53] [INFO ] Deduced a trap composed of 35 places in 492 ms of which 4 ms to minimize.
[2024-06-01 08:54:53] [INFO ] Deduced a trap composed of 46 places in 470 ms of which 4 ms to minimize.
[2024-06-01 08:54:53] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2024-06-01 08:54:54] [INFO ] Deduced a trap composed of 51 places in 520 ms of which 5 ms to minimize.
[2024-06-01 08:54:55] [INFO ] Deduced a trap composed of 11 places in 607 ms of which 5 ms to minimize.
[2024-06-01 08:54:55] [INFO ] Deduced a trap composed of 43 places in 605 ms of which 5 ms to minimize.
[2024-06-01 08:54:56] [INFO ] Deduced a trap composed of 3 places in 483 ms of which 5 ms to minimize.
[2024-06-01 08:54:56] [INFO ] Deduced a trap composed of 39 places in 338 ms of which 3 ms to minimize.
[2024-06-01 08:54:57] [INFO ] Deduced a trap composed of 48 places in 379 ms of which 4 ms to minimize.
[2024-06-01 08:54:57] [INFO ] Deduced a trap composed of 55 places in 292 ms of which 4 ms to minimize.
[2024-06-01 08:54:57] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 6940 ms
[2024-06-01 08:54:57] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 2 ms to minimize.
[2024-06-01 08:54:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2024-06-01 08:54:58] [INFO ] Deduced a trap composed of 3 places in 277 ms of which 3 ms to minimize.
[2024-06-01 08:54:58] [INFO ] Deduced a trap composed of 18 places in 344 ms of which 3 ms to minimize.
[2024-06-01 08:54:58] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 2 ms to minimize.
[2024-06-01 08:54:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 979 ms
[2024-06-01 08:54:59] [INFO ] Deduced a trap composed of 3 places in 238 ms of which 2 ms to minimize.
[2024-06-01 08:54:59] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 2 ms to minimize.
[2024-06-01 08:54:59] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-06-01 08:54:59] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-06-01 08:54:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 884 ms
[2024-06-01 08:55:00] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 1 ms to minimize.
[2024-06-01 08:55:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2024-06-01 08:55:00] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-06-01 08:55:00] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 1 ms to minimize.
[2024-06-01 08:55:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 317 ms
[2024-06-01 08:55:00] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 2 ms to minimize.
[2024-06-01 08:55:01] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 2 ms to minimize.
[2024-06-01 08:55:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 469 ms
[2024-06-01 08:55:01] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 2 ms to minimize.
[2024-06-01 08:55:01] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2024-06-01 08:55:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 340 ms
TRAPS : Iteration 1
[2024-06-01 08:55:02] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 3 ms to minimize.
[2024-06-01 08:55:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2024-06-01 08:55:02] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 2 ms to minimize.
[2024-06-01 08:55:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2024-06-01 08:55:03] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 1 ms to minimize.
[2024-06-01 08:55:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2024-06-01 08:55:03] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-06-01 08:55:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2024-06-01 08:55:03] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2024-06-01 08:55:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2024-06-01 08:55:04] [INFO ] Deduced a trap composed of 51 places in 113 ms of which 2 ms to minimize.
[2024-06-01 08:55:04] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 1 ms to minimize.
[2024-06-01 08:55:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 355 ms
TRAPS : Iteration 2
[2024-06-01 08:55:05] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
[2024-06-01 08:55:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2024-06-01 08:55:05] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 2 ms to minimize.
[2024-06-01 08:55:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2024-06-01 08:55:05] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 2 ms to minimize.
[2024-06-01 08:55:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
TRAPS : Iteration 3
[2024-06-01 08:55:06] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2024-06-01 08:55:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2024-06-01 08:55:08] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 2 ms to minimize.
[2024-06-01 08:55:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
TRAPS : Iteration 4
[2024-06-01 08:55:08] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 2 ms to minimize.
[2024-06-01 08:55:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2024-06-01 08:55:09] [INFO ] Deduced a trap composed of 105 places in 594 ms of which 5 ms to minimize.
[2024-06-01 08:55:10] [INFO ] Deduced a trap composed of 118 places in 537 ms of which 5 ms to minimize.
[2024-06-01 08:55:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1282 ms
[2024-06-01 08:55:10] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 2 ms to minimize.
[2024-06-01 08:55:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
TRAPS : Iteration 5
[2024-06-01 08:55:12] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-06-01 08:55:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
TRAPS : Iteration 6
[2024-06-01 08:55:13] [INFO ] After 23406ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
[2024-06-01 08:55:14] [INFO ] After 24432ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
RANDOM walk for 3879815 steps (8 resets) in 102072 ms. (38 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1371 ms. (291 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1260 ms. (317 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1731 ms. (230 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1187 ms. (336 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1299 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1153 ms. (346 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1305 ms. (306 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1568 ms. (254 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1198 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1245 ms. (321 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1172 ms. (341 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1099 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1083 ms. (369 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1202 ms. (332 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1506 ms. (265 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1367 ms. (292 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 3572855 steps, run timeout after 111001 ms. (steps per millisecond=32 ) properties seen :0 out of 16
Probabilistic random walk after 3572855 steps, saw 1962182 distinct states, run finished after 111002 ms. (steps per millisecond=32 ) properties seen :0
[2024-06-01 08:57:42] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:57:42] [INFO ] Invariant cache hit.
[2024-06-01 08:57:42] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 320/336 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 12/348 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 612/960 variables, 348/366 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/960 variables, 102/468 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/960 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 82/1042 variables, 10/478 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1042 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1042 variables, 70/549 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1042 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 104/1146 variables, 48/597 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1146 variables, 36/633 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1146 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 176/1322 variables, 8/641 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1322 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (OVERLAPS) 8/1330 variables, 4/645 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1330 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (OVERLAPS) 280/1610 variables, 184/829 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 228/1057 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 16 unsolved in 6283 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 320/336 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 12/348 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 08:57:50] [INFO ] Deduced a trap composed of 3 places in 607 ms of which 6 ms to minimize.
[2024-06-01 08:57:50] [INFO ] Deduced a trap composed of 3 places in 470 ms of which 5 ms to minimize.
[2024-06-01 08:57:51] [INFO ] Deduced a trap composed of 13 places in 450 ms of which 5 ms to minimize.
[2024-06-01 08:57:51] [INFO ] Deduced a trap composed of 22 places in 366 ms of which 4 ms to minimize.
[2024-06-01 08:57:52] [INFO ] Deduced a trap composed of 3 places in 356 ms of which 4 ms to minimize.
[2024-06-01 08:57:52] [INFO ] Deduced a trap composed of 43 places in 266 ms of which 3 ms to minimize.
[2024-06-01 08:57:52] [INFO ] Deduced a trap composed of 11 places in 262 ms of which 4 ms to minimize.
[2024-06-01 08:57:52] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 2 ms to minimize.
[2024-06-01 08:57:52] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 1 ms to minimize.
[2024-06-01 08:57:53] [INFO ] Deduced a trap composed of 45 places in 172 ms of which 2 ms to minimize.
[2024-06-01 08:57:53] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 2 ms to minimize.
[2024-06-01 08:57:53] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 3 ms to minimize.
[2024-06-01 08:57:53] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 2 ms to minimize.
[2024-06-01 08:57:53] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2024-06-01 08:57:54] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 2 ms to minimize.
[2024-06-01 08:57:54] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 2 ms to minimize.
[2024-06-01 08:57:54] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 2 ms to minimize.
[2024-06-01 08:57:54] [INFO ] Deduced a trap composed of 51 places in 171 ms of which 2 ms to minimize.
[2024-06-01 08:57:55] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 08:57:55] [INFO ] Deduced a trap composed of 49 places in 288 ms of which 3 ms to minimize.
[2024-06-01 08:57:55] [INFO ] Deduced a trap composed of 51 places in 183 ms of which 2 ms to minimize.
[2024-06-01 08:57:56] [INFO ] Deduced a trap composed of 49 places in 283 ms of which 3 ms to minimize.
[2024-06-01 08:57:56] [INFO ] Deduced a trap composed of 51 places in 200 ms of which 3 ms to minimize.
[2024-06-01 08:57:56] [INFO ] Deduced a trap composed of 49 places in 279 ms of which 3 ms to minimize.
[2024-06-01 08:57:56] [INFO ] Deduced a trap composed of 51 places in 196 ms of which 3 ms to minimize.
[2024-06-01 08:57:57] [INFO ] Deduced a trap composed of 51 places in 193 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 612/960 variables, 348/392 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/960 variables, 102/494 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/960 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 82/1042 variables, 10/504 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1042 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1042 variables, 70/575 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1042 variables, 12/587 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 08:58:00] [INFO ] Deduced a trap composed of 21 places in 388 ms of which 3 ms to minimize.
[2024-06-01 08:58:01] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1042 variables, 2/589 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1042 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 104/1146 variables, 48/637 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1146 variables, 36/673 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1146 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (OVERLAPS) 176/1322 variables, 8/681 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 08:58:04] [INFO ] Deduced a trap composed of 82 places in 977 ms of which 8 ms to minimize.
[2024-06-01 08:58:05] [INFO ] Deduced a trap composed of 93 places in 902 ms of which 8 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1322 variables, 2/683 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 08:58:08] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 2 ms to minimize.
[2024-06-01 08:58:09] [INFO ] Deduced a trap composed of 87 places in 1017 ms of which 9 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1322 variables, 2/685 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 08:58:12] [INFO ] Deduced a trap composed of 20 places in 1053 ms of which 8 ms to minimize.
[2024-06-01 08:58:13] [INFO ] Deduced a trap composed of 21 places in 989 ms of which 8 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1322 variables, 2/687 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 08:58:14] [INFO ] Deduced a trap composed of 103 places in 882 ms of which 7 ms to minimize.
[2024-06-01 08:58:15] [INFO ] Deduced a trap composed of 92 places in 897 ms of which 8 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1322 variables, 2/689 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1322 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 25 (OVERLAPS) 8/1330 variables, 4/693 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1330 variables, 4/697 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 08:58:19] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2024-06-01 08:58:19] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 3 ms to minimize.
[2024-06-01 08:58:19] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 2 ms to minimize.
[2024-06-01 08:58:20] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 2 ms to minimize.
[2024-06-01 08:58:20] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 1 ms to minimize.
[2024-06-01 08:58:20] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 2 ms to minimize.
[2024-06-01 08:58:21] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 2 ms to minimize.
[2024-06-01 08:58:21] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1330 variables, 8/705 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1330 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 29 (OVERLAPS) 280/1610 variables, 184/889 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1610 variables, 228/1117 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1610 variables, 0/1117 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 32 (OVERLAPS) 0/1610 variables, 0/1117 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1117 constraints, problems are : Problem set: 0 solved, 16 unsolved in 36654 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 44/44 constraints]
After SMT, in 43021ms problems are : Problem set: 0 solved, 16 unsolved
Parikh walk visited 0 properties in 2999 ms.
Support contains 16 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 168 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 162 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-06-01 08:58:29] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:58:29] [INFO ] Invariant cache hit.
[2024-06-01 08:58:30] [INFO ] Implicit Places using invariants in 1151 ms returned []
[2024-06-01 08:58:30] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:58:30] [INFO ] Invariant cache hit.
[2024-06-01 08:58:30] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 08:58:36] [INFO ] Implicit Places using invariants and state equation in 5793 ms returned []
Implicit Place search using SMT with State Equation took 6963 ms to find 0 implicit places.
[2024-06-01 08:58:36] [INFO ] Redundant transitions in 364 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-06-01 08:58:36] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:58:36] [INFO ] Invariant cache hit.
[2024-06-01 08:58:36] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 33842ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 33891ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41396 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 400000 steps (8 resets) in 9431 ms. (42 steps per ms) remains 16/16 properties
Running SMT prover for 16 properties.
[2024-06-01 08:59:13] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:59:13] [INFO ] Invariant cache hit.
[2024-06-01 08:59:14] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned sat
[2024-06-01 08:59:14] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2024-06-01 08:59:14] [INFO ] After 473ms SMT Verify possible using state equation in real domain returned unsat :0 sat :16
[2024-06-01 08:59:14] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 08:59:14] [INFO ] After 291ms SMT Verify possible using 436 Read/Feed constraints in real domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2024-06-01 08:59:16] [INFO ] After 1667ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:16
[2024-06-01 08:59:16] [INFO ] After 2308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-06-01 08:59:16] [INFO ] [Nat]Absence check using 21 positive place invariants in 17 ms returned sat
[2024-06-01 08:59:16] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 9 ms returned sat
[2024-06-01 08:59:16] [INFO ] After 488ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2024-06-01 08:59:17] [INFO ] After 294ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2024-06-01 08:59:17] [INFO ] Deduced a trap composed of 6 places in 380 ms of which 3 ms to minimize.
[2024-06-01 08:59:18] [INFO ] Deduced a trap composed of 6 places in 295 ms of which 3 ms to minimize.
[2024-06-01 08:59:18] [INFO ] Deduced a trap composed of 3 places in 298 ms of which 3 ms to minimize.
[2024-06-01 08:59:18] [INFO ] Deduced a trap composed of 35 places in 424 ms of which 4 ms to minimize.
[2024-06-01 08:59:19] [INFO ] Deduced a trap composed of 41 places in 292 ms of which 3 ms to minimize.
[2024-06-01 08:59:19] [INFO ] Deduced a trap composed of 35 places in 377 ms of which 4 ms to minimize.
[2024-06-01 08:59:20] [INFO ] Deduced a trap composed of 46 places in 366 ms of which 3 ms to minimize.
[2024-06-01 08:59:20] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:59:20] [INFO ] Deduced a trap composed of 51 places in 467 ms of which 5 ms to minimize.
[2024-06-01 08:59:21] [INFO ] Deduced a trap composed of 11 places in 364 ms of which 3 ms to minimize.
[2024-06-01 08:59:21] [INFO ] Deduced a trap composed of 43 places in 430 ms of which 5 ms to minimize.
[2024-06-01 08:59:22] [INFO ] Deduced a trap composed of 3 places in 342 ms of which 3 ms to minimize.
[2024-06-01 08:59:22] [INFO ] Deduced a trap composed of 39 places in 229 ms of which 3 ms to minimize.
[2024-06-01 08:59:22] [INFO ] Deduced a trap composed of 48 places in 332 ms of which 4 ms to minimize.
[2024-06-01 08:59:23] [INFO ] Deduced a trap composed of 55 places in 259 ms of which 2 ms to minimize.
[2024-06-01 08:59:23] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 5832 ms
[2024-06-01 08:59:23] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 2 ms to minimize.
[2024-06-01 08:59:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2024-06-01 08:59:23] [INFO ] Deduced a trap composed of 3 places in 298 ms of which 3 ms to minimize.
[2024-06-01 08:59:24] [INFO ] Deduced a trap composed of 18 places in 276 ms of which 2 ms to minimize.
[2024-06-01 08:59:24] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 1 ms to minimize.
[2024-06-01 08:59:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 918 ms
[2024-06-01 08:59:24] [INFO ] Deduced a trap composed of 3 places in 246 ms of which 3 ms to minimize.
[2024-06-01 08:59:24] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 2 ms to minimize.
[2024-06-01 08:59:25] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 2 ms to minimize.
[2024-06-01 08:59:25] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2024-06-01 08:59:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 964 ms
[2024-06-01 08:59:25] [INFO ] Deduced a trap composed of 47 places in 199 ms of which 2 ms to minimize.
[2024-06-01 08:59:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2024-06-01 08:59:25] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2024-06-01 08:59:26] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 1 ms to minimize.
[2024-06-01 08:59:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 367 ms
[2024-06-01 08:59:26] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 3 ms to minimize.
[2024-06-01 08:59:26] [INFO ] Deduced a trap composed of 13 places in 257 ms of which 3 ms to minimize.
[2024-06-01 08:59:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 673 ms
[2024-06-01 08:59:27] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 1 ms to minimize.
[2024-06-01 08:59:27] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 1 ms to minimize.
[2024-06-01 08:59:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 399 ms
TRAPS : Iteration 1
[2024-06-01 08:59:28] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 2 ms to minimize.
[2024-06-01 08:59:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2024-06-01 08:59:28] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 1 ms to minimize.
[2024-06-01 08:59:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2024-06-01 08:59:28] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 2 ms to minimize.
[2024-06-01 08:59:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2024-06-01 08:59:29] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2024-06-01 08:59:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2024-06-01 08:59:29] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2024-06-01 08:59:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2024-06-01 08:59:30] [INFO ] Deduced a trap composed of 51 places in 177 ms of which 1 ms to minimize.
[2024-06-01 08:59:30] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 1 ms to minimize.
[2024-06-01 08:59:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 522 ms
TRAPS : Iteration 2
[2024-06-01 08:59:31] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 1 ms to minimize.
[2024-06-01 08:59:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2024-06-01 08:59:31] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 2 ms to minimize.
[2024-06-01 08:59:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2024-06-01 08:59:32] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 1 ms to minimize.
[2024-06-01 08:59:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
TRAPS : Iteration 3
[2024-06-01 08:59:33] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 1 ms to minimize.
[2024-06-01 08:59:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2024-06-01 08:59:34] [INFO ] Deduced a trap composed of 21 places in 246 ms of which 2 ms to minimize.
[2024-06-01 08:59:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 379 ms
TRAPS : Iteration 4
[2024-06-01 08:59:35] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 2 ms to minimize.
[2024-06-01 08:59:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2024-06-01 08:59:37] [INFO ] Deduced a trap composed of 105 places in 968 ms of which 7 ms to minimize.
[2024-06-01 08:59:37] [INFO ] Deduced a trap composed of 118 places in 610 ms of which 5 ms to minimize.
[2024-06-01 08:59:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1777 ms
[2024-06-01 08:59:38] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 1 ms to minimize.
[2024-06-01 08:59:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
TRAPS : Iteration 5
[2024-06-01 08:59:40] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 1 ms to minimize.
[2024-06-01 08:59:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
TRAPS : Iteration 6
[2024-06-01 08:59:41] [INFO ] After 24842ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
[2024-06-01 08:59:42] [INFO ] After 25731ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
RANDOM walk for 40000 steps (8 resets) in 238 ms. (167 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 278157 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 1
Probabilistic random walk after 278157 steps, saw 188872 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
[2024-06-01 08:59:45] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:59:45] [INFO ] Invariant cache hit.
[2024-06-01 08:59:45] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:59:46] [INFO ] Deduced a trap composed of 3 places in 936 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:59:47] [INFO ] Deduced a trap composed of 24 places in 750 ms of which 5 ms to minimize.
[2024-06-01 08:59:48] [INFO ] Deduced a trap composed of 23 places in 677 ms of which 6 ms to minimize.
[2024-06-01 08:59:49] [INFO ] Deduced a trap composed of 21 places in 656 ms of which 5 ms to minimize.
[2024-06-01 08:59:50] [INFO ] Deduced a trap composed of 36 places in 759 ms of which 5 ms to minimize.
[2024-06-01 08:59:50] [INFO ] Deduced a trap composed of 15 places in 772 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/1610 variables, and 261 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5005 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 176/590 constraints, ReadFeed: 47/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 5714ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 173 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 217 ms. (183 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
Interrupted probabilistic random walk after 270754 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 1
Probabilistic random walk after 270754 steps, saw 184055 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
[2024-06-01 08:59:54] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:59:54] [INFO ] Invariant cache hit.
[2024-06-01 08:59:54] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 627 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:59:54] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:59:55] [INFO ] Deduced a trap composed of 24 places in 687 ms of which 5 ms to minimize.
[2024-06-01 08:59:56] [INFO ] Deduced a trap composed of 23 places in 742 ms of which 5 ms to minimize.
[2024-06-01 08:59:57] [INFO ] Deduced a trap composed of 21 places in 761 ms of which 5 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 36 places in 702 ms of which 5 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 15 places in 635 ms of which 5 ms to minimize.
[2024-06-01 08:59:59] [INFO ] Deduced a trap composed of 33 places in 717 ms of which 5 ms to minimize.
[2024-06-01 09:00:00] [INFO ] Deduced a trap composed of 21 places in 620 ms of which 5 ms to minimize.
[2024-06-01 09:00:00] [INFO ] Deduced a trap composed of 11 places in 749 ms of which 5 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 8/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/980 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 630/1610 variables, 414/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 389/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:00:01] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 1/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1610 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1610 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1068 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7012 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 7661ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 13853 steps, including 225 resets, run visited all 1 properties in 78 ms. (steps per millisecond=177 )
Parikh walk visited 1 properties in 85 ms.
RANDOM walk for 40000 steps (8 resets) in 397 ms. (100 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 254881 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 1
Probabilistic random walk after 254881 steps, saw 174291 distinct states, run finished after 3002 ms. (steps per millisecond=84 ) properties seen :0
[2024-06-01 09:00:05] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:00:05] [INFO ] Invariant cache hit.
[2024-06-01 09:00:05] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 847 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:00:06] [INFO ] Deduced a trap composed of 3 places in 660 ms of which 4 ms to minimize.
[2024-06-01 09:00:07] [INFO ] Deduced a trap composed of 3 places in 503 ms of which 7 ms to minimize.
[2024-06-01 09:00:08] [INFO ] Deduced a trap composed of 33 places in 585 ms of which 5 ms to minimize.
[2024-06-01 09:00:08] [INFO ] Deduced a trap composed of 3 places in 496 ms of which 5 ms to minimize.
[2024-06-01 09:00:09] [INFO ] Deduced a trap composed of 19 places in 412 ms of which 4 ms to minimize.
[2024-06-01 09:00:09] [INFO ] Deduced a trap composed of 43 places in 487 ms of which 6 ms to minimize.
[2024-06-01 09:00:10] [INFO ] Deduced a trap composed of 25 places in 502 ms of which 4 ms to minimize.
[2024-06-01 09:00:10] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2024-06-01 09:00:10] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 3 ms to minimize.
[2024-06-01 09:00:10] [INFO ] Deduced a trap composed of 31 places in 269 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 10/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5877ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 164 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 144 ms. (275 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 264924 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 264924 steps, saw 180164 distinct states, run finished after 3007 ms. (steps per millisecond=88 ) properties seen :0
[2024-06-01 09:00:14] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:00:14] [INFO ] Invariant cache hit.
[2024-06-01 09:00:14] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 836 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:00:16] [INFO ] Deduced a trap composed of 3 places in 578 ms of which 7 ms to minimize.
[2024-06-01 09:00:16] [INFO ] Deduced a trap composed of 3 places in 695 ms of which 6 ms to minimize.
[2024-06-01 09:00:17] [INFO ] Deduced a trap composed of 33 places in 613 ms of which 6 ms to minimize.
[2024-06-01 09:00:17] [INFO ] Deduced a trap composed of 3 places in 465 ms of which 5 ms to minimize.
[2024-06-01 09:00:18] [INFO ] Deduced a trap composed of 19 places in 405 ms of which 4 ms to minimize.
[2024-06-01 09:00:18] [INFO ] Deduced a trap composed of 43 places in 561 ms of which 4 ms to minimize.
[2024-06-01 09:00:19] [INFO ] Deduced a trap composed of 25 places in 435 ms of which 4 ms to minimize.
[2024-06-01 09:00:19] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2024-06-01 09:00:19] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 2 ms to minimize.
[2024-06-01 09:00:19] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 10/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1068 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5331 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 6200ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 55 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=27 )
Parikh walk visited 1 properties in 3 ms.
RANDOM walk for 40000 steps (8 resets) in 346 ms. (115 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 279939 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 1
Probabilistic random walk after 279939 steps, saw 189989 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
[2024-06-01 09:00:23] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:00:23] [INFO ] Invariant cache hit.
[2024-06-01 09:00:23] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 641 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:00:25] [INFO ] Deduced a trap composed of 6 places in 484 ms of which 4 ms to minimize.
[2024-06-01 09:00:25] [INFO ] Deduced a trap composed of 3 places in 351 ms of which 4 ms to minimize.
[2024-06-01 09:00:25] [INFO ] Deduced a trap composed of 22 places in 298 ms of which 3 ms to minimize.
[2024-06-01 09:00:25] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 2 ms to minimize.
[2024-06-01 09:00:26] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 5/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:00:26] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 1/1064 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1064 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1064 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1064 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2698 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 3361ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 85 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=85 )
Parikh walk visited 1 properties in 1 ms.
RANDOM walk for 40000 steps (8 resets) in 267 ms. (149 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 287265 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 1
Probabilistic random walk after 287265 steps, saw 194072 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
[2024-06-01 09:00:30] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:00:30] [INFO ] Invariant cache hit.
[2024-06-01 09:00:30] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 36/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 388/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 821 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 36/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:00:31] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 7 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 388/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:00:32] [INFO ] Deduced a trap composed of 3 places in 358 ms of which 3 ms to minimize.
[2024-06-01 09:00:32] [INFO ] Deduced a trap composed of 3 places in 313 ms of which 4 ms to minimize.
[2024-06-01 09:00:32] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 3/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1062 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2273 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 3148ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 174 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 268 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 275 ms. (144 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 261943 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 1
Probabilistic random walk after 261943 steps, saw 178215 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
[2024-06-01 09:00:36] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:00:36] [INFO ] Invariant cache hit.
[2024-06-01 09:00:36] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 36/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 388/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 945 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 36/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:00:38] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 388/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:00:39] [INFO ] Deduced a trap composed of 3 places in 389 ms of which 4 ms to minimize.
[2024-06-01 09:00:39] [INFO ] Deduced a trap composed of 3 places in 296 ms of which 3 ms to minimize.
[2024-06-01 09:00:39] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 3/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1062 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2482 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 3448ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 142 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 258 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 261 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-06-01 09:00:40] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:00:40] [INFO ] Invariant cache hit.
[2024-06-01 09:00:42] [INFO ] Implicit Places using invariants in 1471 ms returned []
[2024-06-01 09:00:42] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:00:42] [INFO ] Invariant cache hit.
[2024-06-01 09:00:43] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 09:00:48] [INFO ] Implicit Places using invariants and state equation in 5938 ms returned []
Implicit Place search using SMT with State Equation took 7415 ms to find 0 implicit places.
[2024-06-01 09:00:48] [INFO ] Redundant transitions in 309 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-06-01 09:00:48] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:00:48] [INFO ] Invariant cache hit.
[2024-06-01 09:00:48] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 33430ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 33495ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41511 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 12 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 1 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 151 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-06-01 09:01:22] [INFO ] Computed 21 invariants in 2 ms
[2024-06-01 09:01:22] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 09:01:22] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2024-06-01 09:01:22] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 09:01:22] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 09:01:22] [INFO ] After 14ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 09:01:22] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 09:01:22] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 426 ms.
RANDOM walk for 40000 steps (8 resets) in 211 ms. (188 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 260546 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 1
Probabilistic random walk after 260546 steps, saw 177312 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
[2024-06-01 09:01:25] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-06-01 09:01:25] [INFO ] Computed 31 invariants in 7 ms
[2024-06-01 09:01:25] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 389/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:01:27] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 1/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1059 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1380 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2051ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 186 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 262 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 264 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 240 ms. (165 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 263582 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 1
Probabilistic random walk after 263582 steps, saw 179187 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
[2024-06-01 09:01:31] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:01:31] [INFO ] Invariant cache hit.
[2024-06-01 09:01:31] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 889 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:01:32] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:01:33] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 2 ms to minimize.
[2024-06-01 09:01:33] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 2/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1061 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1913 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 2856ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 167 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 250 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 249 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-06-01 09:01:34] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:01:34] [INFO ] Invariant cache hit.
[2024-06-01 09:01:36] [INFO ] Implicit Places using invariants in 1558 ms returned []
[2024-06-01 09:01:36] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:01:36] [INFO ] Invariant cache hit.
[2024-06-01 09:01:37] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 09:01:43] [INFO ] Implicit Places using invariants and state equation in 7084 ms returned []
Implicit Place search using SMT with State Equation took 8654 ms to find 0 implicit places.
[2024-06-01 09:01:43] [INFO ] Redundant transitions in 313 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-06-01 09:01:43] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:01:43] [INFO ] Invariant cache hit.
[2024-06-01 09:01:43] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 34340ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 34404ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43646 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 90 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-06-01 09:02:18] [INFO ] Computed 21 invariants in 2 ms
[2024-06-01 09:02:18] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 09:02:18] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2024-06-01 09:02:18] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 09:02:18] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 09:02:18] [INFO ] After 21ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 09:02:18] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 09:02:18] [INFO ] After 218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 363 ms.
RANDOM walk for 40000 steps (8 resets) in 306 ms. (130 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 276199 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 1
Probabilistic random walk after 276199 steps, saw 187505 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
[2024-06-01 09:02:21] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-06-01 09:02:21] [INFO ] Computed 31 invariants in 8 ms
[2024-06-01 09:02:21] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 913 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:02:23] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:02:24] [INFO ] Deduced a trap composed of 3 places in 298 ms of which 3 ms to minimize.
[2024-06-01 09:02:24] [INFO ] Deduced a trap composed of 28 places in 203 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 2/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1061 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2180 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 3126ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 169 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 268 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 272 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 349 ms. (114 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 256509 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 1
Probabilistic random walk after 256509 steps, saw 175185 distinct states, run finished after 3002 ms. (steps per millisecond=85 ) properties seen :0
[2024-06-01 09:02:28] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:02:28] [INFO ] Invariant cache hit.
[2024-06-01 09:02:28] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1023 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:02:29] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:02:31] [INFO ] Deduced a trap composed of 17 places in 970 ms of which 8 ms to minimize.
[2024-06-01 09:02:32] [INFO ] Deduced a trap composed of 106 places in 954 ms of which 8 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/980 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 630/1610 variables, 414/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 389/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1061 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3400 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 4448ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 151 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 242 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 190 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-06-01 09:02:33] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:02:33] [INFO ] Invariant cache hit.
[2024-06-01 09:02:34] [INFO ] Implicit Places using invariants in 1256 ms returned []
[2024-06-01 09:02:34] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:02:34] [INFO ] Invariant cache hit.
[2024-06-01 09:02:35] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 09:02:41] [INFO ] Implicit Places using invariants and state equation in 6404 ms returned []
Implicit Place search using SMT with State Equation took 7667 ms to find 0 implicit places.
[2024-06-01 09:02:41] [INFO ] Redundant transitions in 260 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-06-01 09:02:41] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:02:41] [INFO ] Invariant cache hit.
[2024-06-01 09:02:41] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 33695ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 33735ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41873 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 2 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 1 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 38 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-06-01 09:03:15] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 09:03:15] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 09:03:15] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2024-06-01 09:03:15] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 09:03:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 09:03:15] [INFO ] After 12ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 09:03:15] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 09:03:15] [INFO ] After 153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 271 ms.
RANDOM walk for 40000 steps (8 resets) in 240 ms. (165 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
Interrupted probabilistic random walk after 283151 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 1
Probabilistic random walk after 283151 steps, saw 191816 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
[2024-06-01 09:03:18] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-06-01 09:03:18] [INFO ] Computed 31 invariants in 5 ms
[2024-06-01 09:03:18] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 659 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:03:19] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:03:20] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 1/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1171 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1867ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 88 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 145 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 220 ms. (180 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 263714 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 1
Probabilistic random walk after 263714 steps, saw 179295 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
[2024-06-01 09:03:23] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:03:23] [INFO ] Invariant cache hit.
[2024-06-01 09:03:23] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 718 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:03:24] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1059 constraints, problems are : Problem set: 0 solved, 1 unsolved in 929 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1684ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 157 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 147 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-06-01 09:03:25] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:03:25] [INFO ] Invariant cache hit.
[2024-06-01 09:03:26] [INFO ] Implicit Places using invariants in 1213 ms returned []
[2024-06-01 09:03:26] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:03:26] [INFO ] Invariant cache hit.
[2024-06-01 09:03:27] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 09:03:32] [INFO ] Implicit Places using invariants and state equation in 5407 ms returned []
Implicit Place search using SMT with State Equation took 6624 ms to find 0 implicit places.
[2024-06-01 09:03:32] [INFO ] Redundant transitions in 197 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-06-01 09:03:32] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:03:32] [INFO ] Invariant cache hit.
[2024-06-01 09:03:32] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 33932ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 33973ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40957 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 39 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-06-01 09:04:06] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 09:04:06] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 09:04:06] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2024-06-01 09:04:06] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 09:04:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 09:04:06] [INFO ] After 13ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 09:04:06] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 09:04:07] [INFO ] After 311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 449 ms.
RANDOM walk for 40000 steps (8 resets) in 572 ms. (69 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 268147 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 1
Probabilistic random walk after 268147 steps, saw 182400 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
[2024-06-01 09:04:10] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-06-01 09:04:10] [INFO ] Computed 31 invariants in 12 ms
[2024-06-01 09:04:10] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 710 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:04:11] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:04:12] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 1/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1497 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2290ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 132 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 160 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 258 ms. (154 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 266343 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 266343 steps, saw 181151 distinct states, run finished after 3010 ms. (steps per millisecond=88 ) properties seen :0
[2024-06-01 09:04:16] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:04:16] [INFO ] Invariant cache hit.
[2024-06-01 09:04:16] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 695 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:04:17] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1059 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1002 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1757ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 150 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 170 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 182 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-06-01 09:04:18] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:04:18] [INFO ] Invariant cache hit.
[2024-06-01 09:04:19] [INFO ] Implicit Places using invariants in 1217 ms returned []
[2024-06-01 09:04:19] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:04:19] [INFO ] Invariant cache hit.
[2024-06-01 09:04:20] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 09:04:25] [INFO ] Implicit Places using invariants and state equation in 5623 ms returned []
Implicit Place search using SMT with State Equation took 6866 ms to find 0 implicit places.
[2024-06-01 09:04:25] [INFO ] Redundant transitions in 193 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-06-01 09:04:25] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:04:25] [INFO ] Invariant cache hit.
[2024-06-01 09:04:25] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 34406ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 34447ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41721 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 1 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 44 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-06-01 09:04:59] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 09:04:59] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 09:04:59] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2024-06-01 09:05:00] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 09:05:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 09:05:00] [INFO ] After 11ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 09:05:00] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:05:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
TRAPS : Iteration 1
[2024-06-01 09:05:00] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 09:05:00] [INFO ] After 231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 343 ms.
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 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 251955 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 1
Probabilistic random walk after 251955 steps, saw 172808 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
[2024-06-01 09:05:03] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-06-01 09:05:03] [INFO ] Computed 31 invariants in 5 ms
[2024-06-01 09:05:03] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 389/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:05:04] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 1/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1059 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1014 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1724ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 136 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 247 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 243221 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 1
Probabilistic random walk after 243221 steps, saw 167234 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
[2024-06-01 09:05:08] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:05:08] [INFO ] Invariant cache hit.
[2024-06-01 09:05:08] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 715 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:05:09] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 2 ms to minimize.
[2024-06-01 09:05:10] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1384 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2120ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 136 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 220 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 211 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-06-01 09:05:11] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:05:11] [INFO ] Invariant cache hit.
[2024-06-01 09:05:12] [INFO ] Implicit Places using invariants in 1233 ms returned []
[2024-06-01 09:05:12] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:05:12] [INFO ] Invariant cache hit.
[2024-06-01 09:05:13] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 09:05:18] [INFO ] Implicit Places using invariants and state equation in 6120 ms returned []
Implicit Place search using SMT with State Equation took 7353 ms to find 0 implicit places.
[2024-06-01 09:05:18] [INFO ] Redundant transitions in 200 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-06-01 09:05:18] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:05:18] [INFO ] Invariant cache hit.
[2024-06-01 09:05:18] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 34091ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 34134ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41916 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 56 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-06-01 09:05:52] [INFO ] Computed 21 invariants in 2 ms
[2024-06-01 09:05:52] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 09:05:53] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2024-06-01 09:05:53] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 09:05:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 09:05:53] [INFO ] After 14ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 09:05:53] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 09:05:53] [INFO ] After 229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 346 ms.
RANDOM walk for 40000 steps (8 resets) in 233 ms. (170 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 234498 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 1
Probabilistic random walk after 234498 steps, saw 161325 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
[2024-06-01 09:05:56] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-06-01 09:05:56] [INFO ] Computed 31 invariants in 5 ms
[2024-06-01 09:05:56] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 991 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:05:58] [INFO ] Deduced a trap composed of 47 places in 189 ms of which 2 ms to minimize.
[2024-06-01 09:05:58] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:05:59] [INFO ] Deduced a trap composed of 3 places in 310 ms of which 3 ms to minimize.
[2024-06-01 09:05:59] [INFO ] Deduced a trap composed of 59 places in 204 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 2/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1062 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2367 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 3393ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 166 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 264 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 264 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 268 ms. (148 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 270292 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 1
Probabilistic random walk after 270292 steps, saw 183766 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
[2024-06-01 09:06:03] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:06:03] [INFO ] Invariant cache hit.
[2024-06-01 09:06:03] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 952 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:06:04] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:06:05] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/980 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 630/1610 variables, 414/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 389/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:06:05] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 1/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1061 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1950 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 2933ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 146 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 265 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 254 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-06-01 09:06:06] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:06:06] [INFO ] Invariant cache hit.
[2024-06-01 09:06:08] [INFO ] Implicit Places using invariants in 1753 ms returned []
[2024-06-01 09:06:08] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:06:08] [INFO ] Invariant cache hit.
[2024-06-01 09:06:09] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 09:06:15] [INFO ] Implicit Places using invariants and state equation in 6621 ms returned []
Implicit Place search using SMT with State Equation took 8380 ms to find 0 implicit places.
[2024-06-01 09:06:15] [INFO ] Redundant transitions in 182 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-06-01 09:06:15] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:06:15] [INFO ] Invariant cache hit.
[2024-06-01 09:06:15] [INFO ] State equation strengthened by 436 read => feed constraints.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-10"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is EisenbergMcGuire-PT-10, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r494-smll-171636275100128"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-10.tgz
mv EisenbergMcGuire-PT-10 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;