About the Execution of LTSMin+red for Peterson-PT-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1088.735 | 1800000.00 | 2452667.00 | 3220.60 | [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/mcc2023-input.r279-smll-167863550000394.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Peterson-PT-5, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r279-smll-167863550000394
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.3M
-rw-r--r-- 1 mcc users 139K Feb 25 22:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 565K Feb 25 22:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 124K Feb 25 22:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 584K Feb 25 22:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 64K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 201K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 48K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 166K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 161K Feb 25 22:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 668K Feb 25 22:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 189K Feb 25 22:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 841K Feb 25 22:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 535K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME Liveness
=== Now, execution of the tool begins
BK_START 1678901308125
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-PT-5
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 17:28:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2023-03-15 17:28:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 17:28:32] [INFO ] Load time of PNML (sax parser for PT used): 254 ms
[2023-03-15 17:28:32] [INFO ] Transformed 834 places.
[2023-03-15 17:28:32] [INFO ] Transformed 1242 transitions.
[2023-03-15 17:28:32] [INFO ] Found NUPN structural information;
[2023-03-15 17:28:32] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_1_3_5, IsEndLoop_2_1_5, BeginLoop_5_4_3, BeginLoop_3_4_3, BeginLoop_4_4_3, BeginLoop_4_1_5, BeginLoop_3_1_5, BeginLoop_5_1_5, BeginLoop_1_4_5, TestAlone_0_1_4, TestIdentity_1_3_3, TestIdentity_2_3_3, TestIdentity_0_0_2, TestIdentity_1_4_1, TestIdentity_4_4_1, TestIdentity_3_4_1, TestIdentity_5_3_2, TestIdentity_0_4_2, TestIdentity_1_4_2, TestIdentity_3_3_2, TestIdentity_4_3_2, TestIdentity_5_2_2]
[2023-03-15 17:28:32] [INFO ] Parsed PT model containing 834 places and 1242 transitions and 3828 arcs in 431 ms.
Built sparse matrix representations for Structural reductions in 18 ms.29137KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 143 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 144 ms. Remains : 834/834 places, 1242/1242 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 96 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 17:28:32] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2023-03-15 17:28:32] [INFO ] Computed 23 place invariants in 48 ms
[2023-03-15 17:28:33] [INFO ] Implicit Places using invariants in 813 ms returned []
[2023-03-15 17:28:33] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 17:28:33] [INFO ] Invariant cache hit.
[2023-03-15 17:28:34] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:28:34] [INFO ] Implicit Places using invariants and state equation in 1157 ms returned []
Implicit Place search using SMT with State Equation took 2031 ms to find 0 implicit places.
[2023-03-15 17:28:34] [INFO ] Redundant transitions in 94 ms returned []
[2023-03-15 17:28:34] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 17:28:34] [INFO ] Invariant cache hit.
[2023-03-15 17:28:36] [INFO ] Dead Transitions using invariants and state equation in 1560 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 3789 ms. Remains : 834/834 places, 1242/1242 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2449 ms (no deadlock found). (steps per millisecond=510 )
Random directed walk for 1250001 steps, including 0 resets, run took 2751 ms (no deadlock found). (steps per millisecond=454 )
[2023-03-15 17:28:41] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 17:28:41] [INFO ] Invariant cache hit.
[2023-03-15 17:28:42] [INFO ] [Real]Absence check using 17 positive place invariants in 42 ms returned sat
[2023-03-15 17:28:42] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 31 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 834 transition count 882
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 474 transition count 882
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 720 place count 474 transition count 702
Deduced a syphon composed of 180 places in 1 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1080 place count 294 transition count 702
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1140 place count 264 transition count 672
Applied a total of 1140 rules in 76 ms. Remains 264 /834 variables (removed 570) and now considering 672/1242 (removed 570) transitions.
[2023-03-15 17:28:42] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 264 cols
[2023-03-15 17:28:42] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-15 17:28:42] [INFO ] Implicit Places using invariants in 443 ms returned [228, 240, 241, 242, 243, 244]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 448 ms to find 6 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 258/834 places, 672/1242 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 535 ms. Remains : 258/834 places, 672/1242 transitions.
Discarding 6 transitions out of 672. Remains 666
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1201 ms. (steps per millisecond=8 ) properties (out of 666) seen :309
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 357) seen :2
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 355) seen :2
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 352) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 351) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 350) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 350) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 350) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 350) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 350) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 350) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 350) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 349) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 348) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 347) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 347) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 347) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 347) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 347) seen :2
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 345) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 344) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 343) seen :0
Running SMT prover for 343 properties.
[2023-03-15 17:28:44] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 17:28:44] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-15 17:28:47] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2023-03-15 17:29:03] [INFO ] After 19203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:343
[2023-03-15 17:29:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 17:29:19] [INFO ] After 10232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :343
[2023-03-15 17:29:19] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:29:28] [INFO ] After 8974ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :342
[2023-03-15 17:29:28] [INFO ] After 8975ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :342
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-15 17:29:28] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :342
Fused 343 Parikh solutions to 327 different solutions.
Parikh walk visited 23 properties in 6138 ms.
Support contains 212 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 17 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 620112 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=20 ) properties seen 55
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 265) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 261) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 247) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 239) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 232) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 232) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 230) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 229) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 229) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 229) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 229) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 228) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 228) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 228) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 223) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 223) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 222) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 222) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 220) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 218) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 218) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 218) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 218) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 215) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 213) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 211) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 210) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 210) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 210) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 210) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 210) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 210) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 210) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 210) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 210) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 210) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 210) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 210) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 210) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 208) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 206) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 205) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 205) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 205) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 205) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 205) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 205) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 205) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 205) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 205) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 205) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 204) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 201) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 200) seen :0
Running SMT prover for 200 properties.
[2023-03-15 17:30:14] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:30:14] [INFO ] Invariant cache hit.
[2023-03-15 17:30:15] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 17:30:23] [INFO ] After 6481ms SMT Verify possible using state equation in real domain returned unsat :0 sat :10 real:190
[2023-03-15 17:30:23] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:30:24] [INFO ] After 409ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:200
[2023-03-15 17:30:24] [INFO ] After 9972ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:200
[2023-03-15 17:30:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 17:30:31] [INFO ] After 3883ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :200
[2023-03-15 17:30:35] [INFO ] After 4109ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :200
[2023-03-15 17:30:35] [INFO ] Deduced a trap composed of 26 places in 265 ms of which 10 ms to minimize.
[2023-03-15 17:30:36] [INFO ] Deduced a trap composed of 9 places in 266 ms of which 2 ms to minimize.
[2023-03-15 17:30:36] [INFO ] Deduced a trap composed of 49 places in 282 ms of which 2 ms to minimize.
[2023-03-15 17:30:36] [INFO ] Deduced a trap composed of 10 places in 232 ms of which 1 ms to minimize.
[2023-03-15 17:30:36] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 1 ms to minimize.
[2023-03-15 17:30:37] [INFO ] Deduced a trap composed of 33 places in 250 ms of which 1 ms to minimize.
[2023-03-15 17:30:37] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 1 ms to minimize.
[2023-03-15 17:30:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2019 ms
[2023-03-15 17:30:38] [INFO ] Deduced a trap composed of 48 places in 213 ms of which 2 ms to minimize.
[2023-03-15 17:30:38] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 0 ms to minimize.
[2023-03-15 17:30:38] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 1 ms to minimize.
[2023-03-15 17:30:38] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 1 ms to minimize.
[2023-03-15 17:30:38] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2023-03-15 17:30:39] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2023-03-15 17:30:39] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2023-03-15 17:30:39] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 1 ms to minimize.
[2023-03-15 17:30:39] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 0 ms to minimize.
[2023-03-15 17:30:39] [INFO ] Deduced a trap composed of 40 places in 205 ms of which 2 ms to minimize.
[2023-03-15 17:30:39] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 1 ms to minimize.
[2023-03-15 17:30:40] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2159 ms
[2023-03-15 17:30:40] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 1 ms to minimize.
[2023-03-15 17:30:40] [INFO ] Deduced a trap composed of 45 places in 178 ms of which 0 ms to minimize.
[2023-03-15 17:30:40] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 0 ms to minimize.
[2023-03-15 17:30:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 690 ms
[2023-03-15 17:30:41] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 1 ms to minimize.
[2023-03-15 17:30:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2023-03-15 17:30:41] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 1 ms to minimize.
[2023-03-15 17:30:41] [INFO ] Deduced a trap composed of 43 places in 190 ms of which 0 ms to minimize.
[2023-03-15 17:30:41] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 2 ms to minimize.
[2023-03-15 17:30:42] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 2 ms to minimize.
[2023-03-15 17:30:42] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 1 ms to minimize.
[2023-03-15 17:30:42] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 0 ms to minimize.
[2023-03-15 17:30:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1294 ms
[2023-03-15 17:30:42] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 0 ms to minimize.
[2023-03-15 17:30:42] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 1 ms to minimize.
[2023-03-15 17:30:43] [INFO ] Deduced a trap composed of 51 places in 130 ms of which 1 ms to minimize.
[2023-03-15 17:30:43] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 1 ms to minimize.
[2023-03-15 17:30:43] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2023-03-15 17:30:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 847 ms
[2023-03-15 17:30:43] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 1 ms to minimize.
[2023-03-15 17:30:43] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 1 ms to minimize.
[2023-03-15 17:30:43] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 1 ms to minimize.
[2023-03-15 17:30:43] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 1 ms to minimize.
[2023-03-15 17:30:44] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 1 ms to minimize.
[2023-03-15 17:30:44] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 0 ms to minimize.
[2023-03-15 17:30:44] [INFO ] Deduced a trap composed of 62 places in 117 ms of which 2 ms to minimize.
[2023-03-15 17:30:44] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 1 ms to minimize.
[2023-03-15 17:30:44] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2023-03-15 17:30:44] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 0 ms to minimize.
[2023-03-15 17:30:44] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 0 ms to minimize.
[2023-03-15 17:30:45] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 1 ms to minimize.
[2023-03-15 17:30:45] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 0 ms to minimize.
[2023-03-15 17:30:45] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 1 ms to minimize.
[2023-03-15 17:30:45] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 0 ms to minimize.
[2023-03-15 17:30:45] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 1 ms to minimize.
[2023-03-15 17:30:45] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2023-03-15 17:30:45] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 0 ms to minimize.
[2023-03-15 17:30:45] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2023-03-15 17:30:45] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 1 ms to minimize.
[2023-03-15 17:30:46] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 0 ms to minimize.
[2023-03-15 17:30:46] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2718 ms
[2023-03-15 17:30:46] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2023-03-15 17:30:46] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 0 ms to minimize.
[2023-03-15 17:30:46] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 2 ms to minimize.
[2023-03-15 17:30:46] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2023-03-15 17:30:46] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
[2023-03-15 17:30:46] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2023-03-15 17:30:46] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
[2023-03-15 17:30:46] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 0 ms to minimize.
[2023-03-15 17:30:46] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 855 ms
[2023-03-15 17:30:47] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 1 ms to minimize.
[2023-03-15 17:30:47] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2023-03-15 17:30:47] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 0 ms to minimize.
[2023-03-15 17:30:47] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2023-03-15 17:30:47] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 0 ms to minimize.
[2023-03-15 17:30:47] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2023-03-15 17:30:47] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 4 ms to minimize.
[2023-03-15 17:30:47] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 0 ms to minimize.
[2023-03-15 17:30:47] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2023-03-15 17:30:48] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 0 ms to minimize.
[2023-03-15 17:30:48] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 1 ms to minimize.
[2023-03-15 17:30:48] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 0 ms to minimize.
[2023-03-15 17:30:48] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2023-03-15 17:30:48] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 0 ms to minimize.
[2023-03-15 17:30:48] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1430 ms
[2023-03-15 17:30:48] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 1 ms to minimize.
[2023-03-15 17:30:48] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 0 ms to minimize.
[2023-03-15 17:30:48] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 1 ms to minimize.
[2023-03-15 17:30:49] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 1 ms to minimize.
[2023-03-15 17:30:49] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2023-03-15 17:30:49] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
[2023-03-15 17:30:49] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 0 ms to minimize.
[2023-03-15 17:30:49] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2023-03-15 17:30:49] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2023-03-15 17:30:49] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 1 ms to minimize.
[2023-03-15 17:30:50] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 1 ms to minimize.
[2023-03-15 17:30:50] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 0 ms to minimize.
[2023-03-15 17:30:50] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 0 ms to minimize.
[2023-03-15 17:30:50] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 1 ms to minimize.
[2023-03-15 17:30:50] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 0 ms to minimize.
[2023-03-15 17:30:50] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 1 ms to minimize.
[2023-03-15 17:30:51] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 1 ms to minimize.
[2023-03-15 17:30:51] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 1 ms to minimize.
[2023-03-15 17:30:51] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2023-03-15 17:30:51] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 1 ms to minimize.
[2023-03-15 17:30:51] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 0 ms to minimize.
[2023-03-15 17:30:51] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2023-03-15 17:30:51] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 1 ms to minimize.
[2023-03-15 17:30:51] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 0 ms to minimize.
[2023-03-15 17:30:52] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2023-03-15 17:30:52] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2023-03-15 17:30:52] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 0 ms to minimize.
[2023-03-15 17:30:52] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2023-03-15 17:30:52] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 3820 ms
[2023-03-15 17:30:52] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 0 ms to minimize.
[2023-03-15 17:30:52] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 0 ms to minimize.
[2023-03-15 17:30:52] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 0 ms to minimize.
[2023-03-15 17:30:53] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 0 ms to minimize.
[2023-03-15 17:30:53] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 0 ms to minimize.
[2023-03-15 17:30:53] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 1 ms to minimize.
[2023-03-15 17:30:53] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 0 ms to minimize.
[2023-03-15 17:30:53] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2023-03-15 17:30:53] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 0 ms to minimize.
[2023-03-15 17:30:53] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1109 ms
[2023-03-15 17:30:53] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 0 ms to minimize.
[2023-03-15 17:30:53] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 0 ms to minimize.
[2023-03-15 17:30:54] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 1 ms to minimize.
[2023-03-15 17:30:54] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 1 ms to minimize.
[2023-03-15 17:30:54] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2023-03-15 17:30:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 816 ms
[2023-03-15 17:30:54] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 1 ms to minimize.
[2023-03-15 17:30:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2023-03-15 17:30:54] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 1 ms to minimize.
[2023-03-15 17:30:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-15 17:30:55] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 1 ms to minimize.
[2023-03-15 17:30:55] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2023-03-15 17:30:55] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 1 ms to minimize.
[2023-03-15 17:30:55] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 0 ms to minimize.
[2023-03-15 17:30:55] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 0 ms to minimize.
[2023-03-15 17:30:55] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 1 ms to minimize.
[2023-03-15 17:30:56] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 1 ms to minimize.
[2023-03-15 17:30:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1255 ms
[2023-03-15 17:30:56] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 1 ms to minimize.
[2023-03-15 17:30:56] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 1 ms to minimize.
[2023-03-15 17:30:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 569 ms
[2023-03-15 17:30:57] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 1 ms to minimize.
[2023-03-15 17:30:57] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 0 ms to minimize.
[2023-03-15 17:30:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 457 ms
[2023-03-15 17:30:57] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 0 ms to minimize.
[2023-03-15 17:30:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2023-03-15 17:30:58] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 1 ms to minimize.
[2023-03-15 17:30:58] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 0 ms to minimize.
[2023-03-15 17:30:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 355 ms
[2023-03-15 17:30:58] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 1 ms to minimize.
[2023-03-15 17:30:58] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 1 ms to minimize.
[2023-03-15 17:30:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 475 ms
[2023-03-15 17:30:59] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 0 ms to minimize.
[2023-03-15 17:30:59] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 0 ms to minimize.
[2023-03-15 17:30:59] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 1 ms to minimize.
[2023-03-15 17:30:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 452 ms
[2023-03-15 17:30:59] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 1 ms to minimize.
[2023-03-15 17:30:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-03-15 17:31:00] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 0 ms to minimize.
[2023-03-15 17:31:00] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 0 ms to minimize.
[2023-03-15 17:31:00] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 3 ms to minimize.
[2023-03-15 17:31:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 357 ms
[2023-03-15 17:31:00] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 1 ms to minimize.
[2023-03-15 17:31:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-15 17:31:01] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 0 ms to minimize.
[2023-03-15 17:31:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2023-03-15 17:31:01] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 0 ms to minimize.
[2023-03-15 17:31:01] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 1 ms to minimize.
[2023-03-15 17:31:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 356 ms
[2023-03-15 17:31:01] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 1 ms to minimize.
[2023-03-15 17:31:01] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 0 ms to minimize.
[2023-03-15 17:31:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 324 ms
[2023-03-15 17:31:02] [INFO ] Deduced a trap composed of 9 places in 251 ms of which 1 ms to minimize.
[2023-03-15 17:31:03] [INFO ] Deduced a trap composed of 16 places in 225 ms of which 1 ms to minimize.
[2023-03-15 17:31:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 581 ms
[2023-03-15 17:31:03] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 1 ms to minimize.
[2023-03-15 17:31:03] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 1 ms to minimize.
[2023-03-15 17:31:03] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 1 ms to minimize.
[2023-03-15 17:31:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 841 ms
[2023-03-15 17:31:04] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 1 ms to minimize.
[2023-03-15 17:31:04] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 0 ms to minimize.
[2023-03-15 17:31:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 555 ms
[2023-03-15 17:31:04] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 0 ms to minimize.
[2023-03-15 17:31:05] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 1 ms to minimize.
[2023-03-15 17:31:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 498 ms
[2023-03-15 17:31:05] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 1 ms to minimize.
[2023-03-15 17:31:06] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 1 ms to minimize.
[2023-03-15 17:31:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 289 ms
[2023-03-15 17:31:06] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 1 ms to minimize.
[2023-03-15 17:31:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 847 ms
[2023-03-15 17:31:07] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 1 ms to minimize.
[2023-03-15 17:31:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-03-15 17:31:10] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 0 ms to minimize.
[2023-03-15 17:31:10] [INFO ] Deduced a trap composed of 11 places in 243 ms of which 1 ms to minimize.
[2023-03-15 17:31:10] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2023-03-15 17:31:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 685 ms
[2023-03-15 17:31:11] [INFO ] Deduced a trap composed of 39 places in 206 ms of which 0 ms to minimize.
[2023-03-15 17:31:11] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 1 ms to minimize.
[2023-03-15 17:31:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 469 ms
[2023-03-15 17:31:11] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 0 ms to minimize.
[2023-03-15 17:31:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2023-03-15 17:31:12] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 1 ms to minimize.
[2023-03-15 17:31:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2023-03-15 17:31:13] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 1 ms to minimize.
[2023-03-15 17:31:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-15 17:31:14] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 1 ms to minimize.
[2023-03-15 17:31:14] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 1 ms to minimize.
[2023-03-15 17:31:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 502 ms
[2023-03-15 17:31:15] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 1 ms to minimize.
[2023-03-15 17:31:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2023-03-15 17:31:15] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 1 ms to minimize.
[2023-03-15 17:31:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 350 ms
[2023-03-15 17:31:16] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 1 ms to minimize.
[2023-03-15 17:31:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2023-03-15 17:31:16] [INFO ] Deduced a trap composed of 54 places in 173 ms of which 0 ms to minimize.
[2023-03-15 17:31:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-03-15 17:31:17] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 0 ms to minimize.
[2023-03-15 17:31:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
[2023-03-15 17:31:18] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 1 ms to minimize.
[2023-03-15 17:31:18] [INFO ] Deduced a trap composed of 29 places in 177 ms of which 1 ms to minimize.
[2023-03-15 17:31:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 440 ms
[2023-03-15 17:31:18] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 0 ms to minimize.
[2023-03-15 17:31:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2023-03-15 17:31:20] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 1 ms to minimize.
[2023-03-15 17:31:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2023-03-15 17:31:20] [INFO ] Deduced a trap composed of 28 places in 237 ms of which 1 ms to minimize.
[2023-03-15 17:31:20] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 0 ms to minimize.
[2023-03-15 17:31:21] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 0 ms to minimize.
[2023-03-15 17:31:21] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 1 ms to minimize.
[2023-03-15 17:31:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 999 ms
[2023-03-15 17:31:21] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 0 ms to minimize.
[2023-03-15 17:31:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2023-03-15 17:31:21] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 1 ms to minimize.
[2023-03-15 17:31:22] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 0 ms to minimize.
[2023-03-15 17:31:22] [INFO ] Deduced a trap composed of 29 places in 192 ms of which 1 ms to minimize.
[2023-03-15 17:31:22] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 1 ms to minimize.
[2023-03-15 17:31:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 928 ms
[2023-03-15 17:31:23] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 1 ms to minimize.
[2023-03-15 17:31:24] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 1 ms to minimize.
[2023-03-15 17:31:24] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 1 ms to minimize.
[2023-03-15 17:31:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 720 ms
[2023-03-15 17:31:25] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 1 ms to minimize.
[2023-03-15 17:31:25] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 1 ms to minimize.
[2023-03-15 17:31:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 457 ms
[2023-03-15 17:31:25] [INFO ] Deduced a trap composed of 54 places in 194 ms of which 1 ms to minimize.
[2023-03-15 17:31:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2023-03-15 17:31:25] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 1 ms to minimize.
[2023-03-15 17:31:26] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 1 ms to minimize.
[2023-03-15 17:31:26] [INFO ] Deduced a trap composed of 50 places in 167 ms of which 0 ms to minimize.
[2023-03-15 17:31:26] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 0 ms to minimize.
[2023-03-15 17:31:26] [INFO ] Deduced a trap composed of 49 places in 155 ms of which 0 ms to minimize.
[2023-03-15 17:31:27] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 1 ms to minimize.
[2023-03-15 17:31:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1432 ms
[2023-03-15 17:31:27] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 1 ms to minimize.
[2023-03-15 17:31:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
[2023-03-15 17:31:28] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 0 ms to minimize.
[2023-03-15 17:31:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2023-03-15 17:31:29] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 1 ms to minimize.
[2023-03-15 17:31:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2023-03-15 17:31:32] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 1 ms to minimize.
[2023-03-15 17:31:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2023-03-15 17:31:33] [INFO ] After 62120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :200
Attempting to minimize the solution found.
Minimization took 15896 ms.
[2023-03-15 17:31:49] [INFO ] After 85213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :200
Fused 200 Parikh solutions to 194 different solutions.
Parikh walk visited 0 properties in 1247 ms.
Support contains 159 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 17 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 942734 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=31 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 200) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 197) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 75938 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 197 properties.
[2023-03-15 17:33:41] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:33:41] [INFO ] Invariant cache hit.
[2023-03-15 17:33:43] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 17:33:51] [INFO ] After 9969ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:197
[2023-03-15 17:33:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 17:34:00] [INFO ] After 5657ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :197
[2023-03-15 17:34:00] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:34:06] [INFO ] After 6168ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :197
[2023-03-15 17:34:07] [INFO ] Deduced a trap composed of 31 places in 258 ms of which 1 ms to minimize.
[2023-03-15 17:34:07] [INFO ] Deduced a trap composed of 43 places in 249 ms of which 1 ms to minimize.
[2023-03-15 17:34:07] [INFO ] Deduced a trap composed of 9 places in 236 ms of which 1 ms to minimize.
[2023-03-15 17:34:07] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 0 ms to minimize.
[2023-03-15 17:34:08] [INFO ] Deduced a trap composed of 10 places in 233 ms of which 1 ms to minimize.
[2023-03-15 17:34:08] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 1 ms to minimize.
[2023-03-15 17:34:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1647 ms
[2023-03-15 17:34:08] [INFO ] Deduced a trap composed of 63 places in 229 ms of which 0 ms to minimize.
[2023-03-15 17:34:09] [INFO ] Deduced a trap composed of 46 places in 224 ms of which 1 ms to minimize.
[2023-03-15 17:34:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 548 ms
[2023-03-15 17:34:09] [INFO ] Deduced a trap composed of 10 places in 201 ms of which 1 ms to minimize.
[2023-03-15 17:34:09] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 1 ms to minimize.
[2023-03-15 17:34:09] [INFO ] Deduced a trap composed of 40 places in 197 ms of which 1 ms to minimize.
[2023-03-15 17:34:10] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 1 ms to minimize.
[2023-03-15 17:34:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 947 ms
[2023-03-15 17:34:10] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 1 ms to minimize.
[2023-03-15 17:34:10] [INFO ] Deduced a trap composed of 52 places in 181 ms of which 0 ms to minimize.
[2023-03-15 17:34:10] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 0 ms to minimize.
[2023-03-15 17:34:11] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 0 ms to minimize.
[2023-03-15 17:34:11] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 1 ms to minimize.
[2023-03-15 17:34:11] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 1 ms to minimize.
[2023-03-15 17:34:11] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 0 ms to minimize.
[2023-03-15 17:34:11] [INFO ] Deduced a trap composed of 40 places in 215 ms of which 1 ms to minimize.
[2023-03-15 17:34:12] [INFO ] Deduced a trap composed of 46 places in 193 ms of which 1 ms to minimize.
[2023-03-15 17:34:12] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 1 ms to minimize.
[2023-03-15 17:34:12] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 1 ms to minimize.
[2023-03-15 17:34:12] [INFO ] Deduced a trap composed of 25 places in 221 ms of which 1 ms to minimize.
[2023-03-15 17:34:13] [INFO ] Deduced a trap composed of 25 places in 238 ms of which 3 ms to minimize.
[2023-03-15 17:34:13] [INFO ] Deduced a trap composed of 31 places in 228 ms of which 1 ms to minimize.
[2023-03-15 17:34:13] [INFO ] Deduced a trap composed of 32 places in 204 ms of which 1 ms to minimize.
[2023-03-15 17:34:13] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 0 ms to minimize.
[2023-03-15 17:34:14] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 0 ms to minimize.
[2023-03-15 17:34:14] [INFO ] Deduced a trap composed of 49 places in 213 ms of which 0 ms to minimize.
[2023-03-15 17:34:14] [INFO ] Deduced a trap composed of 32 places in 204 ms of which 1 ms to minimize.
[2023-03-15 17:34:14] [INFO ] Deduced a trap composed of 38 places in 209 ms of which 1 ms to minimize.
[2023-03-15 17:34:15] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 1 ms to minimize.
[2023-03-15 17:34:15] [INFO ] Deduced a trap composed of 48 places in 186 ms of which 1 ms to minimize.
[2023-03-15 17:34:15] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 0 ms to minimize.
[2023-03-15 17:34:15] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 5435 ms
[2023-03-15 17:34:15] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 1 ms to minimize.
[2023-03-15 17:34:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2023-03-15 17:34:16] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 1 ms to minimize.
[2023-03-15 17:34:16] [INFO ] Deduced a trap composed of 27 places in 263 ms of which 1 ms to minimize.
[2023-03-15 17:34:16] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 1 ms to minimize.
[2023-03-15 17:34:17] [INFO ] Deduced a trap composed of 59 places in 234 ms of which 1 ms to minimize.
[2023-03-15 17:34:17] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 1 ms to minimize.
[2023-03-15 17:34:17] [INFO ] Deduced a trap composed of 27 places in 183 ms of which 1 ms to minimize.
[2023-03-15 17:34:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1553 ms
[2023-03-15 17:34:17] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 1 ms to minimize.
[2023-03-15 17:34:17] [INFO ] Deduced a trap composed of 25 places in 214 ms of which 1 ms to minimize.
[2023-03-15 17:34:18] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 0 ms to minimize.
[2023-03-15 17:34:18] [INFO ] Deduced a trap composed of 25 places in 218 ms of which 1 ms to minimize.
[2023-03-15 17:34:18] [INFO ] Deduced a trap composed of 25 places in 211 ms of which 1 ms to minimize.
[2023-03-15 17:34:18] [INFO ] Deduced a trap composed of 39 places in 250 ms of which 2 ms to minimize.
[2023-03-15 17:34:19] [INFO ] Deduced a trap composed of 16 places in 227 ms of which 0 ms to minimize.
[2023-03-15 17:34:19] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 1 ms to minimize.
[2023-03-15 17:34:19] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 1 ms to minimize.
[2023-03-15 17:34:19] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2086 ms
[2023-03-15 17:34:19] [INFO ] Deduced a trap composed of 56 places in 171 ms of which 1 ms to minimize.
[2023-03-15 17:34:20] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 0 ms to minimize.
[2023-03-15 17:34:20] [INFO ] Deduced a trap composed of 45 places in 158 ms of which 1 ms to minimize.
[2023-03-15 17:34:20] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 1 ms to minimize.
[2023-03-15 17:34:20] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 0 ms to minimize.
[2023-03-15 17:34:20] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 1 ms to minimize.
[2023-03-15 17:34:21] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 1 ms to minimize.
[2023-03-15 17:34:21] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 1 ms to minimize.
[2023-03-15 17:34:21] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 1 ms to minimize.
[2023-03-15 17:34:21] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 1 ms to minimize.
[2023-03-15 17:34:21] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 1 ms to minimize.
[2023-03-15 17:34:22] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 1 ms to minimize.
[2023-03-15 17:34:22] [INFO ] Deduced a trap composed of 32 places in 186 ms of which 1 ms to minimize.
[2023-03-15 17:34:22] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 1 ms to minimize.
[2023-03-15 17:34:22] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2996 ms
[2023-03-15 17:34:22] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 1 ms to minimize.
[2023-03-15 17:34:23] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 1 ms to minimize.
[2023-03-15 17:34:23] [INFO ] Deduced a trap composed of 40 places in 188 ms of which 1 ms to minimize.
[2023-03-15 17:34:23] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 1 ms to minimize.
[2023-03-15 17:34:23] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 1 ms to minimize.
[2023-03-15 17:34:23] [INFO ] Deduced a trap composed of 40 places in 192 ms of which 1 ms to minimize.
[2023-03-15 17:34:24] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 1 ms to minimize.
[2023-03-15 17:34:24] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 1 ms to minimize.
[2023-03-15 17:34:24] [INFO ] Deduced a trap composed of 20 places in 196 ms of which 0 ms to minimize.
[2023-03-15 17:34:24] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 1 ms to minimize.
[2023-03-15 17:34:25] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 0 ms to minimize.
[2023-03-15 17:34:25] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 0 ms to minimize.
[2023-03-15 17:34:25] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 1 ms to minimize.
[2023-03-15 17:34:26] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 1 ms to minimize.
[2023-03-15 17:34:26] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 1 ms to minimize.
[2023-03-15 17:34:26] [INFO ] Deduced a trap composed of 23 places in 223 ms of which 1 ms to minimize.
[2023-03-15 17:34:26] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 1 ms to minimize.
[2023-03-15 17:34:27] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 1 ms to minimize.
[2023-03-15 17:34:27] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 1 ms to minimize.
[2023-03-15 17:34:27] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 1 ms to minimize.
[2023-03-15 17:34:27] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4856 ms
[2023-03-15 17:34:27] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2023-03-15 17:34:27] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 1 ms to minimize.
[2023-03-15 17:34:27] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 1 ms to minimize.
[2023-03-15 17:34:28] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 1 ms to minimize.
[2023-03-15 17:34:28] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 1 ms to minimize.
[2023-03-15 17:34:29] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 1 ms to minimize.
[2023-03-15 17:34:30] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 0 ms to minimize.
[2023-03-15 17:34:30] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 1 ms to minimize.
[2023-03-15 17:34:30] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 0 ms to minimize.
[2023-03-15 17:34:30] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3117 ms
[2023-03-15 17:34:30] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 0 ms to minimize.
[2023-03-15 17:34:30] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
[2023-03-15 17:34:31] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 0 ms to minimize.
[2023-03-15 17:34:31] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 0 ms to minimize.
[2023-03-15 17:34:31] [INFO ] Deduced a trap composed of 65 places in 211 ms of which 1 ms to minimize.
[2023-03-15 17:34:31] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 1 ms to minimize.
[2023-03-15 17:34:32] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 1 ms to minimize.
[2023-03-15 17:34:32] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 1 ms to minimize.
[2023-03-15 17:34:32] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 1 ms to minimize.
[2023-03-15 17:34:32] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 1 ms to minimize.
[2023-03-15 17:34:32] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 1 ms to minimize.
[2023-03-15 17:34:33] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 1 ms to minimize.
[2023-03-15 17:34:33] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 0 ms to minimize.
[2023-03-15 17:34:33] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 1 ms to minimize.
[2023-03-15 17:34:33] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 0 ms to minimize.
[2023-03-15 17:34:33] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 0 ms to minimize.
[2023-03-15 17:34:33] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2949 ms
[2023-03-15 17:34:33] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 1 ms to minimize.
[2023-03-15 17:34:34] [INFO ] Deduced a trap composed of 27 places in 263 ms of which 1 ms to minimize.
[2023-03-15 17:34:34] [INFO ] Deduced a trap composed of 27 places in 203 ms of which 1 ms to minimize.
[2023-03-15 17:34:34] [INFO ] Deduced a trap composed of 10 places in 259 ms of which 1 ms to minimize.
[2023-03-15 17:34:35] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 1 ms to minimize.
[2023-03-15 17:34:35] [INFO ] Deduced a trap composed of 45 places in 216 ms of which 1 ms to minimize.
[2023-03-15 17:34:35] [INFO ] Deduced a trap composed of 16 places in 232 ms of which 1 ms to minimize.
[2023-03-15 17:34:35] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 1 ms to minimize.
[2023-03-15 17:34:36] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 0 ms to minimize.
[2023-03-15 17:34:36] [INFO ] Deduced a trap composed of 37 places in 221 ms of which 1 ms to minimize.
[2023-03-15 17:34:36] [INFO ] Deduced a trap composed of 38 places in 251 ms of which 1 ms to minimize.
[2023-03-15 17:34:37] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 1 ms to minimize.
[2023-03-15 17:34:37] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 0 ms to minimize.
[2023-03-15 17:34:37] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 0 ms to minimize.
[2023-03-15 17:34:37] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 1 ms to minimize.
[2023-03-15 17:34:37] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 1 ms to minimize.
[2023-03-15 17:34:37] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4061 ms
[2023-03-15 17:34:38] [INFO ] Deduced a trap composed of 16 places in 234 ms of which 0 ms to minimize.
[2023-03-15 17:34:38] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 1 ms to minimize.
[2023-03-15 17:34:38] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 1 ms to minimize.
[2023-03-15 17:34:38] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 1 ms to minimize.
[2023-03-15 17:34:38] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 1 ms to minimize.
[2023-03-15 17:34:39] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 1 ms to minimize.
[2023-03-15 17:34:39] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 1 ms to minimize.
[2023-03-15 17:34:39] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 1 ms to minimize.
[2023-03-15 17:34:39] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 0 ms to minimize.
[2023-03-15 17:34:39] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1871 ms
[2023-03-15 17:34:40] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 0 ms to minimize.
[2023-03-15 17:34:40] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 0 ms to minimize.
[2023-03-15 17:34:40] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 0 ms to minimize.
[2023-03-15 17:34:40] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 1 ms to minimize.
[2023-03-15 17:34:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 656 ms
[2023-03-15 17:34:40] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 1 ms to minimize.
[2023-03-15 17:34:41] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 0 ms to minimize.
[2023-03-15 17:34:41] [INFO ] Deduced a trap composed of 30 places in 189 ms of which 1 ms to minimize.
[2023-03-15 17:34:41] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 1 ms to minimize.
[2023-03-15 17:34:41] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 0 ms to minimize.
[2023-03-15 17:34:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1112 ms
[2023-03-15 17:34:42] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 1 ms to minimize.
[2023-03-15 17:34:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-03-15 17:34:42] [INFO ] Deduced a trap composed of 27 places in 253 ms of which 1 ms to minimize.
[2023-03-15 17:34:42] [INFO ] Deduced a trap composed of 9 places in 230 ms of which 1 ms to minimize.
[2023-03-15 17:34:43] [INFO ] Deduced a trap composed of 33 places in 212 ms of which 1 ms to minimize.
[2023-03-15 17:34:43] [INFO ] Deduced a trap composed of 59 places in 158 ms of which 1 ms to minimize.
[2023-03-15 17:34:43] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 1 ms to minimize.
[2023-03-15 17:34:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1220 ms
[2023-03-15 17:34:44] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 1 ms to minimize.
[2023-03-15 17:34:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-15 17:34:44] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 1 ms to minimize.
[2023-03-15 17:34:44] [INFO ] Deduced a trap composed of 31 places in 249 ms of which 0 ms to minimize.
[2023-03-15 17:34:44] [INFO ] Deduced a trap composed of 10 places in 223 ms of which 1 ms to minimize.
[2023-03-15 17:34:45] [INFO ] Deduced a trap composed of 24 places in 204 ms of which 1 ms to minimize.
[2023-03-15 17:34:45] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 1 ms to minimize.
[2023-03-15 17:34:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1283 ms
[2023-03-15 17:34:45] [INFO ] Deduced a trap composed of 18 places in 199 ms of which 0 ms to minimize.
[2023-03-15 17:34:45] [INFO ] Deduced a trap composed of 36 places in 207 ms of which 1 ms to minimize.
[2023-03-15 17:34:46] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 1 ms to minimize.
[2023-03-15 17:34:46] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 1 ms to minimize.
[2023-03-15 17:34:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 880 ms
[2023-03-15 17:34:47] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 1 ms to minimize.
[2023-03-15 17:34:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2023-03-15 17:34:48] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 1 ms to minimize.
[2023-03-15 17:34:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-03-15 17:34:49] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 1 ms to minimize.
[2023-03-15 17:34:49] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 1 ms to minimize.
[2023-03-15 17:34:49] [INFO ] Deduced a trap composed of 34 places in 191 ms of which 1 ms to minimize.
[2023-03-15 17:34:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 738 ms
[2023-03-15 17:34:49] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 1 ms to minimize.
[2023-03-15 17:34:50] [INFO ] Deduced a trap composed of 60 places in 208 ms of which 1 ms to minimize.
[2023-03-15 17:34:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 538 ms
[2023-03-15 17:34:50] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 0 ms to minimize.
[2023-03-15 17:34:51] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 0 ms to minimize.
[2023-03-15 17:34:51] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 2 ms to minimize.
[2023-03-15 17:34:51] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 1 ms to minimize.
[2023-03-15 17:34:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 786 ms
[2023-03-15 17:34:51] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2023-03-15 17:34:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-03-15 17:34:51] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2023-03-15 17:34:51] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2023-03-15 17:34:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 263 ms
[2023-03-15 17:34:52] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2023-03-15 17:34:52] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 1 ms to minimize.
[2023-03-15 17:34:52] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 1 ms to minimize.
[2023-03-15 17:34:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 808 ms
[2023-03-15 17:34:53] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 1 ms to minimize.
[2023-03-15 17:34:53] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 1 ms to minimize.
[2023-03-15 17:34:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 587 ms
[2023-03-15 17:34:54] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 0 ms to minimize.
[2023-03-15 17:34:54] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 0 ms to minimize.
[2023-03-15 17:34:54] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 1 ms to minimize.
[2023-03-15 17:34:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 621 ms
[2023-03-15 17:34:55] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 0 ms to minimize.
[2023-03-15 17:34:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-03-15 17:34:56] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 0 ms to minimize.
[2023-03-15 17:34:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2023-03-15 17:34:56] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 0 ms to minimize.
[2023-03-15 17:34:57] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 1 ms to minimize.
[2023-03-15 17:34:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 428 ms
[2023-03-15 17:34:57] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 1 ms to minimize.
[2023-03-15 17:34:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2023-03-15 17:34:58] [INFO ] Deduced a trap composed of 61 places in 216 ms of which 0 ms to minimize.
[2023-03-15 17:34:58] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 1 ms to minimize.
[2023-03-15 17:34:59] [INFO ] Deduced a trap composed of 29 places in 177 ms of which 1 ms to minimize.
[2023-03-15 17:34:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 728 ms
[2023-03-15 17:34:59] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 1 ms to minimize.
[2023-03-15 17:34:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-15 17:35:00] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 1 ms to minimize.
[2023-03-15 17:35:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-15 17:35:01] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 1 ms to minimize.
[2023-03-15 17:35:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2023-03-15 17:35:01] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 1 ms to minimize.
[2023-03-15 17:35:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-15 17:35:02] [INFO ] Deduced a trap composed of 54 places in 139 ms of which 1 ms to minimize.
[2023-03-15 17:35:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-15 17:35:04] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 0 ms to minimize.
[2023-03-15 17:35:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2023-03-15 17:35:06] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 1 ms to minimize.
[2023-03-15 17:35:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2023-03-15 17:35:06] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 0 ms to minimize.
[2023-03-15 17:35:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-15 17:35:07] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 1 ms to minimize.
[2023-03-15 17:35:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 298 ms
[2023-03-15 17:35:07] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 1 ms to minimize.
[2023-03-15 17:35:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-15 17:35:08] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 1 ms to minimize.
[2023-03-15 17:35:08] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 1 ms to minimize.
[2023-03-15 17:35:08] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 1 ms to minimize.
[2023-03-15 17:35:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 763 ms
[2023-03-15 17:35:09] [INFO ] Deduced a trap composed of 54 places in 217 ms of which 1 ms to minimize.
[2023-03-15 17:35:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2023-03-15 17:35:09] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 1 ms to minimize.
[2023-03-15 17:35:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2023-03-15 17:35:10] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 1 ms to minimize.
[2023-03-15 17:35:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
[2023-03-15 17:35:10] [INFO ] Deduced a trap composed of 36 places in 197 ms of which 0 ms to minimize.
[2023-03-15 17:35:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2023-03-15 17:35:11] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 1 ms to minimize.
[2023-03-15 17:35:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2023-03-15 17:35:12] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 1 ms to minimize.
[2023-03-15 17:35:12] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 1 ms to minimize.
[2023-03-15 17:35:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 488 ms
[2023-03-15 17:35:12] [INFO ] Deduced a trap composed of 39 places in 233 ms of which 1 ms to minimize.
[2023-03-15 17:35:13] [INFO ] Deduced a trap composed of 19 places in 238 ms of which 1 ms to minimize.
[2023-03-15 17:35:13] [INFO ] Deduced a trap composed of 33 places in 220 ms of which 0 ms to minimize.
[2023-03-15 17:35:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 823 ms
[2023-03-15 17:35:13] [INFO ] Deduced a trap composed of 40 places in 237 ms of which 1 ms to minimize.
[2023-03-15 17:35:14] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 1 ms to minimize.
[2023-03-15 17:35:14] [INFO ] Deduced a trap composed of 50 places in 208 ms of which 1 ms to minimize.
[2023-03-15 17:35:14] [INFO ] Deduced a trap composed of 64 places in 205 ms of which 1 ms to minimize.
[2023-03-15 17:35:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1057 ms
[2023-03-15 17:35:16] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 0 ms to minimize.
[2023-03-15 17:35:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-15 17:35:17] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 1 ms to minimize.
[2023-03-15 17:35:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-15 17:35:17] [INFO ] After 76984ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :197
Attempting to minimize the solution found.
Minimization took 14084 ms.
[2023-03-15 17:35:31] [INFO ] After 100148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :197
Parikh walk visited 0 properties in 1850 ms.
Support contains 158 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 23 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 901239 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=30 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 197) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 195) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 76458 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 195 properties.
[2023-03-15 17:37:23] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:37:23] [INFO ] Invariant cache hit.
[2023-03-15 17:37:24] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 17:37:32] [INFO ] After 6256ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7 real:188
[2023-03-15 17:37:32] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:37:33] [INFO ] After 295ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:195
[2023-03-15 17:37:33] [INFO ] After 9828ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:195
[2023-03-15 17:37:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 17:37:42] [INFO ] After 5671ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :195
[2023-03-15 17:37:48] [INFO ] After 6243ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :195
[2023-03-15 17:37:48] [INFO ] Deduced a trap composed of 12 places in 258 ms of which 1 ms to minimize.
[2023-03-15 17:37:49] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 1 ms to minimize.
[2023-03-15 17:37:49] [INFO ] Deduced a trap composed of 34 places in 220 ms of which 1 ms to minimize.
[2023-03-15 17:37:49] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 0 ms to minimize.
[2023-03-15 17:37:49] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 2 ms to minimize.
[2023-03-15 17:37:50] [INFO ] Deduced a trap composed of 9 places in 237 ms of which 0 ms to minimize.
[2023-03-15 17:37:50] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 0 ms to minimize.
[2023-03-15 17:37:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1857 ms
[2023-03-15 17:37:50] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 1 ms to minimize.
[2023-03-15 17:37:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2023-03-15 17:37:51] [INFO ] Deduced a trap composed of 18 places in 202 ms of which 0 ms to minimize.
[2023-03-15 17:37:51] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 0 ms to minimize.
[2023-03-15 17:37:51] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 1 ms to minimize.
[2023-03-15 17:37:51] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 1 ms to minimize.
[2023-03-15 17:37:51] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 1 ms to minimize.
[2023-03-15 17:37:52] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 1 ms to minimize.
[2023-03-15 17:37:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1324 ms
[2023-03-15 17:37:52] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 1 ms to minimize.
[2023-03-15 17:37:52] [INFO ] Deduced a trap composed of 35 places in 215 ms of which 1 ms to minimize.
[2023-03-15 17:37:52] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 1 ms to minimize.
[2023-03-15 17:37:53] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 0 ms to minimize.
[2023-03-15 17:37:53] [INFO ] Deduced a trap composed of 37 places in 232 ms of which 1 ms to minimize.
[2023-03-15 17:37:53] [INFO ] Deduced a trap composed of 49 places in 227 ms of which 1 ms to minimize.
[2023-03-15 17:37:53] [INFO ] Deduced a trap composed of 24 places in 215 ms of which 1 ms to minimize.
[2023-03-15 17:37:54] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 1 ms to minimize.
[2023-03-15 17:37:54] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 1 ms to minimize.
[2023-03-15 17:37:54] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 1 ms to minimize.
[2023-03-15 17:37:54] [INFO ] Deduced a trap composed of 39 places in 208 ms of which 1 ms to minimize.
[2023-03-15 17:37:55] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 1 ms to minimize.
[2023-03-15 17:37:55] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 1 ms to minimize.
[2023-03-15 17:37:55] [INFO ] Deduced a trap composed of 48 places in 208 ms of which 1 ms to minimize.
[2023-03-15 17:37:55] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 1 ms to minimize.
[2023-03-15 17:37:56] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 0 ms to minimize.
[2023-03-15 17:37:56] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 1 ms to minimize.
[2023-03-15 17:37:56] [INFO ] Deduced a trap composed of 33 places in 220 ms of which 1 ms to minimize.
[2023-03-15 17:37:56] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 1 ms to minimize.
[2023-03-15 17:37:57] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 4 ms to minimize.
[2023-03-15 17:37:57] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 1 ms to minimize.
[2023-03-15 17:37:57] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 1 ms to minimize.
[2023-03-15 17:37:57] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 5329 ms
[2023-03-15 17:37:57] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 1 ms to minimize.
[2023-03-15 17:37:58] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 1 ms to minimize.
[2023-03-15 17:37:58] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 1 ms to minimize.
[2023-03-15 17:37:58] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 0 ms to minimize.
[2023-03-15 17:37:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 742 ms
[2023-03-15 17:37:58] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 0 ms to minimize.
[2023-03-15 17:37:58] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 0 ms to minimize.
[2023-03-15 17:37:59] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 1 ms to minimize.
[2023-03-15 17:37:59] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 0 ms to minimize.
[2023-03-15 17:37:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 810 ms
[2023-03-15 17:37:59] [INFO ] Deduced a trap composed of 12 places in 223 ms of which 1 ms to minimize.
[2023-03-15 17:37:59] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 1 ms to minimize.
[2023-03-15 17:38:00] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 1 ms to minimize.
[2023-03-15 17:38:00] [INFO ] Deduced a trap composed of 25 places in 217 ms of which 1 ms to minimize.
[2023-03-15 17:38:00] [INFO ] Deduced a trap composed of 20 places in 221 ms of which 1 ms to minimize.
[2023-03-15 17:38:00] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 0 ms to minimize.
[2023-03-15 17:38:01] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 1 ms to minimize.
[2023-03-15 17:38:01] [INFO ] Deduced a trap composed of 19 places in 208 ms of which 0 ms to minimize.
[2023-03-15 17:38:01] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 1 ms to minimize.
[2023-03-15 17:38:01] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 1 ms to minimize.
[2023-03-15 17:38:01] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 0 ms to minimize.
[2023-03-15 17:38:02] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 1 ms to minimize.
[2023-03-15 17:38:02] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 1 ms to minimize.
[2023-03-15 17:38:02] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 1 ms to minimize.
[2023-03-15 17:38:02] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 1 ms to minimize.
[2023-03-15 17:38:03] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 1 ms to minimize.
[2023-03-15 17:38:03] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2023-03-15 17:38:03] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2023-03-15 17:38:03] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2023-03-15 17:38:03] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 1 ms to minimize.
[2023-03-15 17:38:03] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 1 ms to minimize.
[2023-03-15 17:38:04] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 0 ms to minimize.
[2023-03-15 17:38:04] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 1 ms to minimize.
[2023-03-15 17:38:04] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4992 ms
[2023-03-15 17:38:04] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 1 ms to minimize.
[2023-03-15 17:38:04] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 0 ms to minimize.
[2023-03-15 17:38:04] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 1 ms to minimize.
[2023-03-15 17:38:05] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 1 ms to minimize.
[2023-03-15 17:38:05] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 0 ms to minimize.
[2023-03-15 17:38:05] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 0 ms to minimize.
[2023-03-15 17:38:05] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 0 ms to minimize.
[2023-03-15 17:38:05] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2023-03-15 17:38:05] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 4 ms to minimize.
[2023-03-15 17:38:06] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 1 ms to minimize.
[2023-03-15 17:38:06] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2023-03-15 17:38:06] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1863 ms
[2023-03-15 17:38:06] [INFO ] Deduced a trap composed of 9 places in 237 ms of which 1 ms to minimize.
[2023-03-15 17:38:06] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 1 ms to minimize.
[2023-03-15 17:38:07] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 1 ms to minimize.
[2023-03-15 17:38:07] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 1 ms to minimize.
[2023-03-15 17:38:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1028 ms
[2023-03-15 17:38:07] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 1 ms to minimize.
[2023-03-15 17:38:07] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 0 ms to minimize.
[2023-03-15 17:38:08] [INFO ] Deduced a trap composed of 31 places in 228 ms of which 5 ms to minimize.
[2023-03-15 17:38:08] [INFO ] Deduced a trap composed of 17 places in 236 ms of which 1 ms to minimize.
[2023-03-15 17:38:08] [INFO ] Deduced a trap composed of 34 places in 208 ms of which 0 ms to minimize.
[2023-03-15 17:38:08] [INFO ] Deduced a trap composed of 34 places in 210 ms of which 1 ms to minimize.
[2023-03-15 17:38:09] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 1 ms to minimize.
[2023-03-15 17:38:09] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 1 ms to minimize.
[2023-03-15 17:38:09] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 1 ms to minimize.
[2023-03-15 17:38:10] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 1 ms to minimize.
[2023-03-15 17:38:10] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 0 ms to minimize.
[2023-03-15 17:38:10] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 1 ms to minimize.
[2023-03-15 17:38:10] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 1 ms to minimize.
[2023-03-15 17:38:10] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 1 ms to minimize.
[2023-03-15 17:38:11] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 1 ms to minimize.
[2023-03-15 17:38:11] [INFO ] Deduced a trap composed of 38 places in 198 ms of which 1 ms to minimize.
[2023-03-15 17:38:11] [INFO ] Deduced a trap composed of 38 places in 198 ms of which 0 ms to minimize.
[2023-03-15 17:38:11] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4313 ms
[2023-03-15 17:38:12] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 0 ms to minimize.
[2023-03-15 17:38:12] [INFO ] Deduced a trap composed of 17 places in 263 ms of which 1 ms to minimize.
[2023-03-15 17:38:12] [INFO ] Deduced a trap composed of 18 places in 244 ms of which 0 ms to minimize.
[2023-03-15 17:38:12] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 1 ms to minimize.
[2023-03-15 17:38:12] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 1 ms to minimize.
[2023-03-15 17:38:13] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 1 ms to minimize.
[2023-03-15 17:38:13] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 0 ms to minimize.
[2023-03-15 17:38:13] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2023-03-15 17:38:13] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 0 ms to minimize.
[2023-03-15 17:38:13] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 0 ms to minimize.
[2023-03-15 17:38:13] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 0 ms to minimize.
[2023-03-15 17:38:13] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2083 ms
[2023-03-15 17:38:14] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 1 ms to minimize.
[2023-03-15 17:38:14] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 1 ms to minimize.
[2023-03-15 17:38:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 492 ms
[2023-03-15 17:38:14] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2023-03-15 17:38:14] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 0 ms to minimize.
[2023-03-15 17:38:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 273 ms
[2023-03-15 17:38:14] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 0 ms to minimize.
[2023-03-15 17:38:15] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 1 ms to minimize.
[2023-03-15 17:38:15] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 1 ms to minimize.
[2023-03-15 17:38:15] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 1 ms to minimize.
[2023-03-15 17:38:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 639 ms
[2023-03-15 17:38:15] [INFO ] Deduced a trap composed of 9 places in 246 ms of which 1 ms to minimize.
[2023-03-15 17:38:16] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 0 ms to minimize.
[2023-03-15 17:38:16] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 0 ms to minimize.
[2023-03-15 17:38:16] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 0 ms to minimize.
[2023-03-15 17:38:16] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 1 ms to minimize.
[2023-03-15 17:38:16] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 1 ms to minimize.
[2023-03-15 17:38:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1405 ms
[2023-03-15 17:38:17] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 0 ms to minimize.
[2023-03-15 17:38:17] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 1 ms to minimize.
[2023-03-15 17:38:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 460 ms
[2023-03-15 17:38:18] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 1 ms to minimize.
[2023-03-15 17:38:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 383 ms
[2023-03-15 17:38:18] [INFO ] Deduced a trap composed of 12 places in 254 ms of which 1 ms to minimize.
[2023-03-15 17:38:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
[2023-03-15 17:38:19] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 1 ms to minimize.
[2023-03-15 17:38:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
[2023-03-15 17:38:19] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 1 ms to minimize.
[2023-03-15 17:38:19] [INFO ] Deduced a trap composed of 42 places in 220 ms of which 0 ms to minimize.
[2023-03-15 17:38:20] [INFO ] Deduced a trap composed of 42 places in 228 ms of which 0 ms to minimize.
[2023-03-15 17:38:20] [INFO ] Deduced a trap composed of 53 places in 219 ms of which 1 ms to minimize.
[2023-03-15 17:38:20] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 1 ms to minimize.
[2023-03-15 17:38:21] [INFO ] Deduced a trap composed of 44 places in 211 ms of which 1 ms to minimize.
[2023-03-15 17:38:21] [INFO ] Deduced a trap composed of 16 places in 203 ms of which 1 ms to minimize.
[2023-03-15 17:38:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1787 ms
[2023-03-15 17:38:21] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 1 ms to minimize.
[2023-03-15 17:38:21] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 0 ms to minimize.
[2023-03-15 17:38:22] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 1 ms to minimize.
[2023-03-15 17:38:22] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 1 ms to minimize.
[2023-03-15 17:38:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 809 ms
[2023-03-15 17:38:22] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2023-03-15 17:38:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2023-03-15 17:38:22] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 1 ms to minimize.
[2023-03-15 17:38:23] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 1 ms to minimize.
[2023-03-15 17:38:23] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 1 ms to minimize.
[2023-03-15 17:38:23] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 1 ms to minimize.
[2023-03-15 17:38:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 781 ms
[2023-03-15 17:38:23] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 1 ms to minimize.
[2023-03-15 17:38:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2023-03-15 17:38:24] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 0 ms to minimize.
[2023-03-15 17:38:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2023-03-15 17:38:25] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 0 ms to minimize.
[2023-03-15 17:38:25] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 1 ms to minimize.
[2023-03-15 17:38:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 672 ms
[2023-03-15 17:38:26] [INFO ] Deduced a trap composed of 40 places in 195 ms of which 1 ms to minimize.
[2023-03-15 17:38:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2023-03-15 17:38:26] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 1 ms to minimize.
[2023-03-15 17:38:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2023-03-15 17:38:27] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 1 ms to minimize.
[2023-03-15 17:38:27] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 1 ms to minimize.
[2023-03-15 17:38:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 349 ms
[2023-03-15 17:38:27] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 0 ms to minimize.
[2023-03-15 17:38:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2023-03-15 17:38:27] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 0 ms to minimize.
[2023-03-15 17:38:28] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 0 ms to minimize.
[2023-03-15 17:38:28] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2023-03-15 17:38:28] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 0 ms to minimize.
[2023-03-15 17:38:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 683 ms
[2023-03-15 17:38:28] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 1 ms to minimize.
[2023-03-15 17:38:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-03-15 17:38:29] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 1 ms to minimize.
[2023-03-15 17:38:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2023-03-15 17:38:29] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 0 ms to minimize.
[2023-03-15 17:38:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2023-03-15 17:38:31] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 1 ms to minimize.
[2023-03-15 17:38:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2023-03-15 17:38:32] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 1 ms to minimize.
[2023-03-15 17:38:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2023-03-15 17:38:32] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 1 ms to minimize.
[2023-03-15 17:38:33] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 0 ms to minimize.
[2023-03-15 17:38:33] [INFO ] Deduced a trap composed of 40 places in 209 ms of which 1 ms to minimize.
[2023-03-15 17:38:33] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 1 ms to minimize.
[2023-03-15 17:38:33] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 1 ms to minimize.
[2023-03-15 17:38:34] [INFO ] Deduced a trap composed of 40 places in 204 ms of which 1 ms to minimize.
[2023-03-15 17:38:34] [INFO ] Deduced a trap composed of 39 places in 207 ms of which 1 ms to minimize.
[2023-03-15 17:38:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1687 ms
[2023-03-15 17:38:34] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 0 ms to minimize.
[2023-03-15 17:38:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2023-03-15 17:38:34] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 0 ms to minimize.
[2023-03-15 17:38:35] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 0 ms to minimize.
[2023-03-15 17:38:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 516 ms
[2023-03-15 17:38:35] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 1 ms to minimize.
[2023-03-15 17:38:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-15 17:38:36] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 1 ms to minimize.
[2023-03-15 17:38:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2023-03-15 17:38:38] [INFO ] Deduced a trap composed of 54 places in 166 ms of which 1 ms to minimize.
[2023-03-15 17:38:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2023-03-15 17:38:38] [INFO ] Deduced a trap composed of 20 places in 178 ms of which 0 ms to minimize.
[2023-03-15 17:38:39] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 1 ms to minimize.
[2023-03-15 17:38:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 498 ms
[2023-03-15 17:38:39] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 0 ms to minimize.
[2023-03-15 17:38:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2023-03-15 17:38:40] [INFO ] Deduced a trap composed of 20 places in 216 ms of which 1 ms to minimize.
[2023-03-15 17:38:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2023-03-15 17:38:43] [INFO ] Deduced a trap composed of 44 places in 210 ms of which 0 ms to minimize.
[2023-03-15 17:38:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2023-03-15 17:38:44] [INFO ] Deduced a trap composed of 44 places in 212 ms of which 1 ms to minimize.
[2023-03-15 17:38:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2023-03-15 17:38:45] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 1 ms to minimize.
[2023-03-15 17:38:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-15 17:38:46] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 1 ms to minimize.
[2023-03-15 17:38:46] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 1 ms to minimize.
[2023-03-15 17:38:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 473 ms
[2023-03-15 17:38:47] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 0 ms to minimize.
[2023-03-15 17:38:47] [INFO ] Deduced a trap composed of 64 places in 169 ms of which 1 ms to minimize.
[2023-03-15 17:38:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 414 ms
[2023-03-15 17:38:48] [INFO ] Deduced a trap composed of 34 places in 177 ms of which 1 ms to minimize.
[2023-03-15 17:38:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2023-03-15 17:38:50] [INFO ] After 67786ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :195
Attempting to minimize the solution found.
Minimization took 16191 ms.
[2023-03-15 17:39:06] [INFO ] After 93030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :195
Parikh walk visited 1 properties in 2230 ms.
Support contains 157 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 28 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 906474 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=30 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 194) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 194) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 194) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 194) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 194) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 194) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 194) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 194) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 194) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 193) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 193) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 193) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 193) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 193) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 193) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 193) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 193) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 193) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 193) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 193) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 193) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 193) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 193) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 193) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 193) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 193) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 193) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 193) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 193) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 193) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 193) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 193) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 193) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 193) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 191) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 190) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 74709 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 189 properties.
[2023-03-15 17:40:59] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:40:59] [INFO ] Invariant cache hit.
[2023-03-15 17:41:01] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-15 17:41:06] [INFO ] After 3848ms SMT Verify possible using state equation in real domain returned unsat :0 sat :19 real:170
[2023-03-15 17:41:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:41:06] [INFO ] After 463ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:189
[2023-03-15 17:41:06] [INFO ] After 6737ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:189
[2023-03-15 17:41:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 17:41:14] [INFO ] After 5208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :189
[2023-03-15 17:41:20] [INFO ] After 6197ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :189
[2023-03-15 17:41:20] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 1 ms to minimize.
[2023-03-15 17:41:21] [INFO ] Deduced a trap composed of 10 places in 250 ms of which 1 ms to minimize.
[2023-03-15 17:41:21] [INFO ] Deduced a trap composed of 25 places in 251 ms of which 1 ms to minimize.
[2023-03-15 17:41:21] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 0 ms to minimize.
[2023-03-15 17:41:21] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 1 ms to minimize.
[2023-03-15 17:41:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1391 ms
[2023-03-15 17:41:22] [INFO ] Deduced a trap composed of 38 places in 217 ms of which 1 ms to minimize.
[2023-03-15 17:41:22] [INFO ] Deduced a trap composed of 18 places in 217 ms of which 1 ms to minimize.
[2023-03-15 17:41:22] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 0 ms to minimize.
[2023-03-15 17:41:23] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 1 ms to minimize.
[2023-03-15 17:41:23] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 1 ms to minimize.
[2023-03-15 17:41:23] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 1 ms to minimize.
[2023-03-15 17:41:23] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 1 ms to minimize.
[2023-03-15 17:41:23] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 1 ms to minimize.
[2023-03-15 17:41:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1865 ms
[2023-03-15 17:41:24] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 1 ms to minimize.
[2023-03-15 17:41:24] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 0 ms to minimize.
[2023-03-15 17:41:24] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 1 ms to minimize.
[2023-03-15 17:41:24] [INFO ] Deduced a trap composed of 59 places in 190 ms of which 1 ms to minimize.
[2023-03-15 17:41:25] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 1 ms to minimize.
[2023-03-15 17:41:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1153 ms
[2023-03-15 17:41:25] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 1 ms to minimize.
[2023-03-15 17:41:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2023-03-15 17:41:25] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 1 ms to minimize.
[2023-03-15 17:41:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2023-03-15 17:41:25] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 1 ms to minimize.
[2023-03-15 17:41:26] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 0 ms to minimize.
[2023-03-15 17:41:26] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 1 ms to minimize.
[2023-03-15 17:41:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 615 ms
[2023-03-15 17:41:26] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 1 ms to minimize.
[2023-03-15 17:41:26] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 1 ms to minimize.
[2023-03-15 17:41:26] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 1 ms to minimize.
[2023-03-15 17:41:27] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 0 ms to minimize.
[2023-03-15 17:41:27] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 0 ms to minimize.
[2023-03-15 17:41:27] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 0 ms to minimize.
[2023-03-15 17:41:27] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 1 ms to minimize.
[2023-03-15 17:41:27] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 1 ms to minimize.
[2023-03-15 17:41:28] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 1 ms to minimize.
[2023-03-15 17:41:28] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 0 ms to minimize.
[2023-03-15 17:41:28] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 1 ms to minimize.
[2023-03-15 17:41:28] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2200 ms
[2023-03-15 17:41:28] [INFO ] Deduced a trap composed of 27 places in 206 ms of which 0 ms to minimize.
[2023-03-15 17:41:29] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 1 ms to minimize.
[2023-03-15 17:41:29] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 1 ms to minimize.
[2023-03-15 17:41:29] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 0 ms to minimize.
[2023-03-15 17:41:29] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 1 ms to minimize.
[2023-03-15 17:41:29] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2023-03-15 17:41:29] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 0 ms to minimize.
[2023-03-15 17:41:30] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 1 ms to minimize.
[2023-03-15 17:41:30] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 0 ms to minimize.
[2023-03-15 17:41:30] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 1 ms to minimize.
[2023-03-15 17:41:30] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 1 ms to minimize.
[2023-03-15 17:41:30] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 0 ms to minimize.
[2023-03-15 17:41:31] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 0 ms to minimize.
[2023-03-15 17:41:31] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 0 ms to minimize.
[2023-03-15 17:41:31] [INFO ] Deduced a trap composed of 26 places in 215 ms of which 1 ms to minimize.
[2023-03-15 17:41:31] [INFO ] Deduced a trap composed of 24 places in 212 ms of which 1 ms to minimize.
[2023-03-15 17:41:32] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 1 ms to minimize.
[2023-03-15 17:41:32] [INFO ] Deduced a trap composed of 10 places in 243 ms of which 1 ms to minimize.
[2023-03-15 17:41:32] [INFO ] Deduced a trap composed of 20 places in 170 ms of which 1 ms to minimize.
[2023-03-15 17:41:32] [INFO ] Deduced a trap composed of 19 places in 219 ms of which 1 ms to minimize.
[2023-03-15 17:41:33] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 1 ms to minimize.
[2023-03-15 17:41:33] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 0 ms to minimize.
[2023-03-15 17:41:33] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 1 ms to minimize.
[2023-03-15 17:41:33] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 0 ms to minimize.
[2023-03-15 17:41:33] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 0 ms to minimize.
[2023-03-15 17:41:33] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 0 ms to minimize.
[2023-03-15 17:41:34] [INFO ] Deduced a trap composed of 9 places in 204 ms of which 1 ms to minimize.
[2023-03-15 17:41:34] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 1 ms to minimize.
[2023-03-15 17:41:34] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 1 ms to minimize.
[2023-03-15 17:41:34] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 1 ms to minimize.
[2023-03-15 17:41:34] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 6030 ms
[2023-03-15 17:41:34] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 1 ms to minimize.
[2023-03-15 17:41:34] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 1 ms to minimize.
[2023-03-15 17:41:35] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 1 ms to minimize.
[2023-03-15 17:41:35] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2023-03-15 17:41:35] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 1 ms to minimize.
[2023-03-15 17:41:35] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 0 ms to minimize.
[2023-03-15 17:41:36] [INFO ] Deduced a trap composed of 19 places in 220 ms of which 1 ms to minimize.
[2023-03-15 17:41:36] [INFO ] Deduced a trap composed of 19 places in 220 ms of which 1 ms to minimize.
[2023-03-15 17:41:36] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 1 ms to minimize.
[2023-03-15 17:41:36] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2023-03-15 17:41:36] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 0 ms to minimize.
[2023-03-15 17:41:37] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 1 ms to minimize.
[2023-03-15 17:41:37] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2344 ms
[2023-03-15 17:41:37] [INFO ] Deduced a trap composed of 17 places in 235 ms of which 0 ms to minimize.
[2023-03-15 17:41:37] [INFO ] Deduced a trap composed of 34 places in 204 ms of which 1 ms to minimize.
[2023-03-15 17:41:37] [INFO ] Deduced a trap composed of 33 places in 190 ms of which 1 ms to minimize.
[2023-03-15 17:41:38] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 0 ms to minimize.
[2023-03-15 17:41:38] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 1 ms to minimize.
[2023-03-15 17:41:38] [INFO ] Deduced a trap composed of 36 places in 233 ms of which 1 ms to minimize.
[2023-03-15 17:41:38] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 1 ms to minimize.
[2023-03-15 17:41:39] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 1 ms to minimize.
[2023-03-15 17:41:39] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 0 ms to minimize.
[2023-03-15 17:41:39] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 1 ms to minimize.
[2023-03-15 17:41:39] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 1 ms to minimize.
[2023-03-15 17:41:39] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2596 ms
[2023-03-15 17:41:40] [INFO ] Deduced a trap composed of 61 places in 258 ms of which 1 ms to minimize.
[2023-03-15 17:41:40] [INFO ] Deduced a trap composed of 13 places in 245 ms of which 1 ms to minimize.
[2023-03-15 17:41:40] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 0 ms to minimize.
[2023-03-15 17:41:40] [INFO ] Deduced a trap composed of 27 places in 219 ms of which 0 ms to minimize.
[2023-03-15 17:41:41] [INFO ] Deduced a trap composed of 12 places in 242 ms of which 1 ms to minimize.
[2023-03-15 17:41:41] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 1 ms to minimize.
[2023-03-15 17:41:41] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 0 ms to minimize.
[2023-03-15 17:41:41] [INFO ] Deduced a trap composed of 54 places in 227 ms of which 1 ms to minimize.
[2023-03-15 17:41:42] [INFO ] Deduced a trap composed of 18 places in 217 ms of which 1 ms to minimize.
[2023-03-15 17:41:42] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 1 ms to minimize.
[2023-03-15 17:41:42] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 1 ms to minimize.
[2023-03-15 17:41:42] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 1 ms to minimize.
[2023-03-15 17:41:43] [INFO ] Deduced a trap composed of 41 places in 187 ms of which 1 ms to minimize.
[2023-03-15 17:41:43] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 1 ms to minimize.
[2023-03-15 17:41:43] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 1 ms to minimize.
[2023-03-15 17:41:43] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 1 ms to minimize.
[2023-03-15 17:41:43] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 0 ms to minimize.
[2023-03-15 17:41:43] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4042 ms
[2023-03-15 17:41:44] [INFO ] Deduced a trap composed of 16 places in 240 ms of which 1 ms to minimize.
[2023-03-15 17:41:44] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 0 ms to minimize.
[2023-03-15 17:41:44] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 1 ms to minimize.
[2023-03-15 17:41:44] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 1 ms to minimize.
[2023-03-15 17:41:44] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 1 ms to minimize.
[2023-03-15 17:41:45] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 0 ms to minimize.
[2023-03-15 17:41:45] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 1 ms to minimize.
[2023-03-15 17:41:45] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 1 ms to minimize.
[2023-03-15 17:41:45] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1563 ms
[2023-03-15 17:41:45] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 1 ms to minimize.
[2023-03-15 17:41:46] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 1 ms to minimize.
[2023-03-15 17:41:46] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 1 ms to minimize.
[2023-03-15 17:41:46] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 1 ms to minimize.
[2023-03-15 17:41:46] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 1 ms to minimize.
[2023-03-15 17:41:46] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2023-03-15 17:41:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1341 ms
[2023-03-15 17:41:46] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 1 ms to minimize.
[2023-03-15 17:41:47] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2023-03-15 17:41:47] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 0 ms to minimize.
[2023-03-15 17:41:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 605 ms
[2023-03-15 17:41:47] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 1 ms to minimize.
[2023-03-15 17:41:47] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 0 ms to minimize.
[2023-03-15 17:41:48] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 1 ms to minimize.
[2023-03-15 17:41:48] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 0 ms to minimize.
[2023-03-15 17:41:48] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 0 ms to minimize.
[2023-03-15 17:41:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 776 ms
[2023-03-15 17:41:48] [INFO ] Deduced a trap composed of 9 places in 266 ms of which 1 ms to minimize.
[2023-03-15 17:41:48] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 1 ms to minimize.
[2023-03-15 17:41:49] [INFO ] Deduced a trap composed of 16 places in 231 ms of which 1 ms to minimize.
[2023-03-15 17:41:49] [INFO ] Deduced a trap composed of 20 places in 232 ms of which 1 ms to minimize.
[2023-03-15 17:41:49] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 0 ms to minimize.
[2023-03-15 17:41:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1454 ms
[2023-03-15 17:41:50] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 1 ms to minimize.
[2023-03-15 17:41:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2023-03-15 17:41:50] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 1 ms to minimize.
[2023-03-15 17:41:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2023-03-15 17:41:51] [INFO ] Deduced a trap composed of 20 places in 231 ms of which 1 ms to minimize.
[2023-03-15 17:41:51] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 1 ms to minimize.
[2023-03-15 17:41:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 549 ms
[2023-03-15 17:41:52] [INFO ] Deduced a trap composed of 9 places in 251 ms of which 0 ms to minimize.
[2023-03-15 17:41:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
[2023-03-15 17:41:52] [INFO ] Deduced a trap composed of 16 places in 230 ms of which 0 ms to minimize.
[2023-03-15 17:41:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2023-03-15 17:41:52] [INFO ] Deduced a trap composed of 26 places in 188 ms of which 1 ms to minimize.
[2023-03-15 17:41:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2023-03-15 17:41:53] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 0 ms to minimize.
[2023-03-15 17:41:53] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 0 ms to minimize.
[2023-03-15 17:41:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 425 ms
[2023-03-15 17:41:53] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 0 ms to minimize.
[2023-03-15 17:41:53] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 0 ms to minimize.
[2023-03-15 17:41:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 524 ms
[2023-03-15 17:41:54] [INFO ] Deduced a trap composed of 16 places in 247 ms of which 1 ms to minimize.
[2023-03-15 17:41:55] [INFO ] Deduced a trap composed of 34 places in 208 ms of which 1 ms to minimize.
[2023-03-15 17:41:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 603 ms
[2023-03-15 17:41:55] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 1 ms to minimize.
[2023-03-15 17:41:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2023-03-15 17:41:55] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 1 ms to minimize.
[2023-03-15 17:41:56] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 1 ms to minimize.
[2023-03-15 17:41:56] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 1 ms to minimize.
[2023-03-15 17:41:56] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 1 ms to minimize.
[2023-03-15 17:41:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 827 ms
[2023-03-15 17:41:56] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 0 ms to minimize.
[2023-03-15 17:41:57] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 0 ms to minimize.
[2023-03-15 17:41:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 400 ms
[2023-03-15 17:41:57] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 0 ms to minimize.
[2023-03-15 17:41:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2023-03-15 17:41:58] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 0 ms to minimize.
[2023-03-15 17:41:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2023-03-15 17:41:58] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 1 ms to minimize.
[2023-03-15 17:41:58] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 1 ms to minimize.
[2023-03-15 17:41:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 425 ms
[2023-03-15 17:41:59] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 0 ms to minimize.
[2023-03-15 17:41:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-03-15 17:42:00] [INFO ] Deduced a trap composed of 20 places in 270 ms of which 0 ms to minimize.
[2023-03-15 17:42:01] [INFO ] Deduced a trap composed of 10 places in 274 ms of which 1 ms to minimize.
[2023-03-15 17:42:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 645 ms
[2023-03-15 17:42:01] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 1 ms to minimize.
[2023-03-15 17:42:02] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 1 ms to minimize.
[2023-03-15 17:42:02] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 1 ms to minimize.
[2023-03-15 17:42:02] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 1 ms to minimize.
[2023-03-15 17:42:02] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 0 ms to minimize.
[2023-03-15 17:42:03] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 1 ms to minimize.
[2023-03-15 17:42:03] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 1 ms to minimize.
[2023-03-15 17:42:03] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 1 ms to minimize.
[2023-03-15 17:42:03] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1866 ms
[2023-03-15 17:42:03] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 0 ms to minimize.
[2023-03-15 17:42:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2023-03-15 17:42:04] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 1 ms to minimize.
[2023-03-15 17:42:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2023-03-15 17:42:06] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 0 ms to minimize.
[2023-03-15 17:42:06] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2023-03-15 17:42:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 348 ms
[2023-03-15 17:42:06] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 1 ms to minimize.
[2023-03-15 17:42:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2023-03-15 17:42:07] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 1 ms to minimize.
[2023-03-15 17:42:07] [INFO ] Deduced a trap composed of 49 places in 209 ms of which 0 ms to minimize.
[2023-03-15 17:42:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 504 ms
[2023-03-15 17:42:07] [INFO ] Deduced a trap composed of 42 places in 210 ms of which 0 ms to minimize.
[2023-03-15 17:42:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2023-03-15 17:42:08] [INFO ] Deduced a trap composed of 29 places in 165 ms of which 1 ms to minimize.
[2023-03-15 17:42:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2023-03-15 17:42:08] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 0 ms to minimize.
[2023-03-15 17:42:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2023-03-15 17:42:11] [INFO ] Deduced a trap composed of 54 places in 232 ms of which 1 ms to minimize.
[2023-03-15 17:42:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2023-03-15 17:42:11] [INFO ] Deduced a trap composed of 49 places in 201 ms of which 0 ms to minimize.
[2023-03-15 17:42:11] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 1 ms to minimize.
[2023-03-15 17:42:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 539 ms
[2023-03-15 17:42:13] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 1 ms to minimize.
[2023-03-15 17:42:13] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 1 ms to minimize.
[2023-03-15 17:42:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 440 ms
[2023-03-15 17:42:13] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 1 ms to minimize.
[2023-03-15 17:42:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-03-15 17:42:14] [INFO ] Deduced a trap composed of 54 places in 219 ms of which 1 ms to minimize.
[2023-03-15 17:42:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2023-03-15 17:42:14] [INFO ] Deduced a trap composed of 33 places in 205 ms of which 1 ms to minimize.
[2023-03-15 17:42:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
[2023-03-15 17:42:15] [INFO ] Deduced a trap composed of 30 places in 195 ms of which 1 ms to minimize.
[2023-03-15 17:42:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2023-03-15 17:42:15] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 1 ms to minimize.
[2023-03-15 17:42:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2023-03-15 17:42:16] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 1 ms to minimize.
[2023-03-15 17:42:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-15 17:42:17] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 1 ms to minimize.
[2023-03-15 17:42:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
[2023-03-15 17:42:17] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 1 ms to minimize.
[2023-03-15 17:42:17] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 0 ms to minimize.
[2023-03-15 17:42:18] [INFO ] Deduced a trap composed of 64 places in 227 ms of which 1 ms to minimize.
[2023-03-15 17:42:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 710 ms
[2023-03-15 17:42:18] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 1 ms to minimize.
[2023-03-15 17:42:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2023-03-15 17:42:20] [INFO ] Deduced a trap composed of 36 places in 217 ms of which 1 ms to minimize.
[2023-03-15 17:42:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
[2023-03-15 17:42:21] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 0 ms to minimize.
[2023-03-15 17:42:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-15 17:42:21] [INFO ] After 67635ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :189
Attempting to minimize the solution found.
Minimization took 15506 ms.
[2023-03-15 17:42:37] [INFO ] After 90656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :189
Fused 189 Parikh solutions to 177 different solutions.
Parikh walk visited 0 properties in 1729 ms.
Support contains 154 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 17 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 953352 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=31 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 73472 ms. (steps per millisecond=136 ) properties seen :0
Running SMT prover for 189 properties.
[2023-03-15 17:44:24] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:44:24] [INFO ] Invariant cache hit.
[2023-03-15 17:44:26] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 17:44:34] [INFO ] After 6193ms SMT Verify possible using state equation in real domain returned unsat :0 sat :19 real:170
[2023-03-15 17:44:34] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:44:35] [INFO ] After 777ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:189
[2023-03-15 17:44:35] [INFO ] After 10192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:189
[2023-03-15 17:44:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 17:44:43] [INFO ] After 5488ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :189
[2023-03-15 17:44:49] [INFO ] After 5139ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :189
[2023-03-15 17:44:49] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 1 ms to minimize.
[2023-03-15 17:44:49] [INFO ] Deduced a trap composed of 10 places in 225 ms of which 1 ms to minimize.
[2023-03-15 17:44:49] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 1 ms to minimize.
[2023-03-15 17:44:50] [INFO ] Deduced a trap composed of 9 places in 254 ms of which 1 ms to minimize.
[2023-03-15 17:44:50] [INFO ] Deduced a trap composed of 12 places in 234 ms of which 0 ms to minimize.
[2023-03-15 17:44:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1291 ms
[2023-03-15 17:44:50] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 1 ms to minimize.
[2023-03-15 17:44:51] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 1 ms to minimize.
[2023-03-15 17:44:51] [INFO ] Deduced a trap composed of 18 places in 201 ms of which 1 ms to minimize.
[2023-03-15 17:44:51] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 1 ms to minimize.
[2023-03-15 17:44:51] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 1 ms to minimize.
[2023-03-15 17:44:52] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 1 ms to minimize.
[2023-03-15 17:44:52] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 1 ms to minimize.
[2023-03-15 17:44:52] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 1 ms to minimize.
[2023-03-15 17:44:52] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1862 ms
[2023-03-15 17:44:52] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 1 ms to minimize.
[2023-03-15 17:44:53] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 1 ms to minimize.
[2023-03-15 17:44:53] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 1 ms to minimize.
[2023-03-15 17:44:53] [INFO ] Deduced a trap composed of 59 places in 190 ms of which 1 ms to minimize.
[2023-03-15 17:44:53] [INFO ] Deduced a trap composed of 18 places in 195 ms of which 0 ms to minimize.
[2023-03-15 17:44:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1177 ms
[2023-03-15 17:44:54] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 1 ms to minimize.
[2023-03-15 17:44:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2023-03-15 17:44:54] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 1 ms to minimize.
[2023-03-15 17:44:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2023-03-15 17:44:54] [INFO ] Deduced a trap composed of 36 places in 180 ms of which 1 ms to minimize.
[2023-03-15 17:44:54] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 1 ms to minimize.
[2023-03-15 17:44:55] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 1 ms to minimize.
[2023-03-15 17:44:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 660 ms
[2023-03-15 17:44:55] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 0 ms to minimize.
[2023-03-15 17:44:55] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 0 ms to minimize.
[2023-03-15 17:44:55] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 1 ms to minimize.
[2023-03-15 17:44:55] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 1 ms to minimize.
[2023-03-15 17:44:56] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 1 ms to minimize.
[2023-03-15 17:44:56] [INFO ] Deduced a trap composed of 44 places in 192 ms of which 1 ms to minimize.
[2023-03-15 17:44:56] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 0 ms to minimize.
[2023-03-15 17:44:56] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 1 ms to minimize.
[2023-03-15 17:44:56] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 0 ms to minimize.
[2023-03-15 17:44:57] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 0 ms to minimize.
[2023-03-15 17:44:57] [INFO ] Deduced a trap composed of 33 places in 171 ms of which 1 ms to minimize.
[2023-03-15 17:44:57] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2265 ms
[2023-03-15 17:44:57] [INFO ] Deduced a trap composed of 27 places in 216 ms of which 1 ms to minimize.
[2023-03-15 17:44:57] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 1 ms to minimize.
[2023-03-15 17:44:58] [INFO ] Deduced a trap composed of 12 places in 212 ms of which 1 ms to minimize.
[2023-03-15 17:44:58] [INFO ] Deduced a trap composed of 40 places in 225 ms of which 1 ms to minimize.
[2023-03-15 17:44:58] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 1 ms to minimize.
[2023-03-15 17:44:58] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 1 ms to minimize.
[2023-03-15 17:44:59] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 0 ms to minimize.
[2023-03-15 17:44:59] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 1 ms to minimize.
[2023-03-15 17:44:59] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 1 ms to minimize.
[2023-03-15 17:44:59] [INFO ] Deduced a trap composed of 16 places in 217 ms of which 1 ms to minimize.
[2023-03-15 17:45:00] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 1 ms to minimize.
[2023-03-15 17:45:00] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 1 ms to minimize.
[2023-03-15 17:45:00] [INFO ] Deduced a trap composed of 26 places in 215 ms of which 1 ms to minimize.
[2023-03-15 17:45:00] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 1 ms to minimize.
[2023-03-15 17:45:01] [INFO ] Deduced a trap composed of 26 places in 215 ms of which 1 ms to minimize.
[2023-03-15 17:45:01] [INFO ] Deduced a trap composed of 24 places in 213 ms of which 0 ms to minimize.
[2023-03-15 17:45:01] [INFO ] Deduced a trap composed of 24 places in 240 ms of which 1 ms to minimize.
[2023-03-15 17:45:01] [INFO ] Deduced a trap composed of 10 places in 252 ms of which 1 ms to minimize.
[2023-03-15 17:45:02] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 0 ms to minimize.
[2023-03-15 17:45:02] [INFO ] Deduced a trap composed of 19 places in 225 ms of which 1 ms to minimize.
[2023-03-15 17:45:02] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 1 ms to minimize.
[2023-03-15 17:45:02] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 1 ms to minimize.
[2023-03-15 17:45:02] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 0 ms to minimize.
[2023-03-15 17:45:03] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 0 ms to minimize.
[2023-03-15 17:45:03] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 1 ms to minimize.
[2023-03-15 17:45:03] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 1 ms to minimize.
[2023-03-15 17:45:03] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 1 ms to minimize.
[2023-03-15 17:45:03] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 1 ms to minimize.
[2023-03-15 17:45:04] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 1 ms to minimize.
[2023-03-15 17:45:04] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 0 ms to minimize.
[2023-03-15 17:45:04] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 6793 ms
[2023-03-15 17:45:04] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 0 ms to minimize.
[2023-03-15 17:45:04] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 1 ms to minimize.
[2023-03-15 17:45:04] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 0 ms to minimize.
[2023-03-15 17:45:04] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 1 ms to minimize.
[2023-03-15 17:45:05] [INFO ] Deduced a trap composed of 12 places in 237 ms of which 1 ms to minimize.
[2023-03-15 17:45:05] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 1 ms to minimize.
[2023-03-15 17:45:05] [INFO ] Deduced a trap composed of 19 places in 241 ms of which 0 ms to minimize.
[2023-03-15 17:45:06] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 1 ms to minimize.
[2023-03-15 17:45:06] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 1 ms to minimize.
[2023-03-15 17:45:06] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 0 ms to minimize.
[2023-03-15 17:45:06] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2023-03-15 17:45:06] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 0 ms to minimize.
[2023-03-15 17:45:06] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2452 ms
[2023-03-15 17:45:07] [INFO ] Deduced a trap composed of 17 places in 255 ms of which 1 ms to minimize.
[2023-03-15 17:45:07] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 1 ms to minimize.
[2023-03-15 17:45:07] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 1 ms to minimize.
[2023-03-15 17:45:07] [INFO ] Deduced a trap composed of 25 places in 253 ms of which 1 ms to minimize.
[2023-03-15 17:45:08] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 1 ms to minimize.
[2023-03-15 17:45:08] [INFO ] Deduced a trap composed of 36 places in 267 ms of which 1 ms to minimize.
[2023-03-15 17:45:08] [INFO ] Deduced a trap composed of 41 places in 259 ms of which 1 ms to minimize.
[2023-03-15 17:45:08] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 1 ms to minimize.
[2023-03-15 17:45:09] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 0 ms to minimize.
[2023-03-15 17:45:09] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 1 ms to minimize.
[2023-03-15 17:45:09] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 1 ms to minimize.
[2023-03-15 17:45:09] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2713 ms
[2023-03-15 17:45:09] [INFO ] Deduced a trap composed of 61 places in 265 ms of which 1 ms to minimize.
[2023-03-15 17:45:10] [INFO ] Deduced a trap composed of 13 places in 257 ms of which 1 ms to minimize.
[2023-03-15 17:45:10] [INFO ] Deduced a trap composed of 20 places in 265 ms of which 1 ms to minimize.
[2023-03-15 17:45:10] [INFO ] Deduced a trap composed of 27 places in 252 ms of which 1 ms to minimize.
[2023-03-15 17:45:10] [INFO ] Deduced a trap composed of 12 places in 250 ms of which 1 ms to minimize.
[2023-03-15 17:45:11] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 0 ms to minimize.
[2023-03-15 17:45:11] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 1 ms to minimize.
[2023-03-15 17:45:11] [INFO ] Deduced a trap composed of 54 places in 220 ms of which 1 ms to minimize.
[2023-03-15 17:45:12] [INFO ] Deduced a trap composed of 18 places in 209 ms of which 1 ms to minimize.
[2023-03-15 17:45:12] [INFO ] Deduced a trap composed of 27 places in 203 ms of which 0 ms to minimize.
[2023-03-15 17:45:12] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 1 ms to minimize.
[2023-03-15 17:45:12] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 1 ms to minimize.
[2023-03-15 17:45:12] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 1 ms to minimize.
[2023-03-15 17:45:13] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 1 ms to minimize.
[2023-03-15 17:45:13] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 1 ms to minimize.
[2023-03-15 17:45:13] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 0 ms to minimize.
[2023-03-15 17:45:13] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 0 ms to minimize.
[2023-03-15 17:45:13] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4178 ms
[2023-03-15 17:45:13] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 0 ms to minimize.
[2023-03-15 17:45:14] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 1 ms to minimize.
[2023-03-15 17:45:14] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 1 ms to minimize.
[2023-03-15 17:45:14] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 1 ms to minimize.
[2023-03-15 17:45:14] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 1 ms to minimize.
[2023-03-15 17:45:14] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 1 ms to minimize.
[2023-03-15 17:45:15] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 0 ms to minimize.
[2023-03-15 17:45:15] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 1 ms to minimize.
[2023-03-15 17:45:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1496 ms
[2023-03-15 17:45:15] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 1 ms to minimize.
[2023-03-15 17:45:15] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 0 ms to minimize.
[2023-03-15 17:45:16] [INFO ] Deduced a trap composed of 40 places in 188 ms of which 1 ms to minimize.
[2023-03-15 17:45:16] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 1 ms to minimize.
[2023-03-15 17:45:16] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 1 ms to minimize.
[2023-03-15 17:45:16] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 0 ms to minimize.
[2023-03-15 17:45:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1294 ms
[2023-03-15 17:45:16] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 0 ms to minimize.
[2023-03-15 17:45:16] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 1 ms to minimize.
[2023-03-15 17:45:17] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 1 ms to minimize.
[2023-03-15 17:45:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 602 ms
[2023-03-15 17:45:17] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 1 ms to minimize.
[2023-03-15 17:45:17] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 1 ms to minimize.
[2023-03-15 17:45:17] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 1 ms to minimize.
[2023-03-15 17:45:17] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 0 ms to minimize.
[2023-03-15 17:45:18] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 0 ms to minimize.
[2023-03-15 17:45:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 781 ms
[2023-03-15 17:45:18] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 1 ms to minimize.
[2023-03-15 17:45:18] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 0 ms to minimize.
[2023-03-15 17:45:19] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 1 ms to minimize.
[2023-03-15 17:45:19] [INFO ] Deduced a trap composed of 20 places in 227 ms of which 1 ms to minimize.
[2023-03-15 17:45:19] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2023-03-15 17:45:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1347 ms
[2023-03-15 17:45:19] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 0 ms to minimize.
[2023-03-15 17:45:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2023-03-15 17:45:20] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 1 ms to minimize.
[2023-03-15 17:45:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-03-15 17:45:20] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 0 ms to minimize.
[2023-03-15 17:45:21] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 1 ms to minimize.
[2023-03-15 17:45:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 465 ms
[2023-03-15 17:45:21] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 0 ms to minimize.
[2023-03-15 17:45:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2023-03-15 17:45:21] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 1 ms to minimize.
[2023-03-15 17:45:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2023-03-15 17:45:22] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 0 ms to minimize.
[2023-03-15 17:45:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-15 17:45:22] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 1 ms to minimize.
[2023-03-15 17:45:22] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 1 ms to minimize.
[2023-03-15 17:45:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 435 ms
[2023-03-15 17:45:23] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 0 ms to minimize.
[2023-03-15 17:45:23] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 1 ms to minimize.
[2023-03-15 17:45:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 515 ms
[2023-03-15 17:45:24] [INFO ] Deduced a trap composed of 16 places in 256 ms of which 1 ms to minimize.
[2023-03-15 17:45:24] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 1 ms to minimize.
[2023-03-15 17:45:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 567 ms
[2023-03-15 17:45:24] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 1 ms to minimize.
[2023-03-15 17:45:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2023-03-15 17:45:25] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 1 ms to minimize.
[2023-03-15 17:45:25] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 1 ms to minimize.
[2023-03-15 17:45:25] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 1 ms to minimize.
[2023-03-15 17:45:25] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 1 ms to minimize.
[2023-03-15 17:45:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 772 ms
[2023-03-15 17:45:26] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 1 ms to minimize.
[2023-03-15 17:45:26] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 0 ms to minimize.
[2023-03-15 17:45:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 410 ms
[2023-03-15 17:45:27] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 0 ms to minimize.
[2023-03-15 17:45:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2023-03-15 17:45:27] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 0 ms to minimize.
[2023-03-15 17:45:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-15 17:45:27] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 0 ms to minimize.
[2023-03-15 17:45:28] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 0 ms to minimize.
[2023-03-15 17:45:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 413 ms
[2023-03-15 17:45:28] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2023-03-15 17:45:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-03-15 17:45:30] [INFO ] Deduced a trap composed of 20 places in 266 ms of which 1 ms to minimize.
[2023-03-15 17:45:30] [INFO ] Deduced a trap composed of 10 places in 243 ms of which 0 ms to minimize.
[2023-03-15 17:45:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 606 ms
[2023-03-15 17:45:31] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 0 ms to minimize.
[2023-03-15 17:45:31] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 1 ms to minimize.
[2023-03-15 17:45:31] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 1 ms to minimize.
[2023-03-15 17:45:31] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 0 ms to minimize.
[2023-03-15 17:45:32] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 1 ms to minimize.
[2023-03-15 17:45:32] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 1 ms to minimize.
[2023-03-15 17:45:32] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 0 ms to minimize.
[2023-03-15 17:45:32] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 1 ms to minimize.
[2023-03-15 17:45:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1790 ms
[2023-03-15 17:45:32] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 0 ms to minimize.
[2023-03-15 17:45:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-03-15 17:45:33] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 0 ms to minimize.
[2023-03-15 17:45:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-03-15 17:45:35] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 1 ms to minimize.
[2023-03-15 17:45:35] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 0 ms to minimize.
[2023-03-15 17:45:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 336 ms
[2023-03-15 17:45:35] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 0 ms to minimize.
[2023-03-15 17:45:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2023-03-15 17:45:36] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 0 ms to minimize.
[2023-03-15 17:45:36] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 0 ms to minimize.
[2023-03-15 17:45:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 522 ms
[2023-03-15 17:45:37] [INFO ] Deduced a trap composed of 42 places in 204 ms of which 1 ms to minimize.
[2023-03-15 17:45:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2023-03-15 17:45:37] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 1 ms to minimize.
[2023-03-15 17:45:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2023-03-15 17:45:37] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 0 ms to minimize.
[2023-03-15 17:45:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-15 17:45:40] [INFO ] Deduced a trap composed of 54 places in 209 ms of which 1 ms to minimize.
[2023-03-15 17:45:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2023-03-15 17:45:40] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 0 ms to minimize.
[2023-03-15 17:45:40] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 1 ms to minimize.
[2023-03-15 17:45:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 515 ms
[2023-03-15 17:45:42] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 0 ms to minimize.
[2023-03-15 17:45:42] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 1 ms to minimize.
[2023-03-15 17:45:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 449 ms
[2023-03-15 17:45:42] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 0 ms to minimize.
[2023-03-15 17:45:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2023-03-15 17:45:43] [INFO ] Deduced a trap composed of 54 places in 200 ms of which 1 ms to minimize.
[2023-03-15 17:45:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2023-03-15 17:45:43] [INFO ] Deduced a trap composed of 33 places in 199 ms of which 1 ms to minimize.
[2023-03-15 17:45:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2023-03-15 17:45:44] [INFO ] Deduced a trap composed of 30 places in 189 ms of which 1 ms to minimize.
[2023-03-15 17:45:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2023-03-15 17:45:44] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 1 ms to minimize.
[2023-03-15 17:45:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-03-15 17:45:45] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 1 ms to minimize.
[2023-03-15 17:45:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2023-03-15 17:45:46] [INFO ] Deduced a trap composed of 13 places in 241 ms of which 1 ms to minimize.
[2023-03-15 17:45:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2023-03-15 17:45:46] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 0 ms to minimize.
[2023-03-15 17:45:46] [INFO ] Deduced a trap composed of 37 places in 211 ms of which 1 ms to minimize.
[2023-03-15 17:45:47] [INFO ] Deduced a trap composed of 64 places in 204 ms of which 1 ms to minimize.
[2023-03-15 17:45:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 720 ms
[2023-03-15 17:45:47] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 1 ms to minimize.
[2023-03-15 17:45:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2023-03-15 17:45:48] [INFO ] Deduced a trap composed of 36 places in 210 ms of which 1 ms to minimize.
[2023-03-15 17:45:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2023-03-15 17:45:50] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 1 ms to minimize.
[2023-03-15 17:45:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2023-03-15 17:45:50] [INFO ] After 66780ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :189
Attempting to minimize the solution found.
Minimization took 11717 ms.
[2023-03-15 17:46:02] [INFO ] After 87306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :189
Fused 189 Parikh solutions to 177 different solutions.
Parikh walk visited 0 properties in 1524 ms.
Support contains 154 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 14 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 13 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 17:46:04] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:46:04] [INFO ] Invariant cache hit.
[2023-03-15 17:46:04] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-15 17:46:04] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:46:04] [INFO ] Invariant cache hit.
[2023-03-15 17:46:04] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:46:04] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
[2023-03-15 17:46:04] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-15 17:46:04] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:46:04] [INFO ] Invariant cache hit.
[2023-03-15 17:46:05] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1504 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 3851 ms. (steps per millisecond=25 ) properties (out of 154) seen :68
Running SMT prover for 86 properties.
[2023-03-15 17:46:09] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:46:09] [INFO ] Invariant cache hit.
[2023-03-15 17:46:09] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 17:46:09] [INFO ] After 267ms SMT Verify possible using state equation in real domain returned unsat :0 sat :86
[2023-03-15 17:46:09] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:46:10] [INFO ] After 279ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :86
[2023-03-15 17:46:10] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 1 ms to minimize.
[2023-03-15 17:46:10] [INFO ] Deduced a trap composed of 30 places in 250 ms of which 1 ms to minimize.
[2023-03-15 17:46:10] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 1 ms to minimize.
[2023-03-15 17:46:11] [INFO ] Deduced a trap composed of 45 places in 189 ms of which 0 ms to minimize.
[2023-03-15 17:46:11] [INFO ] Deduced a trap composed of 48 places in 196 ms of which 1 ms to minimize.
[2023-03-15 17:46:11] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 0 ms to minimize.
[2023-03-15 17:46:11] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 1 ms to minimize.
[2023-03-15 17:46:11] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 0 ms to minimize.
[2023-03-15 17:46:11] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 0 ms to minimize.
[2023-03-15 17:46:12] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 1 ms to minimize.
[2023-03-15 17:46:12] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 1 ms to minimize.
[2023-03-15 17:46:12] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 1 ms to minimize.
[2023-03-15 17:46:12] [INFO ] Deduced a trap composed of 53 places in 182 ms of which 1 ms to minimize.
[2023-03-15 17:46:12] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 0 ms to minimize.
[2023-03-15 17:46:13] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 0 ms to minimize.
[2023-03-15 17:46:13] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2923 ms
[2023-03-15 17:46:13] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 0 ms to minimize.
[2023-03-15 17:46:13] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 0 ms to minimize.
[2023-03-15 17:46:13] [INFO ] Deduced a trap composed of 47 places in 200 ms of which 1 ms to minimize.
[2023-03-15 17:46:13] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 0 ms to minimize.
[2023-03-15 17:46:14] [INFO ] Deduced a trap composed of 61 places in 240 ms of which 1 ms to minimize.
[2023-03-15 17:46:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1157 ms
[2023-03-15 17:46:14] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2023-03-15 17:46:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-15 17:46:14] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 1 ms to minimize.
[2023-03-15 17:46:14] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 0 ms to minimize.
[2023-03-15 17:46:15] [INFO ] Deduced a trap composed of 38 places in 234 ms of which 1 ms to minimize.
[2023-03-15 17:46:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 850 ms
[2023-03-15 17:46:15] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2023-03-15 17:46:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-15 17:46:15] [INFO ] Deduced a trap composed of 46 places in 186 ms of which 1 ms to minimize.
[2023-03-15 17:46:16] [INFO ] Deduced a trap composed of 50 places in 204 ms of which 0 ms to minimize.
[2023-03-15 17:46:16] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 1 ms to minimize.
[2023-03-15 17:46:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 753 ms
[2023-03-15 17:46:16] [INFO ] Deduced a trap composed of 66 places in 227 ms of which 1 ms to minimize.
[2023-03-15 17:46:17] [INFO ] Deduced a trap composed of 75 places in 247 ms of which 1 ms to minimize.
[2023-03-15 17:46:17] [INFO ] Deduced a trap composed of 73 places in 239 ms of which 1 ms to minimize.
[2023-03-15 17:46:17] [INFO ] Deduced a trap composed of 74 places in 229 ms of which 1 ms to minimize.
[2023-03-15 17:46:18] [INFO ] Deduced a trap composed of 59 places in 207 ms of which 0 ms to minimize.
[2023-03-15 17:46:18] [INFO ] Deduced a trap composed of 87 places in 204 ms of which 0 ms to minimize.
[2023-03-15 17:46:18] [INFO ] Deduced a trap composed of 71 places in 230 ms of which 1 ms to minimize.
[2023-03-15 17:46:18] [INFO ] Deduced a trap composed of 78 places in 233 ms of which 1 ms to minimize.
[2023-03-15 17:46:19] [INFO ] Deduced a trap composed of 78 places in 226 ms of which 0 ms to minimize.
[2023-03-15 17:46:19] [INFO ] Deduced a trap composed of 81 places in 195 ms of which 0 ms to minimize.
[2023-03-15 17:46:19] [INFO ] Deduced a trap composed of 63 places in 210 ms of which 1 ms to minimize.
[2023-03-15 17:46:19] [INFO ] Deduced a trap composed of 59 places in 198 ms of which 1 ms to minimize.
[2023-03-15 17:46:20] [INFO ] Deduced a trap composed of 69 places in 200 ms of which 0 ms to minimize.
[2023-03-15 17:46:20] [INFO ] Deduced a trap composed of 66 places in 223 ms of which 1 ms to minimize.
[2023-03-15 17:46:20] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 1 ms to minimize.
[2023-03-15 17:46:20] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3845 ms
[2023-03-15 17:46:20] [INFO ] Deduced a trap composed of 61 places in 202 ms of which 1 ms to minimize.
[2023-03-15 17:46:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2023-03-15 17:46:21] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 1 ms to minimize.
[2023-03-15 17:46:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2023-03-15 17:46:21] [INFO ] Deduced a trap composed of 50 places in 194 ms of which 1 ms to minimize.
[2023-03-15 17:46:21] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 1 ms to minimize.
[2023-03-15 17:46:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 506 ms
[2023-03-15 17:46:22] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-15 17:46:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2023-03-15 17:46:22] [INFO ] Deduced a trap composed of 44 places in 220 ms of which 1 ms to minimize.
[2023-03-15 17:46:22] [INFO ] Deduced a trap composed of 52 places in 208 ms of which 0 ms to minimize.
[2023-03-15 17:46:23] [INFO ] Deduced a trap composed of 46 places in 192 ms of which 0 ms to minimize.
[2023-03-15 17:46:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 778 ms
[2023-03-15 17:46:23] [INFO ] Deduced a trap composed of 51 places in 196 ms of which 1 ms to minimize.
[2023-03-15 17:46:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2023-03-15 17:46:23] [INFO ] Deduced a trap composed of 67 places in 235 ms of which 1 ms to minimize.
[2023-03-15 17:46:24] [INFO ] Deduced a trap composed of 55 places in 186 ms of which 1 ms to minimize.
[2023-03-15 17:46:24] [INFO ] Deduced a trap composed of 58 places in 174 ms of which 1 ms to minimize.
[2023-03-15 17:46:24] [INFO ] Deduced a trap composed of 57 places in 189 ms of which 1 ms to minimize.
[2023-03-15 17:46:24] [INFO ] Deduced a trap composed of 50 places in 184 ms of which 1 ms to minimize.
[2023-03-15 17:46:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1209 ms
[2023-03-15 17:46:24] [INFO ] Deduced a trap composed of 64 places in 209 ms of which 1 ms to minimize.
[2023-03-15 17:46:25] [INFO ] Deduced a trap composed of 80 places in 188 ms of which 1 ms to minimize.
[2023-03-15 17:46:25] [INFO ] Deduced a trap composed of 71 places in 203 ms of which 0 ms to minimize.
[2023-03-15 17:46:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 764 ms
[2023-03-15 17:46:25] [INFO ] Deduced a trap composed of 63 places in 171 ms of which 1 ms to minimize.
[2023-03-15 17:46:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2023-03-15 17:46:26] [INFO ] Deduced a trap composed of 39 places in 221 ms of which 1 ms to minimize.
[2023-03-15 17:46:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2023-03-15 17:46:27] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 0 ms to minimize.
[2023-03-15 17:46:27] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 0 ms to minimize.
[2023-03-15 17:46:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 328 ms
[2023-03-15 17:46:27] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 0 ms to minimize.
[2023-03-15 17:46:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2023-03-15 17:46:27] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2023-03-15 17:46:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-03-15 17:46:28] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2023-03-15 17:46:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-03-15 17:46:28] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2023-03-15 17:46:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-03-15 17:46:30] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2023-03-15 17:46:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2023-03-15 17:46:30] [INFO ] After 21114ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:86
[2023-03-15 17:46:30] [INFO ] After 21528ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:86
[2023-03-15 17:46:31] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 17:46:31] [INFO ] After 440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :86
[2023-03-15 17:46:32] [INFO ] After 377ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :86
[2023-03-15 17:46:32] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 0 ms to minimize.
[2023-03-15 17:46:32] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 1 ms to minimize.
[2023-03-15 17:46:32] [INFO ] Deduced a trap composed of 20 places in 241 ms of which 1 ms to minimize.
[2023-03-15 17:46:32] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 0 ms to minimize.
[2023-03-15 17:46:33] [INFO ] Deduced a trap composed of 10 places in 233 ms of which 0 ms to minimize.
[2023-03-15 17:46:33] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 1 ms to minimize.
[2023-03-15 17:46:33] [INFO ] Deduced a trap composed of 27 places in 237 ms of which 1 ms to minimize.
[2023-03-15 17:46:33] [INFO ] Deduced a trap composed of 20 places in 241 ms of which 1 ms to minimize.
[2023-03-15 17:46:34] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 1 ms to minimize.
[2023-03-15 17:46:34] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 1 ms to minimize.
[2023-03-15 17:46:34] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 0 ms to minimize.
[2023-03-15 17:46:35] [INFO ] Deduced a trap composed of 27 places in 223 ms of which 0 ms to minimize.
[2023-03-15 17:46:35] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 1 ms to minimize.
[2023-03-15 17:46:35] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 0 ms to minimize.
[2023-03-15 17:46:35] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 0 ms to minimize.
[2023-03-15 17:46:35] [INFO ] Deduced a trap composed of 18 places in 202 ms of which 0 ms to minimize.
[2023-03-15 17:46:36] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 1 ms to minimize.
[2023-03-15 17:46:36] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4227 ms
[2023-03-15 17:46:36] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 0 ms to minimize.
[2023-03-15 17:46:36] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 1 ms to minimize.
[2023-03-15 17:46:36] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 1 ms to minimize.
[2023-03-15 17:46:37] [INFO ] Deduced a trap composed of 20 places in 194 ms of which 1 ms to minimize.
[2023-03-15 17:46:37] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 0 ms to minimize.
[2023-03-15 17:46:37] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 1 ms to minimize.
[2023-03-15 17:46:37] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 0 ms to minimize.
[2023-03-15 17:46:37] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 1 ms to minimize.
[2023-03-15 17:46:38] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 1 ms to minimize.
[2023-03-15 17:46:38] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 1 ms to minimize.
[2023-03-15 17:46:38] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 0 ms to minimize.
[2023-03-15 17:46:38] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 0 ms to minimize.
[2023-03-15 17:46:38] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 1 ms to minimize.
[2023-03-15 17:46:39] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 1 ms to minimize.
[2023-03-15 17:46:39] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2760 ms
[2023-03-15 17:46:39] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 0 ms to minimize.
[2023-03-15 17:46:39] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 1 ms to minimize.
[2023-03-15 17:46:39] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 0 ms to minimize.
[2023-03-15 17:46:40] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 1 ms to minimize.
[2023-03-15 17:46:40] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 0 ms to minimize.
[2023-03-15 17:46:40] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 1 ms to minimize.
[2023-03-15 17:46:40] [INFO ] Deduced a trap composed of 45 places in 196 ms of which 1 ms to minimize.
[2023-03-15 17:46:40] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 0 ms to minimize.
[2023-03-15 17:46:41] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 1 ms to minimize.
[2023-03-15 17:46:41] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2053 ms
[2023-03-15 17:46:41] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 0 ms to minimize.
[2023-03-15 17:46:41] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 1 ms to minimize.
[2023-03-15 17:46:41] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 1 ms to minimize.
[2023-03-15 17:46:41] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 1 ms to minimize.
[2023-03-15 17:46:42] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 0 ms to minimize.
[2023-03-15 17:46:42] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 0 ms to minimize.
[2023-03-15 17:46:42] [INFO ] Deduced a trap composed of 25 places in 206 ms of which 1 ms to minimize.
[2023-03-15 17:46:42] [INFO ] Deduced a trap composed of 20 places in 199 ms of which 1 ms to minimize.
[2023-03-15 17:46:43] [INFO ] Deduced a trap composed of 50 places in 221 ms of which 1 ms to minimize.
[2023-03-15 17:46:43] [INFO ] Deduced a trap composed of 38 places in 222 ms of which 1 ms to minimize.
[2023-03-15 17:46:43] [INFO ] Deduced a trap composed of 26 places in 233 ms of which 1 ms to minimize.
[2023-03-15 17:46:43] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 0 ms to minimize.
[2023-03-15 17:46:44] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 1 ms to minimize.
[2023-03-15 17:46:44] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 0 ms to minimize.
[2023-03-15 17:46:44] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 1 ms to minimize.
[2023-03-15 17:46:44] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3400 ms
[2023-03-15 17:46:44] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 1 ms to minimize.
[2023-03-15 17:46:45] [INFO ] Deduced a trap composed of 30 places in 171 ms of which 0 ms to minimize.
[2023-03-15 17:46:45] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 1 ms to minimize.
[2023-03-15 17:46:45] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 1 ms to minimize.
[2023-03-15 17:46:45] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 1 ms to minimize.
[2023-03-15 17:46:45] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 0 ms to minimize.
[2023-03-15 17:46:46] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 1 ms to minimize.
[2023-03-15 17:46:46] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 1 ms to minimize.
[2023-03-15 17:46:46] [INFO ] Deduced a trap composed of 13 places in 242 ms of which 1 ms to minimize.
[2023-03-15 17:46:46] [INFO ] Deduced a trap composed of 37 places in 216 ms of which 1 ms to minimize.
[2023-03-15 17:46:47] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 0 ms to minimize.
[2023-03-15 17:46:47] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 1 ms to minimize.
[2023-03-15 17:46:47] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2719 ms
[2023-03-15 17:46:47] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 1 ms to minimize.
[2023-03-15 17:46:47] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 0 ms to minimize.
[2023-03-15 17:46:47] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 0 ms to minimize.
[2023-03-15 17:46:48] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 0 ms to minimize.
[2023-03-15 17:46:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 771 ms
[2023-03-15 17:46:48] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 0 ms to minimize.
[2023-03-15 17:46:48] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 1 ms to minimize.
[2023-03-15 17:46:48] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 1 ms to minimize.
[2023-03-15 17:46:49] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 1 ms to minimize.
[2023-03-15 17:46:49] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 1 ms to minimize.
[2023-03-15 17:46:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1080 ms
[2023-03-15 17:46:49] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 1 ms to minimize.
[2023-03-15 17:46:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2023-03-15 17:46:49] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 1 ms to minimize.
[2023-03-15 17:46:50] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 0 ms to minimize.
[2023-03-15 17:46:50] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 1 ms to minimize.
[2023-03-15 17:46:50] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 1 ms to minimize.
[2023-03-15 17:46:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 926 ms
[2023-03-15 17:46:50] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 1 ms to minimize.
[2023-03-15 17:46:51] [INFO ] Deduced a trap composed of 26 places in 183 ms of which 1 ms to minimize.
[2023-03-15 17:46:51] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 1 ms to minimize.
[2023-03-15 17:46:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 694 ms
[2023-03-15 17:46:51] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 1 ms to minimize.
[2023-03-15 17:46:52] [INFO ] Deduced a trap composed of 31 places in 237 ms of which 1 ms to minimize.
[2023-03-15 17:46:52] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 1 ms to minimize.
[2023-03-15 17:46:52] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 1 ms to minimize.
[2023-03-15 17:46:52] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 1 ms to minimize.
[2023-03-15 17:46:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1317 ms
[2023-03-15 17:46:53] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 1 ms to minimize.
[2023-03-15 17:46:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-03-15 17:46:53] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 0 ms to minimize.
[2023-03-15 17:46:53] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 1 ms to minimize.
[2023-03-15 17:46:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 537 ms
[2023-03-15 17:46:54] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 1 ms to minimize.
[2023-03-15 17:46:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-03-15 17:46:54] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 1 ms to minimize.
[2023-03-15 17:46:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2023-03-15 17:46:54] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 1 ms to minimize.
[2023-03-15 17:46:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 294 ms
[2023-03-15 17:46:55] [INFO ] Deduced a trap composed of 34 places in 228 ms of which 1 ms to minimize.
[2023-03-15 17:46:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
[2023-03-15 17:46:55] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 0 ms to minimize.
[2023-03-15 17:46:55] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 0 ms to minimize.
[2023-03-15 17:46:55] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 1 ms to minimize.
[2023-03-15 17:46:55] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 0 ms to minimize.
[2023-03-15 17:46:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 637 ms
[2023-03-15 17:46:56] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 1 ms to minimize.
[2023-03-15 17:46:56] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 1 ms to minimize.
[2023-03-15 17:46:56] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 1 ms to minimize.
[2023-03-15 17:46:56] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 0 ms to minimize.
[2023-03-15 17:46:56] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 1 ms to minimize.
[2023-03-15 17:46:57] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 1 ms to minimize.
[2023-03-15 17:46:57] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 1 ms to minimize.
[2023-03-15 17:46:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1385 ms
[2023-03-15 17:46:57] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 0 ms to minimize.
[2023-03-15 17:46:57] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 0 ms to minimize.
[2023-03-15 17:46:58] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 1 ms to minimize.
[2023-03-15 17:46:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 574 ms
[2023-03-15 17:46:58] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 0 ms to minimize.
[2023-03-15 17:46:58] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 1 ms to minimize.
[2023-03-15 17:46:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 380 ms
[2023-03-15 17:46:59] [INFO ] Deduced a trap composed of 17 places in 251 ms of which 0 ms to minimize.
[2023-03-15 17:46:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 316 ms
[2023-03-15 17:46:59] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 1 ms to minimize.
[2023-03-15 17:47:00] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 1 ms to minimize.
[2023-03-15 17:47:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 453 ms
[2023-03-15 17:47:00] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 1 ms to minimize.
[2023-03-15 17:47:00] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 1 ms to minimize.
[2023-03-15 17:47:00] [INFO ] Deduced a trap composed of 34 places in 200 ms of which 1 ms to minimize.
[2023-03-15 17:47:01] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 0 ms to minimize.
[2023-03-15 17:47:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1019 ms
[2023-03-15 17:47:01] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 1 ms to minimize.
[2023-03-15 17:47:01] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 1 ms to minimize.
[2023-03-15 17:47:02] [INFO ] Deduced a trap composed of 35 places in 209 ms of which 1 ms to minimize.
[2023-03-15 17:47:02] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 0 ms to minimize.
[2023-03-15 17:47:02] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 1 ms to minimize.
[2023-03-15 17:47:02] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 1 ms to minimize.
[2023-03-15 17:47:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1375 ms
[2023-03-15 17:47:03] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 1 ms to minimize.
[2023-03-15 17:47:03] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 1 ms to minimize.
[2023-03-15 17:47:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 476 ms
[2023-03-15 17:47:03] [INFO ] Deduced a trap composed of 24 places in 220 ms of which 1 ms to minimize.
[2023-03-15 17:47:03] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 1 ms to minimize.
[2023-03-15 17:47:04] [INFO ] Deduced a trap composed of 46 places in 227 ms of which 1 ms to minimize.
[2023-03-15 17:47:04] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 0 ms to minimize.
[2023-03-15 17:47:04] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 1 ms to minimize.
[2023-03-15 17:47:04] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 0 ms to minimize.
[2023-03-15 17:47:05] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 0 ms to minimize.
[2023-03-15 17:47:05] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 1 ms to minimize.
[2023-03-15 17:47:05] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 1 ms to minimize.
[2023-03-15 17:47:05] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 1 ms to minimize.
[2023-03-15 17:47:05] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2023-03-15 17:47:05] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 0 ms to minimize.
[2023-03-15 17:47:06] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2694 ms
[2023-03-15 17:47:06] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 1 ms to minimize.
[2023-03-15 17:47:06] [INFO ] Deduced a trap composed of 52 places in 170 ms of which 1 ms to minimize.
[2023-03-15 17:47:06] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 0 ms to minimize.
[2023-03-15 17:47:07] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 1 ms to minimize.
[2023-03-15 17:47:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 976 ms
[2023-03-15 17:47:07] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 1 ms to minimize.
[2023-03-15 17:47:07] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 1 ms to minimize.
[2023-03-15 17:47:07] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 1 ms to minimize.
[2023-03-15 17:47:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 752 ms
[2023-03-15 17:47:08] [INFO ] Deduced a trap composed of 18 places in 231 ms of which 1 ms to minimize.
[2023-03-15 17:47:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2023-03-15 17:47:08] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 1 ms to minimize.
[2023-03-15 17:47:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-15 17:47:08] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 0 ms to minimize.
[2023-03-15 17:47:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2023-03-15 17:47:09] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 0 ms to minimize.
[2023-03-15 17:47:09] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 0 ms to minimize.
[2023-03-15 17:47:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 248 ms
[2023-03-15 17:47:09] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
[2023-03-15 17:47:09] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 1 ms to minimize.
[2023-03-15 17:47:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 306 ms
[2023-03-15 17:47:10] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2023-03-15 17:47:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2023-03-15 17:47:10] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
[2023-03-15 17:47:10] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 1 ms to minimize.
[2023-03-15 17:47:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 240 ms
[2023-03-15 17:47:11] [INFO ] Deduced a trap composed of 54 places in 123 ms of which 1 ms to minimize.
[2023-03-15 17:47:11] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 0 ms to minimize.
[2023-03-15 17:47:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 304 ms
[2023-03-15 17:47:12] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 1 ms to minimize.
[2023-03-15 17:47:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-03-15 17:47:12] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 0 ms to minimize.
[2023-03-15 17:47:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-03-15 17:47:12] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 1 ms to minimize.
[2023-03-15 17:47:12] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 1 ms to minimize.
[2023-03-15 17:47:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 252 ms
[2023-03-15 17:47:13] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 0 ms to minimize.
[2023-03-15 17:47:13] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 1 ms to minimize.
[2023-03-15 17:47:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 292 ms
[2023-03-15 17:47:13] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 0 ms to minimize.
[2023-03-15 17:47:13] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 0 ms to minimize.
[2023-03-15 17:47:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 333 ms
[2023-03-15 17:47:13] [INFO ] After 42095ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :86
Attempting to minimize the solution found.
Minimization took 3096 ms.
[2023-03-15 17:47:16] [INFO ] After 45896ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :86
Interrupted random walk after 904421 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=30 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 189) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 189) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 78765 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 188 properties.
[2023-03-15 17:49:10] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:49:10] [INFO ] Invariant cache hit.
[2023-03-15 17:49:11] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 17:49:19] [INFO ] After 5575ms SMT Verify possible using state equation in real domain returned unsat :0 sat :16 real:172
[2023-03-15 17:49:19] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:49:19] [INFO ] After 417ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:188
[2023-03-15 17:49:19] [INFO ] After 9206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:188
[2023-03-15 17:49:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-15 17:49:27] [INFO ] After 5221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :188
[2023-03-15 17:49:32] [INFO ] After 5058ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :188
[2023-03-15 17:49:32] [INFO ] Deduced a trap composed of 43 places in 248 ms of which 1 ms to minimize.
[2023-03-15 17:49:33] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 0 ms to minimize.
[2023-03-15 17:49:33] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 1 ms to minimize.
[2023-03-15 17:49:33] [INFO ] Deduced a trap composed of 52 places in 178 ms of which 1 ms to minimize.
[2023-03-15 17:49:33] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 1 ms to minimize.
[2023-03-15 17:49:33] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 0 ms to minimize.
[2023-03-15 17:49:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1381 ms
[2023-03-15 17:49:34] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 1 ms to minimize.
[2023-03-15 17:49:34] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 0 ms to minimize.
[2023-03-15 17:49:34] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 0 ms to minimize.
[2023-03-15 17:49:34] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 0 ms to minimize.
[2023-03-15 17:49:34] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2023-03-15 17:49:35] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 0 ms to minimize.
[2023-03-15 17:49:35] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 1 ms to minimize.
[2023-03-15 17:49:35] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 1 ms to minimize.
[2023-03-15 17:49:35] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 0 ms to minimize.
[2023-03-15 17:49:35] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1596 ms
[2023-03-15 17:49:35] [INFO ] Deduced a trap composed of 18 places in 220 ms of which 1 ms to minimize.
[2023-03-15 17:49:36] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 1 ms to minimize.
[2023-03-15 17:49:36] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 1 ms to minimize.
[2023-03-15 17:49:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 742 ms
[2023-03-15 17:49:36] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 1 ms to minimize.
[2023-03-15 17:49:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2023-03-15 17:49:37] [INFO ] Deduced a trap composed of 44 places in 207 ms of which 1 ms to minimize.
[2023-03-15 17:49:37] [INFO ] Deduced a trap composed of 32 places in 220 ms of which 1 ms to minimize.
[2023-03-15 17:49:37] [INFO ] Deduced a trap composed of 36 places in 184 ms of which 1 ms to minimize.
[2023-03-15 17:49:37] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 1 ms to minimize.
[2023-03-15 17:49:37] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 0 ms to minimize.
[2023-03-15 17:49:38] [INFO ] Deduced a trap composed of 30 places in 191 ms of which 1 ms to minimize.
[2023-03-15 17:49:38] [INFO ] Deduced a trap composed of 30 places in 188 ms of which 1 ms to minimize.
[2023-03-15 17:49:38] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 1 ms to minimize.
[2023-03-15 17:49:38] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 0 ms to minimize.
[2023-03-15 17:49:38] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2032 ms
[2023-03-15 17:49:39] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 0 ms to minimize.
[2023-03-15 17:49:39] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 1 ms to minimize.
[2023-03-15 17:49:39] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 1 ms to minimize.
[2023-03-15 17:49:39] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 1 ms to minimize.
[2023-03-15 17:49:39] [INFO ] Deduced a trap composed of 48 places in 144 ms of which 1 ms to minimize.
[2023-03-15 17:49:40] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 1 ms to minimize.
[2023-03-15 17:49:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1137 ms
[2023-03-15 17:49:40] [INFO ] Deduced a trap composed of 13 places in 248 ms of which 0 ms to minimize.
[2023-03-15 17:49:40] [INFO ] Deduced a trap composed of 13 places in 262 ms of which 1 ms to minimize.
[2023-03-15 17:49:40] [INFO ] Deduced a trap composed of 9 places in 247 ms of which 1 ms to minimize.
[2023-03-15 17:49:41] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 1 ms to minimize.
[2023-03-15 17:49:41] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 1 ms to minimize.
[2023-03-15 17:49:41] [INFO ] Deduced a trap composed of 26 places in 212 ms of which 0 ms to minimize.
[2023-03-15 17:49:41] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 1 ms to minimize.
[2023-03-15 17:49:42] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 0 ms to minimize.
[2023-03-15 17:49:42] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 1 ms to minimize.
[2023-03-15 17:49:42] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 0 ms to minimize.
[2023-03-15 17:49:42] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 1 ms to minimize.
[2023-03-15 17:49:42] [INFO ] Deduced a trap composed of 52 places in 178 ms of which 1 ms to minimize.
[2023-03-15 17:49:43] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 1 ms to minimize.
[2023-03-15 17:49:43] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 1 ms to minimize.
[2023-03-15 17:49:43] [INFO ] Deduced a trap composed of 40 places in 178 ms of which 0 ms to minimize.
[2023-03-15 17:49:43] [INFO ] Deduced a trap composed of 51 places in 189 ms of which 0 ms to minimize.
[2023-03-15 17:49:43] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 0 ms to minimize.
[2023-03-15 17:49:44] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 0 ms to minimize.
[2023-03-15 17:49:44] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 1 ms to minimize.
[2023-03-15 17:49:44] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4168 ms
[2023-03-15 17:49:44] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 0 ms to minimize.
[2023-03-15 17:49:44] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2023-03-15 17:49:44] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 0 ms to minimize.
[2023-03-15 17:49:44] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2023-03-15 17:49:45] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 1 ms to minimize.
[2023-03-15 17:49:45] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 1 ms to minimize.
[2023-03-15 17:49:45] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 1 ms to minimize.
[2023-03-15 17:49:45] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 1 ms to minimize.
[2023-03-15 17:49:45] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 1 ms to minimize.
[2023-03-15 17:49:45] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2023-03-15 17:49:46] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2023-03-15 17:49:46] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1775 ms
[2023-03-15 17:49:46] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 1 ms to minimize.
[2023-03-15 17:49:46] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 1 ms to minimize.
[2023-03-15 17:49:46] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 1 ms to minimize.
[2023-03-15 17:49:47] [INFO ] Deduced a trap composed of 34 places in 235 ms of which 1 ms to minimize.
[2023-03-15 17:49:47] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 1 ms to minimize.
[2023-03-15 17:49:47] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 1 ms to minimize.
[2023-03-15 17:49:47] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 0 ms to minimize.
[2023-03-15 17:49:47] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 1 ms to minimize.
[2023-03-15 17:49:48] [INFO ] Deduced a trap composed of 27 places in 235 ms of which 1 ms to minimize.
[2023-03-15 17:49:48] [INFO ] Deduced a trap composed of 29 places in 236 ms of which 1 ms to minimize.
[2023-03-15 17:49:48] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 0 ms to minimize.
[2023-03-15 17:49:48] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 0 ms to minimize.
[2023-03-15 17:49:48] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 0 ms to minimize.
[2023-03-15 17:49:48] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 1 ms to minimize.
[2023-03-15 17:49:49] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 1 ms to minimize.
[2023-03-15 17:49:49] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2975 ms
[2023-03-15 17:49:49] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 0 ms to minimize.
[2023-03-15 17:49:49] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 1 ms to minimize.
[2023-03-15 17:49:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 297 ms
[2023-03-15 17:49:49] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 1 ms to minimize.
[2023-03-15 17:49:49] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 1 ms to minimize.
[2023-03-15 17:49:50] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 1 ms to minimize.
[2023-03-15 17:49:50] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 1 ms to minimize.
[2023-03-15 17:49:50] [INFO ] Deduced a trap composed of 24 places in 192 ms of which 0 ms to minimize.
[2023-03-15 17:49:50] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 1 ms to minimize.
[2023-03-15 17:49:51] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 0 ms to minimize.
[2023-03-15 17:49:51] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 0 ms to minimize.
[2023-03-15 17:49:51] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 1 ms to minimize.
[2023-03-15 17:49:51] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 1 ms to minimize.
[2023-03-15 17:49:51] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 1 ms to minimize.
[2023-03-15 17:49:52] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 0 ms to minimize.
[2023-03-15 17:49:52] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 1 ms to minimize.
[2023-03-15 17:49:52] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2687 ms
[2023-03-15 17:49:52] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 0 ms to minimize.
[2023-03-15 17:49:52] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 1 ms to minimize.
[2023-03-15 17:49:52] [INFO ] Deduced a trap composed of 17 places in 228 ms of which 1 ms to minimize.
[2023-03-15 17:49:53] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 0 ms to minimize.
[2023-03-15 17:49:53] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 0 ms to minimize.
[2023-03-15 17:49:53] [INFO ] Deduced a trap composed of 16 places in 192 ms of which 1 ms to minimize.
[2023-03-15 17:49:53] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 0 ms to minimize.
[2023-03-15 17:49:54] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 1 ms to minimize.
[2023-03-15 17:49:54] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 1 ms to minimize.
[2023-03-15 17:49:54] [INFO ] Deduced a trap composed of 53 places in 195 ms of which 1 ms to minimize.
[2023-03-15 17:49:54] [INFO ] Deduced a trap composed of 39 places in 186 ms of which 0 ms to minimize.
[2023-03-15 17:49:55] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 1 ms to minimize.
[2023-03-15 17:49:55] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2803 ms
[2023-03-15 17:49:55] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 1 ms to minimize.
[2023-03-15 17:49:55] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 1 ms to minimize.
[2023-03-15 17:49:55] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 0 ms to minimize.
[2023-03-15 17:49:55] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 1 ms to minimize.
[2023-03-15 17:49:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 692 ms
[2023-03-15 17:49:56] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 1 ms to minimize.
[2023-03-15 17:49:56] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 1 ms to minimize.
[2023-03-15 17:49:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 386 ms
[2023-03-15 17:49:56] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 0 ms to minimize.
[2023-03-15 17:49:56] [INFO ] Deduced a trap composed of 35 places in 253 ms of which 0 ms to minimize.
[2023-03-15 17:49:57] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 1 ms to minimize.
[2023-03-15 17:49:57] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 1 ms to minimize.
[2023-03-15 17:49:57] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 1 ms to minimize.
[2023-03-15 17:49:58] [INFO ] Deduced a trap composed of 16 places in 267 ms of which 0 ms to minimize.
[2023-03-15 17:49:58] [INFO ] Deduced a trap composed of 9 places in 250 ms of which 1 ms to minimize.
[2023-03-15 17:49:58] [INFO ] Deduced a trap composed of 37 places in 214 ms of which 1 ms to minimize.
[2023-03-15 17:49:58] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 0 ms to minimize.
[2023-03-15 17:49:59] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 1 ms to minimize.
[2023-03-15 17:49:59] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 0 ms to minimize.
[2023-03-15 17:49:59] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 1 ms to minimize.
[2023-03-15 17:49:59] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 0 ms to minimize.
[2023-03-15 17:49:59] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 0 ms to minimize.
[2023-03-15 17:49:59] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 1 ms to minimize.
[2023-03-15 17:50:00] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 0 ms to minimize.
[2023-03-15 17:50:00] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 1 ms to minimize.
[2023-03-15 17:50:00] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 1 ms to minimize.
[2023-03-15 17:50:00] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 1 ms to minimize.
[2023-03-15 17:50:00] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 1 ms to minimize.
[2023-03-15 17:50:01] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 0 ms to minimize.
[2023-03-15 17:50:01] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 1 ms to minimize.
[2023-03-15 17:50:01] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 0 ms to minimize.
[2023-03-15 17:50:01] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 5112 ms
[2023-03-15 17:50:01] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 1 ms to minimize.
[2023-03-15 17:50:02] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 1 ms to minimize.
[2023-03-15 17:50:02] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 0 ms to minimize.
[2023-03-15 17:50:02] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 0 ms to minimize.
[2023-03-15 17:50:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1037 ms
[2023-03-15 17:50:03] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 1 ms to minimize.
[2023-03-15 17:50:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2023-03-15 17:50:04] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 0 ms to minimize.
[2023-03-15 17:50:04] [INFO ] Deduced a trap composed of 48 places in 238 ms of which 1 ms to minimize.
[2023-03-15 17:50:04] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 1 ms to minimize.
[2023-03-15 17:50:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 749 ms
[2023-03-15 17:50:05] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 1 ms to minimize.
[2023-03-15 17:50:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2023-03-15 17:50:06] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2023-03-15 17:50:06] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 1 ms to minimize.
[2023-03-15 17:50:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 355 ms
[2023-03-15 17:50:06] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2023-03-15 17:50:06] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 0 ms to minimize.
[2023-03-15 17:50:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 273 ms
[2023-03-15 17:50:06] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 1 ms to minimize.
[2023-03-15 17:50:07] [INFO ] Deduced a trap composed of 39 places in 200 ms of which 1 ms to minimize.
[2023-03-15 17:50:07] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 0 ms to minimize.
[2023-03-15 17:50:07] [INFO ] Deduced a trap composed of 33 places in 192 ms of which 1 ms to minimize.
[2023-03-15 17:50:07] [INFO ] Deduced a trap composed of 32 places in 186 ms of which 1 ms to minimize.
[2023-03-15 17:50:08] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 1 ms to minimize.
[2023-03-15 17:50:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1401 ms
[2023-03-15 17:50:08] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 1 ms to minimize.
[2023-03-15 17:50:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 303 ms
[2023-03-15 17:50:08] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 1 ms to minimize.
[2023-03-15 17:50:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-15 17:50:09] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 0 ms to minimize.
[2023-03-15 17:50:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-03-15 17:50:09] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2023-03-15 17:50:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-15 17:50:10] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 1 ms to minimize.
[2023-03-15 17:50:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2023-03-15 17:50:10] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 0 ms to minimize.
[2023-03-15 17:50:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-15 17:50:11] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 1 ms to minimize.
[2023-03-15 17:50:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2023-03-15 17:50:11] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 1 ms to minimize.
[2023-03-15 17:50:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-03-15 17:50:12] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 1 ms to minimize.
[2023-03-15 17:50:12] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 0 ms to minimize.
[2023-03-15 17:50:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 328 ms
[2023-03-15 17:50:13] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 0 ms to minimize.
[2023-03-15 17:50:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-03-15 17:50:14] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 1 ms to minimize.
[2023-03-15 17:50:14] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 0 ms to minimize.
[2023-03-15 17:50:15] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 0 ms to minimize.
[2023-03-15 17:50:15] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 0 ms to minimize.
[2023-03-15 17:50:15] [INFO ] Deduced a trap composed of 50 places in 167 ms of which 0 ms to minimize.
[2023-03-15 17:50:15] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 1 ms to minimize.
[2023-03-15 17:50:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1253 ms
[2023-03-15 17:50:16] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 1 ms to minimize.
[2023-03-15 17:50:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2023-03-15 17:50:16] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 1 ms to minimize.
[2023-03-15 17:50:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2023-03-15 17:50:17] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 1 ms to minimize.
[2023-03-15 17:50:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-03-15 17:50:18] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 1 ms to minimize.
[2023-03-15 17:50:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2023-03-15 17:50:19] [INFO ] Deduced a trap composed of 58 places in 190 ms of which 1 ms to minimize.
[2023-03-15 17:50:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2023-03-15 17:50:19] [INFO ] Deduced a trap composed of 53 places in 138 ms of which 1 ms to minimize.
[2023-03-15 17:50:19] [INFO ] Deduced a trap composed of 54 places in 175 ms of which 1 ms to minimize.
[2023-03-15 17:50:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 422 ms
[2023-03-15 17:50:20] [INFO ] Deduced a trap composed of 28 places in 196 ms of which 1 ms to minimize.
[2023-03-15 17:50:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2023-03-15 17:50:21] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 0 ms to minimize.
[2023-03-15 17:50:21] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 1 ms to minimize.
[2023-03-15 17:50:22] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 1 ms to minimize.
[2023-03-15 17:50:22] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 1 ms to minimize.
[2023-03-15 17:50:22] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 1 ms to minimize.
[2023-03-15 17:50:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1146 ms
[2023-03-15 17:50:23] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 0 ms to minimize.
[2023-03-15 17:50:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2023-03-15 17:50:24] [INFO ] Deduced a trap composed of 27 places in 223 ms of which 1 ms to minimize.
[2023-03-15 17:50:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
[2023-03-15 17:50:24] [INFO ] Deduced a trap composed of 29 places in 197 ms of which 0 ms to minimize.
[2023-03-15 17:50:25] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 1 ms to minimize.
[2023-03-15 17:50:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 479 ms
[2023-03-15 17:50:25] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 1 ms to minimize.
[2023-03-15 17:50:25] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 1 ms to minimize.
[2023-03-15 17:50:25] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 0 ms to minimize.
[2023-03-15 17:50:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 708 ms
[2023-03-15 17:50:26] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 1 ms to minimize.
[2023-03-15 17:50:27] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 0 ms to minimize.
[2023-03-15 17:50:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 583 ms
[2023-03-15 17:50:28] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 1 ms to minimize.
[2023-03-15 17:50:28] [INFO ] Deduced a trap composed of 54 places in 178 ms of which 1 ms to minimize.
[2023-03-15 17:50:28] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 1 ms to minimize.
[2023-03-15 17:50:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 662 ms
[2023-03-15 17:50:28] [INFO ] Deduced a trap composed of 64 places in 212 ms of which 0 ms to minimize.
[2023-03-15 17:50:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2023-03-15 17:50:31] [INFO ] Deduced a trap composed of 49 places in 225 ms of which 1 ms to minimize.
[2023-03-15 17:50:31] [INFO ] Deduced a trap composed of 26 places in 220 ms of which 1 ms to minimize.
[2023-03-15 17:50:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 549 ms
[2023-03-15 17:50:32] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 1 ms to minimize.
[2023-03-15 17:50:32] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 0 ms to minimize.
[2023-03-15 17:50:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 522 ms
[2023-03-15 17:50:33] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 1 ms to minimize.
[2023-03-15 17:50:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2023-03-15 17:50:35] [INFO ] After 68019ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :188
Attempting to minimize the solution found.
Minimization took 16422 ms.
[2023-03-15 17:50:51] [INFO ] After 92360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :188
Fused 188 Parikh solutions to 185 different solutions.
Parikh walk visited 0 properties in 1900 ms.
Support contains 153 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 906681 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=30 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 188) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 77909 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 188 properties.
[2023-03-15 17:52:44] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:52:44] [INFO ] Invariant cache hit.
[2023-03-15 17:52:45] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 17:52:53] [INFO ] After 6103ms SMT Verify possible using state equation in real domain returned unsat :0 sat :16 real:172
[2023-03-15 17:52:53] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:52:54] [INFO ] After 648ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:188
[2023-03-15 17:52:54] [INFO ] After 9879ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:188
[2023-03-15 17:52:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 17:53:02] [INFO ] After 5446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :188
[2023-03-15 17:53:08] [INFO ] After 5751ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :188
[2023-03-15 17:53:08] [INFO ] Deduced a trap composed of 43 places in 266 ms of which 1 ms to minimize.
[2023-03-15 17:53:09] [INFO ] Deduced a trap composed of 9 places in 261 ms of which 1 ms to minimize.
[2023-03-15 17:53:09] [INFO ] Deduced a trap composed of 10 places in 238 ms of which 1 ms to minimize.
[2023-03-15 17:53:09] [INFO ] Deduced a trap composed of 52 places in 226 ms of which 1 ms to minimize.
[2023-03-15 17:53:09] [INFO ] Deduced a trap composed of 34 places in 228 ms of which 0 ms to minimize.
[2023-03-15 17:53:10] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 1 ms to minimize.
[2023-03-15 17:53:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1655 ms
[2023-03-15 17:53:10] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 1 ms to minimize.
[2023-03-15 17:53:10] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 1 ms to minimize.
[2023-03-15 17:53:11] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 1 ms to minimize.
[2023-03-15 17:53:11] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 1 ms to minimize.
[2023-03-15 17:53:11] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 1 ms to minimize.
[2023-03-15 17:53:11] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 0 ms to minimize.
[2023-03-15 17:53:11] [INFO ] Deduced a trap composed of 48 places in 193 ms of which 1 ms to minimize.
[2023-03-15 17:53:12] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 1 ms to minimize.
[2023-03-15 17:53:12] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 1 ms to minimize.
[2023-03-15 17:53:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2032 ms
[2023-03-15 17:53:12] [INFO ] Deduced a trap composed of 18 places in 199 ms of which 0 ms to minimize.
[2023-03-15 17:53:12] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 0 ms to minimize.
[2023-03-15 17:53:13] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 0 ms to minimize.
[2023-03-15 17:53:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 682 ms
[2023-03-15 17:53:13] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 1 ms to minimize.
[2023-03-15 17:53:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2023-03-15 17:53:13] [INFO ] Deduced a trap composed of 44 places in 199 ms of which 1 ms to minimize.
[2023-03-15 17:53:13] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 0 ms to minimize.
[2023-03-15 17:53:14] [INFO ] Deduced a trap composed of 36 places in 182 ms of which 1 ms to minimize.
[2023-03-15 17:53:14] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 0 ms to minimize.
[2023-03-15 17:53:14] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 1 ms to minimize.
[2023-03-15 17:53:14] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 1 ms to minimize.
[2023-03-15 17:53:15] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 1 ms to minimize.
[2023-03-15 17:53:15] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 1 ms to minimize.
[2023-03-15 17:53:15] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 1 ms to minimize.
[2023-03-15 17:53:15] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1963 ms
[2023-03-15 17:53:15] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 1 ms to minimize.
[2023-03-15 17:53:15] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 0 ms to minimize.
[2023-03-15 17:53:16] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 1 ms to minimize.
[2023-03-15 17:53:16] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 0 ms to minimize.
[2023-03-15 17:53:16] [INFO ] Deduced a trap composed of 48 places in 140 ms of which 0 ms to minimize.
[2023-03-15 17:53:16] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 1 ms to minimize.
[2023-03-15 17:53:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1090 ms
[2023-03-15 17:53:16] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 1 ms to minimize.
[2023-03-15 17:53:17] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 1 ms to minimize.
[2023-03-15 17:53:17] [INFO ] Deduced a trap composed of 9 places in 236 ms of which 1 ms to minimize.
[2023-03-15 17:53:17] [INFO ] Deduced a trap composed of 33 places in 205 ms of which 1 ms to minimize.
[2023-03-15 17:53:17] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 0 ms to minimize.
[2023-03-15 17:53:18] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 1 ms to minimize.
[2023-03-15 17:53:18] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 0 ms to minimize.
[2023-03-15 17:53:18] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 0 ms to minimize.
[2023-03-15 17:53:18] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 1 ms to minimize.
[2023-03-15 17:53:18] [INFO ] Deduced a trap composed of 52 places in 160 ms of which 1 ms to minimize.
[2023-03-15 17:53:19] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 0 ms to minimize.
[2023-03-15 17:53:19] [INFO ] Deduced a trap composed of 52 places in 163 ms of which 1 ms to minimize.
[2023-03-15 17:53:19] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 1 ms to minimize.
[2023-03-15 17:53:19] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 1 ms to minimize.
[2023-03-15 17:53:19] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 0 ms to minimize.
[2023-03-15 17:53:20] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 1 ms to minimize.
[2023-03-15 17:53:20] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 1 ms to minimize.
[2023-03-15 17:53:20] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 0 ms to minimize.
[2023-03-15 17:53:20] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 1 ms to minimize.
[2023-03-15 17:53:20] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3948 ms
[2023-03-15 17:53:20] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 0 ms to minimize.
[2023-03-15 17:53:20] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2023-03-15 17:53:20] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2023-03-15 17:53:21] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2023-03-15 17:53:21] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 1 ms to minimize.
[2023-03-15 17:53:21] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 1 ms to minimize.
[2023-03-15 17:53:21] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 1 ms to minimize.
[2023-03-15 17:53:21] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 1 ms to minimize.
[2023-03-15 17:53:22] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 1 ms to minimize.
[2023-03-15 17:53:22] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2023-03-15 17:53:22] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 0 ms to minimize.
[2023-03-15 17:53:22] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1707 ms
[2023-03-15 17:53:22] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 1 ms to minimize.
[2023-03-15 17:53:22] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 0 ms to minimize.
[2023-03-15 17:53:22] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 1 ms to minimize.
[2023-03-15 17:53:23] [INFO ] Deduced a trap composed of 34 places in 226 ms of which 1 ms to minimize.
[2023-03-15 17:53:23] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 1 ms to minimize.
[2023-03-15 17:53:23] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 1 ms to minimize.
[2023-03-15 17:53:23] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 0 ms to minimize.
[2023-03-15 17:53:23] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 0 ms to minimize.
[2023-03-15 17:53:24] [INFO ] Deduced a trap composed of 27 places in 226 ms of which 1 ms to minimize.
[2023-03-15 17:53:24] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 0 ms to minimize.
[2023-03-15 17:53:24] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 1 ms to minimize.
[2023-03-15 17:53:24] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 0 ms to minimize.
[2023-03-15 17:53:24] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 1 ms to minimize.
[2023-03-15 17:53:24] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 1 ms to minimize.
[2023-03-15 17:53:25] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 0 ms to minimize.
[2023-03-15 17:53:25] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2795 ms
[2023-03-15 17:53:25] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 1 ms to minimize.
[2023-03-15 17:53:25] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 0 ms to minimize.
[2023-03-15 17:53:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 299 ms
[2023-03-15 17:53:25] [INFO ] Deduced a trap composed of 9 places in 226 ms of which 1 ms to minimize.
[2023-03-15 17:53:25] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 1 ms to minimize.
[2023-03-15 17:53:26] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 0 ms to minimize.
[2023-03-15 17:53:26] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 1 ms to minimize.
[2023-03-15 17:53:26] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 1 ms to minimize.
[2023-03-15 17:53:26] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 1 ms to minimize.
[2023-03-15 17:53:27] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 1 ms to minimize.
[2023-03-15 17:53:27] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 0 ms to minimize.
[2023-03-15 17:53:27] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 1 ms to minimize.
[2023-03-15 17:53:27] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 1 ms to minimize.
[2023-03-15 17:53:27] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 1 ms to minimize.
[2023-03-15 17:53:27] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 0 ms to minimize.
[2023-03-15 17:53:28] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 1 ms to minimize.
[2023-03-15 17:53:28] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2594 ms
[2023-03-15 17:53:28] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 1 ms to minimize.
[2023-03-15 17:53:28] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 0 ms to minimize.
[2023-03-15 17:53:28] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 1 ms to minimize.
[2023-03-15 17:53:28] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 1 ms to minimize.
[2023-03-15 17:53:29] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 1 ms to minimize.
[2023-03-15 17:53:29] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 1 ms to minimize.
[2023-03-15 17:53:29] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 1 ms to minimize.
[2023-03-15 17:53:29] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 0 ms to minimize.
[2023-03-15 17:53:30] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 0 ms to minimize.
[2023-03-15 17:53:30] [INFO ] Deduced a trap composed of 53 places in 183 ms of which 0 ms to minimize.
[2023-03-15 17:53:30] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 1 ms to minimize.
[2023-03-15 17:53:30] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 1 ms to minimize.
[2023-03-15 17:53:30] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2696 ms
[2023-03-15 17:53:31] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 0 ms to minimize.
[2023-03-15 17:53:31] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 1 ms to minimize.
[2023-03-15 17:53:31] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 1 ms to minimize.
[2023-03-15 17:53:31] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 1 ms to minimize.
[2023-03-15 17:53:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 668 ms
[2023-03-15 17:53:31] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 0 ms to minimize.
[2023-03-15 17:53:32] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 1 ms to minimize.
[2023-03-15 17:53:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 396 ms
[2023-03-15 17:53:32] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 1 ms to minimize.
[2023-03-15 17:53:32] [INFO ] Deduced a trap composed of 35 places in 250 ms of which 1 ms to minimize.
[2023-03-15 17:53:33] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 0 ms to minimize.
[2023-03-15 17:53:33] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 1 ms to minimize.
[2023-03-15 17:53:33] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 1 ms to minimize.
[2023-03-15 17:53:33] [INFO ] Deduced a trap composed of 16 places in 199 ms of which 1 ms to minimize.
[2023-03-15 17:53:34] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 1 ms to minimize.
[2023-03-15 17:53:34] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 1 ms to minimize.
[2023-03-15 17:53:34] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 0 ms to minimize.
[2023-03-15 17:53:34] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 0 ms to minimize.
[2023-03-15 17:53:34] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 1 ms to minimize.
[2023-03-15 17:53:35] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 1 ms to minimize.
[2023-03-15 17:53:35] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 0 ms to minimize.
[2023-03-15 17:53:35] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 1 ms to minimize.
[2023-03-15 17:53:35] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 1 ms to minimize.
[2023-03-15 17:53:35] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2023-03-15 17:53:36] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 1 ms to minimize.
[2023-03-15 17:53:36] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 1 ms to minimize.
[2023-03-15 17:53:36] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 1 ms to minimize.
[2023-03-15 17:53:36] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 0 ms to minimize.
[2023-03-15 17:53:36] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 1 ms to minimize.
[2023-03-15 17:53:37] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 0 ms to minimize.
[2023-03-15 17:53:37] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 1 ms to minimize.
[2023-03-15 17:53:37] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 5056 ms
[2023-03-15 17:53:37] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 1 ms to minimize.
[2023-03-15 17:53:37] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 1 ms to minimize.
[2023-03-15 17:53:37] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 0 ms to minimize.
[2023-03-15 17:53:38] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 1 ms to minimize.
[2023-03-15 17:53:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 984 ms
[2023-03-15 17:53:39] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 0 ms to minimize.
[2023-03-15 17:53:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2023-03-15 17:53:39] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 1 ms to minimize.
[2023-03-15 17:53:40] [INFO ] Deduced a trap composed of 48 places in 217 ms of which 1 ms to minimize.
[2023-03-15 17:53:40] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 0 ms to minimize.
[2023-03-15 17:53:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 699 ms
[2023-03-15 17:53:41] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 1 ms to minimize.
[2023-03-15 17:53:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2023-03-15 17:53:41] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 1 ms to minimize.
[2023-03-15 17:53:41] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 0 ms to minimize.
[2023-03-15 17:53:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 370 ms
[2023-03-15 17:53:42] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 0 ms to minimize.
[2023-03-15 17:53:42] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2023-03-15 17:53:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 266 ms
[2023-03-15 17:53:42] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 1 ms to minimize.
[2023-03-15 17:53:42] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 1 ms to minimize.
[2023-03-15 17:53:42] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 0 ms to minimize.
[2023-03-15 17:53:43] [INFO ] Deduced a trap composed of 33 places in 183 ms of which 1 ms to minimize.
[2023-03-15 17:53:43] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 1 ms to minimize.
[2023-03-15 17:53:43] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 0 ms to minimize.
[2023-03-15 17:53:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1368 ms
[2023-03-15 17:53:43] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 1 ms to minimize.
[2023-03-15 17:53:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2023-03-15 17:53:44] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 1 ms to minimize.
[2023-03-15 17:53:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-15 17:53:44] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2023-03-15 17:53:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-03-15 17:53:45] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2023-03-15 17:53:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-03-15 17:53:45] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 1 ms to minimize.
[2023-03-15 17:53:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2023-03-15 17:53:46] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 0 ms to minimize.
[2023-03-15 17:53:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-15 17:53:46] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 0 ms to minimize.
[2023-03-15 17:53:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-03-15 17:53:46] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 0 ms to minimize.
[2023-03-15 17:53:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2023-03-15 17:53:47] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 1 ms to minimize.
[2023-03-15 17:53:47] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 1 ms to minimize.
[2023-03-15 17:53:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 286 ms
[2023-03-15 17:53:48] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 0 ms to minimize.
[2023-03-15 17:53:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2023-03-15 17:53:49] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 1 ms to minimize.
[2023-03-15 17:53:49] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 0 ms to minimize.
[2023-03-15 17:53:49] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 1 ms to minimize.
[2023-03-15 17:53:49] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 0 ms to minimize.
[2023-03-15 17:53:49] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 0 ms to minimize.
[2023-03-15 17:53:50] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 0 ms to minimize.
[2023-03-15 17:53:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 921 ms
[2023-03-15 17:53:50] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 1 ms to minimize.
[2023-03-15 17:53:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-03-15 17:53:50] [INFO ] Deduced a trap composed of 49 places in 165 ms of which 1 ms to minimize.
[2023-03-15 17:53:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2023-03-15 17:53:51] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 1 ms to minimize.
[2023-03-15 17:53:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-03-15 17:53:52] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 0 ms to minimize.
[2023-03-15 17:53:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2023-03-15 17:53:52] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 0 ms to minimize.
[2023-03-15 17:53:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-03-15 17:53:52] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 0 ms to minimize.
[2023-03-15 17:53:52] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 1 ms to minimize.
[2023-03-15 17:53:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 266 ms
[2023-03-15 17:53:53] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 0 ms to minimize.
[2023-03-15 17:53:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-03-15 17:53:53] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
[2023-03-15 17:53:54] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 0 ms to minimize.
[2023-03-15 17:53:54] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 0 ms to minimize.
[2023-03-15 17:53:54] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 0 ms to minimize.
[2023-03-15 17:53:54] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 0 ms to minimize.
[2023-03-15 17:53:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 681 ms
[2023-03-15 17:53:54] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2023-03-15 17:53:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-15 17:53:55] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 1 ms to minimize.
[2023-03-15 17:53:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2023-03-15 17:53:55] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 1 ms to minimize.
[2023-03-15 17:53:56] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 1 ms to minimize.
[2023-03-15 17:53:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 288 ms
[2023-03-15 17:53:56] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 0 ms to minimize.
[2023-03-15 17:53:56] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 1 ms to minimize.
[2023-03-15 17:53:56] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 1 ms to minimize.
[2023-03-15 17:53:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 446 ms
[2023-03-15 17:53:57] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 0 ms to minimize.
[2023-03-15 17:53:57] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 1 ms to minimize.
[2023-03-15 17:53:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 335 ms
[2023-03-15 17:53:57] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 1 ms to minimize.
[2023-03-15 17:53:58] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 2 ms to minimize.
[2023-03-15 17:53:58] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 1 ms to minimize.
[2023-03-15 17:53:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 398 ms
[2023-03-15 17:53:58] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 0 ms to minimize.
[2023-03-15 17:53:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-15 17:54:00] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 1 ms to minimize.
[2023-03-15 17:54:00] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 1 ms to minimize.
[2023-03-15 17:54:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 305 ms
[2023-03-15 17:54:00] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 0 ms to minimize.
[2023-03-15 17:54:00] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 1 ms to minimize.
[2023-03-15 17:54:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 296 ms
[2023-03-15 17:54:01] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 1 ms to minimize.
[2023-03-15 17:54:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-15 17:54:02] [INFO ] After 59879ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :188
Attempting to minimize the solution found.
Minimization took 11912 ms.
[2023-03-15 17:54:14] [INFO ] After 80478ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :188
Fused 188 Parikh solutions to 185 different solutions.
Parikh walk visited 0 properties in 2026 ms.
Support contains 153 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 17:54:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:54:16] [INFO ] Invariant cache hit.
[2023-03-15 17:54:16] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-15 17:54:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:54:16] [INFO ] Invariant cache hit.
[2023-03-15 17:54:16] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:54:17] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
[2023-03-15 17:54:17] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-15 17:54:17] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:54:17] [INFO ] Invariant cache hit.
[2023-03-15 17:54:17] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1448 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 3466 ms. (steps per millisecond=28 ) properties (out of 153) seen :70
Running SMT prover for 83 properties.
[2023-03-15 17:54:21] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:54:21] [INFO ] Invariant cache hit.
[2023-03-15 17:54:21] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 17:54:21] [INFO ] After 300ms SMT Verify possible using state equation in real domain returned unsat :0 sat :83
[2023-03-15 17:54:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:54:22] [INFO ] After 305ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :83
[2023-03-15 17:54:22] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 1 ms to minimize.
[2023-03-15 17:54:22] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 1 ms to minimize.
[2023-03-15 17:54:22] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 1 ms to minimize.
[2023-03-15 17:54:22] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 1 ms to minimize.
[2023-03-15 17:54:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 610 ms
[2023-03-15 17:54:23] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 0 ms to minimize.
[2023-03-15 17:54:23] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2023-03-15 17:54:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 179 ms
[2023-03-15 17:54:23] [INFO ] Deduced a trap composed of 48 places in 141 ms of which 0 ms to minimize.
[2023-03-15 17:54:23] [INFO ] Deduced a trap composed of 47 places in 142 ms of which 1 ms to minimize.
[2023-03-15 17:54:23] [INFO ] Deduced a trap composed of 57 places in 198 ms of which 1 ms to minimize.
[2023-03-15 17:54:24] [INFO ] Deduced a trap composed of 52 places in 224 ms of which 1 ms to minimize.
[2023-03-15 17:54:24] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 0 ms to minimize.
[2023-03-15 17:54:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1030 ms
[2023-03-15 17:54:24] [INFO ] Deduced a trap composed of 65 places in 141 ms of which 0 ms to minimize.
[2023-03-15 17:54:24] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 1 ms to minimize.
[2023-03-15 17:54:25] [INFO ] Deduced a trap composed of 56 places in 244 ms of which 1 ms to minimize.
[2023-03-15 17:54:25] [INFO ] Deduced a trap composed of 71 places in 247 ms of which 1 ms to minimize.
[2023-03-15 17:54:25] [INFO ] Deduced a trap composed of 47 places in 198 ms of which 1 ms to minimize.
[2023-03-15 17:54:25] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 1 ms to minimize.
[2023-03-15 17:54:25] [INFO ] Deduced a trap composed of 49 places in 165 ms of which 1 ms to minimize.
[2023-03-15 17:54:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1580 ms
[2023-03-15 17:54:26] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 1 ms to minimize.
[2023-03-15 17:54:26] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 0 ms to minimize.
[2023-03-15 17:54:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 357 ms
[2023-03-15 17:54:26] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 1 ms to minimize.
[2023-03-15 17:54:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2023-03-15 17:54:26] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 0 ms to minimize.
[2023-03-15 17:54:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-15 17:54:27] [INFO ] Deduced a trap composed of 39 places in 200 ms of which 1 ms to minimize.
[2023-03-15 17:54:27] [INFO ] Deduced a trap composed of 39 places in 227 ms of which 0 ms to minimize.
[2023-03-15 17:54:27] [INFO ] Deduced a trap composed of 33 places in 224 ms of which 1 ms to minimize.
[2023-03-15 17:54:28] [INFO ] Deduced a trap composed of 44 places in 235 ms of which 1 ms to minimize.
[2023-03-15 17:54:28] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 1 ms to minimize.
[2023-03-15 17:54:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1278 ms
[2023-03-15 17:54:28] [INFO ] Deduced a trap composed of 77 places in 181 ms of which 1 ms to minimize.
[2023-03-15 17:54:28] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 1 ms to minimize.
[2023-03-15 17:54:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 399 ms
[2023-03-15 17:54:29] [INFO ] Deduced a trap composed of 58 places in 232 ms of which 0 ms to minimize.
[2023-03-15 17:54:29] [INFO ] Deduced a trap composed of 47 places in 230 ms of which 1 ms to minimize.
[2023-03-15 17:54:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 577 ms
[2023-03-15 17:54:29] [INFO ] Deduced a trap composed of 44 places in 202 ms of which 0 ms to minimize.
[2023-03-15 17:54:30] [INFO ] Deduced a trap composed of 49 places in 185 ms of which 1 ms to minimize.
[2023-03-15 17:54:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 506 ms
[2023-03-15 17:54:30] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 1 ms to minimize.
[2023-03-15 17:54:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2023-03-15 17:54:31] [INFO ] Deduced a trap composed of 20 places in 210 ms of which 0 ms to minimize.
[2023-03-15 17:54:31] [INFO ] Deduced a trap composed of 57 places in 204 ms of which 0 ms to minimize.
[2023-03-15 17:54:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 525 ms
[2023-03-15 17:54:31] [INFO ] Deduced a trap composed of 66 places in 244 ms of which 1 ms to minimize.
[2023-03-15 17:54:32] [INFO ] Deduced a trap composed of 58 places in 242 ms of which 0 ms to minimize.
[2023-03-15 17:54:32] [INFO ] Deduced a trap composed of 44 places in 252 ms of which 0 ms to minimize.
[2023-03-15 17:54:32] [INFO ] Deduced a trap composed of 62 places in 208 ms of which 1 ms to minimize.
[2023-03-15 17:54:32] [INFO ] Deduced a trap composed of 55 places in 209 ms of which 1 ms to minimize.
[2023-03-15 17:54:33] [INFO ] Deduced a trap composed of 91 places in 185 ms of which 1 ms to minimize.
[2023-03-15 17:54:33] [INFO ] Deduced a trap composed of 51 places in 161 ms of which 1 ms to minimize.
[2023-03-15 17:54:33] [INFO ] Deduced a trap composed of 52 places in 237 ms of which 0 ms to minimize.
[2023-03-15 17:54:33] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2094 ms
[2023-03-15 17:54:33] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 0 ms to minimize.
[2023-03-15 17:54:34] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 0 ms to minimize.
[2023-03-15 17:54:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 292 ms
[2023-03-15 17:54:34] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 0 ms to minimize.
[2023-03-15 17:54:34] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 0 ms to minimize.
[2023-03-15 17:54:34] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 0 ms to minimize.
[2023-03-15 17:54:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 410 ms
[2023-03-15 17:54:34] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 0 ms to minimize.
[2023-03-15 17:54:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-03-15 17:54:35] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2023-03-15 17:54:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-03-15 17:54:35] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 0 ms to minimize.
[2023-03-15 17:54:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-15 17:54:35] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2023-03-15 17:54:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2023-03-15 17:54:36] [INFO ] Deduced a trap composed of 69 places in 198 ms of which 1 ms to minimize.
[2023-03-15 17:54:36] [INFO ] Deduced a trap composed of 66 places in 188 ms of which 1 ms to minimize.
[2023-03-15 17:54:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 510 ms
[2023-03-15 17:54:36] [INFO ] Deduced a trap composed of 58 places in 233 ms of which 0 ms to minimize.
[2023-03-15 17:54:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2023-03-15 17:54:37] [INFO ] Deduced a trap composed of 60 places in 229 ms of which 1 ms to minimize.
[2023-03-15 17:54:37] [INFO ] Deduced a trap composed of 63 places in 230 ms of which 1 ms to minimize.
[2023-03-15 17:54:37] [INFO ] Deduced a trap composed of 56 places in 229 ms of which 0 ms to minimize.
[2023-03-15 17:54:38] [INFO ] Deduced a trap composed of 66 places in 232 ms of which 1 ms to minimize.
[2023-03-15 17:54:38] [INFO ] Deduced a trap composed of 54 places in 223 ms of which 0 ms to minimize.
[2023-03-15 17:54:38] [INFO ] Deduced a trap composed of 60 places in 232 ms of which 0 ms to minimize.
[2023-03-15 17:54:39] [INFO ] Deduced a trap composed of 55 places in 228 ms of which 1 ms to minimize.
[2023-03-15 17:54:39] [INFO ] Deduced a trap composed of 55 places in 224 ms of which 1 ms to minimize.
[2023-03-15 17:54:39] [INFO ] Deduced a trap composed of 71 places in 223 ms of which 1 ms to minimize.
[2023-03-15 17:54:39] [INFO ] Deduced a trap composed of 68 places in 224 ms of which 0 ms to minimize.
[2023-03-15 17:54:40] [INFO ] Deduced a trap composed of 60 places in 221 ms of which 1 ms to minimize.
[2023-03-15 17:54:40] [INFO ] Deduced a trap composed of 60 places in 212 ms of which 1 ms to minimize.
[2023-03-15 17:54:40] [INFO ] Deduced a trap composed of 58 places in 226 ms of which 1 ms to minimize.
[2023-03-15 17:54:40] [INFO ] Deduced a trap composed of 52 places in 232 ms of which 1 ms to minimize.
[2023-03-15 17:54:41] [INFO ] Deduced a trap composed of 60 places in 205 ms of which 1 ms to minimize.
[2023-03-15 17:54:41] [INFO ] Deduced a trap composed of 68 places in 211 ms of which 1 ms to minimize.
[2023-03-15 17:54:41] [INFO ] Deduced a trap composed of 66 places in 184 ms of which 1 ms to minimize.
[2023-03-15 17:54:41] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4503 ms
[2023-03-15 17:54:41] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 1 ms to minimize.
[2023-03-15 17:54:42] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 0 ms to minimize.
[2023-03-15 17:54:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 360 ms
[2023-03-15 17:54:42] [INFO ] Deduced a trap composed of 72 places in 199 ms of which 0 ms to minimize.
[2023-03-15 17:54:42] [INFO ] Deduced a trap composed of 80 places in 198 ms of which 1 ms to minimize.
[2023-03-15 17:54:42] [INFO ] Deduced a trap composed of 70 places in 195 ms of which 0 ms to minimize.
[2023-03-15 17:54:43] [INFO ] Deduced a trap composed of 84 places in 202 ms of which 0 ms to minimize.
[2023-03-15 17:54:43] [INFO ] Deduced a trap composed of 73 places in 198 ms of which 1 ms to minimize.
[2023-03-15 17:54:43] [INFO ] Deduced a trap composed of 84 places in 187 ms of which 1 ms to minimize.
[2023-03-15 17:54:43] [INFO ] Deduced a trap composed of 81 places in 197 ms of which 0 ms to minimize.
[2023-03-15 17:54:44] [INFO ] Deduced a trap composed of 87 places in 192 ms of which 1 ms to minimize.
[2023-03-15 17:54:44] [INFO ] Deduced a trap composed of 77 places in 200 ms of which 1 ms to minimize.
[2023-03-15 17:54:44] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2195 ms
[2023-03-15 17:54:44] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 1 ms to minimize.
[2023-03-15 17:54:45] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 0 ms to minimize.
[2023-03-15 17:54:45] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 1 ms to minimize.
[2023-03-15 17:54:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 598 ms
[2023-03-15 17:54:45] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 1 ms to minimize.
[2023-03-15 17:54:45] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 1 ms to minimize.
[2023-03-15 17:54:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 372 ms
[2023-03-15 17:54:45] [INFO ] Deduced a trap composed of 64 places in 231 ms of which 0 ms to minimize.
[2023-03-15 17:54:46] [INFO ] Deduced a trap composed of 73 places in 235 ms of which 1 ms to minimize.
[2023-03-15 17:54:46] [INFO ] Deduced a trap composed of 54 places in 221 ms of which 1 ms to minimize.
[2023-03-15 17:54:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 849 ms
[2023-03-15 17:54:47] [INFO ] Deduced a trap composed of 50 places in 131 ms of which 0 ms to minimize.
[2023-03-15 17:54:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-15 17:54:47] [INFO ] Deduced a trap composed of 54 places in 138 ms of which 1 ms to minimize.
[2023-03-15 17:54:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-15 17:54:47] [INFO ] After 25810ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:83
[2023-03-15 17:54:47] [INFO ] After 26272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:83
[2023-03-15 17:54:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 17:54:48] [INFO ] After 437ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :83
[2023-03-15 17:54:48] [INFO ] After 428ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :83
[2023-03-15 17:54:49] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 0 ms to minimize.
[2023-03-15 17:54:49] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 1 ms to minimize.
[2023-03-15 17:54:49] [INFO ] Deduced a trap composed of 11 places in 249 ms of which 1 ms to minimize.
[2023-03-15 17:54:49] [INFO ] Deduced a trap composed of 27 places in 266 ms of which 0 ms to minimize.
[2023-03-15 17:54:50] [INFO ] Deduced a trap composed of 27 places in 255 ms of which 1 ms to minimize.
[2023-03-15 17:54:50] [INFO ] Deduced a trap composed of 20 places in 262 ms of which 0 ms to minimize.
[2023-03-15 17:54:50] [INFO ] Deduced a trap composed of 13 places in 256 ms of which 0 ms to minimize.
[2023-03-15 17:54:50] [INFO ] Deduced a trap composed of 11 places in 258 ms of which 1 ms to minimize.
[2023-03-15 17:54:51] [INFO ] Deduced a trap composed of 13 places in 253 ms of which 1 ms to minimize.
[2023-03-15 17:54:51] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 1 ms to minimize.
[2023-03-15 17:54:51] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 1 ms to minimize.
[2023-03-15 17:54:51] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 1 ms to minimize.
[2023-03-15 17:54:52] [INFO ] Deduced a trap composed of 18 places in 209 ms of which 1 ms to minimize.
[2023-03-15 17:54:52] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 1 ms to minimize.
[2023-03-15 17:54:52] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 1 ms to minimize.
[2023-03-15 17:54:52] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 1 ms to minimize.
[2023-03-15 17:54:52] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4099 ms
[2023-03-15 17:54:53] [INFO ] Deduced a trap composed of 38 places in 215 ms of which 1 ms to minimize.
[2023-03-15 17:54:53] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 0 ms to minimize.
[2023-03-15 17:54:53] [INFO ] Deduced a trap composed of 52 places in 219 ms of which 1 ms to minimize.
[2023-03-15 17:54:54] [INFO ] Deduced a trap composed of 33 places in 221 ms of which 1 ms to minimize.
[2023-03-15 17:54:54] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 0 ms to minimize.
[2023-03-15 17:54:54] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 1 ms to minimize.
[2023-03-15 17:54:54] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 1 ms to minimize.
[2023-03-15 17:54:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1727 ms
[2023-03-15 17:54:55] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 0 ms to minimize.
[2023-03-15 17:54:55] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 0 ms to minimize.
[2023-03-15 17:54:55] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 0 ms to minimize.
[2023-03-15 17:54:55] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 1 ms to minimize.
[2023-03-15 17:54:55] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 0 ms to minimize.
[2023-03-15 17:54:55] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 0 ms to minimize.
[2023-03-15 17:54:56] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 0 ms to minimize.
[2023-03-15 17:54:56] [INFO ] Deduced a trap composed of 20 places in 257 ms of which 1 ms to minimize.
[2023-03-15 17:54:56] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 0 ms to minimize.
[2023-03-15 17:54:56] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 1 ms to minimize.
[2023-03-15 17:54:56] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 0 ms to minimize.
[2023-03-15 17:54:56] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 1 ms to minimize.
[2023-03-15 17:54:57] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 1 ms to minimize.
[2023-03-15 17:54:57] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 0 ms to minimize.
[2023-03-15 17:54:57] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 1 ms to minimize.
[2023-03-15 17:54:57] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 0 ms to minimize.
[2023-03-15 17:54:57] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 0 ms to minimize.
[2023-03-15 17:54:57] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 0 ms to minimize.
[2023-03-15 17:54:58] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 1 ms to minimize.
[2023-03-15 17:54:58] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2023-03-15 17:54:58] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 0 ms to minimize.
[2023-03-15 17:54:58] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 1 ms to minimize.
[2023-03-15 17:54:59] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 0 ms to minimize.
[2023-03-15 17:54:59] [INFO ] Deduced a trap composed of 40 places in 202 ms of which 0 ms to minimize.
[2023-03-15 17:54:59] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 1 ms to minimize.
[2023-03-15 17:54:59] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 1 ms to minimize.
[2023-03-15 17:54:59] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 0 ms to minimize.
[2023-03-15 17:54:59] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 5052 ms
[2023-03-15 17:55:00] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 1 ms to minimize.
[2023-03-15 17:55:00] [INFO ] Deduced a trap composed of 52 places in 210 ms of which 1 ms to minimize.
[2023-03-15 17:55:00] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 1 ms to minimize.
[2023-03-15 17:55:00] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 1 ms to minimize.
[2023-03-15 17:55:00] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 1 ms to minimize.
[2023-03-15 17:55:01] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 1 ms to minimize.
[2023-03-15 17:55:01] [INFO ] Deduced a trap composed of 39 places in 235 ms of which 1 ms to minimize.
[2023-03-15 17:55:01] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 1 ms to minimize.
[2023-03-15 17:55:02] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 1 ms to minimize.
[2023-03-15 17:55:02] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 1 ms to minimize.
[2023-03-15 17:55:02] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 1 ms to minimize.
[2023-03-15 17:55:02] [INFO ] Deduced a trap composed of 27 places in 178 ms of which 1 ms to minimize.
[2023-03-15 17:55:02] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 1 ms to minimize.
[2023-03-15 17:55:03] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 1 ms to minimize.
[2023-03-15 17:55:03] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 1 ms to minimize.
[2023-03-15 17:55:03] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 1 ms to minimize.
[2023-03-15 17:55:03] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3418 ms
[2023-03-15 17:55:03] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 0 ms to minimize.
[2023-03-15 17:55:03] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 0 ms to minimize.
[2023-03-15 17:55:04] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 1 ms to minimize.
[2023-03-15 17:55:04] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 1 ms to minimize.
[2023-03-15 17:55:04] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 0 ms to minimize.
[2023-03-15 17:55:04] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 0 ms to minimize.
[2023-03-15 17:55:04] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 1 ms to minimize.
[2023-03-15 17:55:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1183 ms
[2023-03-15 17:55:05] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 0 ms to minimize.
[2023-03-15 17:55:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2023-03-15 17:55:05] [INFO ] Deduced a trap composed of 50 places in 185 ms of which 1 ms to minimize.
[2023-03-15 17:55:05] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 1 ms to minimize.
[2023-03-15 17:55:05] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 1 ms to minimize.
[2023-03-15 17:55:06] [INFO ] Deduced a trap composed of 55 places in 183 ms of which 1 ms to minimize.
[2023-03-15 17:55:06] [INFO ] Deduced a trap composed of 59 places in 209 ms of which 0 ms to minimize.
[2023-03-15 17:55:06] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 1 ms to minimize.
[2023-03-15 17:55:06] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 1 ms to minimize.
[2023-03-15 17:55:07] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 0 ms to minimize.
[2023-03-15 17:55:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1919 ms
[2023-03-15 17:55:07] [INFO ] Deduced a trap composed of 16 places in 230 ms of which 1 ms to minimize.
[2023-03-15 17:55:07] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 1 ms to minimize.
[2023-03-15 17:55:08] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 0 ms to minimize.
[2023-03-15 17:55:08] [INFO ] Deduced a trap composed of 33 places in 186 ms of which 1 ms to minimize.
[2023-03-15 17:55:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1124 ms
[2023-03-15 17:55:08] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 1 ms to minimize.
[2023-03-15 17:55:08] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 1 ms to minimize.
[2023-03-15 17:55:09] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 1 ms to minimize.
[2023-03-15 17:55:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 734 ms
[2023-03-15 17:55:09] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 0 ms to minimize.
[2023-03-15 17:55:09] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 1 ms to minimize.
[2023-03-15 17:55:09] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 1 ms to minimize.
[2023-03-15 17:55:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 698 ms
[2023-03-15 17:55:10] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 1 ms to minimize.
[2023-03-15 17:55:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-03-15 17:55:10] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 1 ms to minimize.
[2023-03-15 17:55:10] [INFO ] Deduced a trap composed of 49 places in 234 ms of which 0 ms to minimize.
[2023-03-15 17:55:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 574 ms
[2023-03-15 17:55:11] [INFO ] Deduced a trap composed of 10 places in 243 ms of which 1 ms to minimize.
[2023-03-15 17:55:11] [INFO ] Deduced a trap composed of 9 places in 225 ms of which 0 ms to minimize.
[2023-03-15 17:55:12] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 0 ms to minimize.
[2023-03-15 17:55:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 784 ms
[2023-03-15 17:55:12] [INFO ] Deduced a trap composed of 30 places in 236 ms of which 1 ms to minimize.
[2023-03-15 17:55:12] [INFO ] Deduced a trap composed of 16 places in 227 ms of which 0 ms to minimize.
[2023-03-15 17:55:12] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 0 ms to minimize.
[2023-03-15 17:55:13] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 0 ms to minimize.
[2023-03-15 17:55:13] [INFO ] Deduced a trap composed of 29 places in 189 ms of which 0 ms to minimize.
[2023-03-15 17:55:13] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 1 ms to minimize.
[2023-03-15 17:55:13] [INFO ] Deduced a trap composed of 34 places in 192 ms of which 1 ms to minimize.
[2023-03-15 17:55:14] [INFO ] Deduced a trap composed of 16 places in 229 ms of which 1 ms to minimize.
[2023-03-15 17:55:14] [INFO ] Deduced a trap composed of 17 places in 239 ms of which 1 ms to minimize.
[2023-03-15 17:55:14] [INFO ] Deduced a trap composed of 17 places in 228 ms of which 1 ms to minimize.
[2023-03-15 17:55:14] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2535 ms
[2023-03-15 17:55:15] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 1 ms to minimize.
[2023-03-15 17:55:15] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 1 ms to minimize.
[2023-03-15 17:55:15] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 1 ms to minimize.
[2023-03-15 17:55:15] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 1 ms to minimize.
[2023-03-15 17:55:15] [INFO ] Deduced a trap composed of 34 places in 191 ms of which 1 ms to minimize.
[2023-03-15 17:55:16] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 1 ms to minimize.
[2023-03-15 17:55:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1433 ms
[2023-03-15 17:55:16] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 1 ms to minimize.
[2023-03-15 17:55:16] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 1 ms to minimize.
[2023-03-15 17:55:16] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 1 ms to minimize.
[2023-03-15 17:55:17] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 1 ms to minimize.
[2023-03-15 17:55:17] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 1 ms to minimize.
[2023-03-15 17:55:17] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 1 ms to minimize.
[2023-03-15 17:55:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1211 ms
[2023-03-15 17:55:17] [INFO ] Deduced a trap composed of 30 places in 195 ms of which 0 ms to minimize.
[2023-03-15 17:55:17] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 1 ms to minimize.
[2023-03-15 17:55:18] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 1 ms to minimize.
[2023-03-15 17:55:18] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 0 ms to minimize.
[2023-03-15 17:55:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 800 ms
[2023-03-15 17:55:18] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 1 ms to minimize.
[2023-03-15 17:55:18] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 1 ms to minimize.
[2023-03-15 17:55:18] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 1 ms to minimize.
[2023-03-15 17:55:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 505 ms
[2023-03-15 17:55:19] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 1 ms to minimize.
[2023-03-15 17:55:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-15 17:55:19] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 1 ms to minimize.
[2023-03-15 17:55:19] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 1 ms to minimize.
[2023-03-15 17:55:19] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 1 ms to minimize.
[2023-03-15 17:55:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 668 ms
[2023-03-15 17:55:20] [INFO ] Deduced a trap composed of 42 places in 226 ms of which 0 ms to minimize.
[2023-03-15 17:55:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2023-03-15 17:55:21] [INFO ] Deduced a trap composed of 24 places in 241 ms of which 1 ms to minimize.
[2023-03-15 17:55:21] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 0 ms to minimize.
[2023-03-15 17:55:21] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 0 ms to minimize.
[2023-03-15 17:55:21] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 1 ms to minimize.
[2023-03-15 17:55:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1055 ms
[2023-03-15 17:55:22] [INFO ] Deduced a trap composed of 46 places in 230 ms of which 1 ms to minimize.
[2023-03-15 17:55:22] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 1 ms to minimize.
[2023-03-15 17:55:22] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 1 ms to minimize.
[2023-03-15 17:55:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 761 ms
[2023-03-15 17:55:23] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 1 ms to minimize.
[2023-03-15 17:55:23] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 1 ms to minimize.
[2023-03-15 17:55:23] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 0 ms to minimize.
[2023-03-15 17:55:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 521 ms
[2023-03-15 17:55:24] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 1 ms to minimize.
[2023-03-15 17:55:24] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 1 ms to minimize.
[2023-03-15 17:55:24] [INFO ] Deduced a trap composed of 10 places in 221 ms of which 1 ms to minimize.
[2023-03-15 17:55:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 757 ms
[2023-03-15 17:55:25] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 1 ms to minimize.
[2023-03-15 17:55:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2023-03-15 17:55:25] [INFO ] Deduced a trap composed of 30 places in 171 ms of which 1 ms to minimize.
[2023-03-15 17:55:25] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 1 ms to minimize.
[2023-03-15 17:55:26] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 1 ms to minimize.
[2023-03-15 17:55:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1019 ms
[2023-03-15 17:55:26] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2023-03-15 17:55:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-03-15 17:55:27] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 0 ms to minimize.
[2023-03-15 17:55:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2023-03-15 17:55:27] [INFO ] Deduced a trap composed of 34 places in 199 ms of which 1 ms to minimize.
[2023-03-15 17:55:27] [INFO ] Deduced a trap composed of 24 places in 217 ms of which 0 ms to minimize.
[2023-03-15 17:55:28] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 1 ms to minimize.
[2023-03-15 17:55:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 883 ms
[2023-03-15 17:55:28] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 1 ms to minimize.
[2023-03-15 17:55:28] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 1 ms to minimize.
[2023-03-15 17:55:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 507 ms
[2023-03-15 17:55:28] [INFO ] Deduced a trap composed of 54 places in 221 ms of which 1 ms to minimize.
[2023-03-15 17:55:29] [INFO ] Deduced a trap composed of 16 places in 213 ms of which 1 ms to minimize.
[2023-03-15 17:55:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 549 ms
[2023-03-15 17:55:29] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 1 ms to minimize.
[2023-03-15 17:55:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-15 17:55:30] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 1 ms to minimize.
[2023-03-15 17:55:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2023-03-15 17:55:31] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 1 ms to minimize.
[2023-03-15 17:55:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2023-03-15 17:55:31] [INFO ] Deduced a trap composed of 52 places in 222 ms of which 0 ms to minimize.
[2023-03-15 17:55:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
[2023-03-15 17:55:31] [INFO ] Deduced a trap composed of 21 places in 223 ms of which 0 ms to minimize.
[2023-03-15 17:55:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2023-03-15 17:55:32] [INFO ] Deduced a trap composed of 67 places in 238 ms of which 1 ms to minimize.
[2023-03-15 17:55:32] [INFO ] Deduced a trap composed of 23 places in 245 ms of which 1 ms to minimize.
[2023-03-15 17:55:32] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 1 ms to minimize.
[2023-03-15 17:55:32] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 1 ms to minimize.
[2023-03-15 17:55:33] [INFO ] Deduced a trap composed of 49 places in 210 ms of which 1 ms to minimize.
[2023-03-15 17:55:33] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 1 ms to minimize.
[2023-03-15 17:55:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1596 ms
[2023-03-15 17:55:34] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 1 ms to minimize.
[2023-03-15 17:55:34] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 0 ms to minimize.
[2023-03-15 17:55:34] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 0 ms to minimize.
[2023-03-15 17:55:34] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 1 ms to minimize.
[2023-03-15 17:55:35] [INFO ] Deduced a trap composed of 28 places in 186 ms of which 0 ms to minimize.
[2023-03-15 17:55:35] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 0 ms to minimize.
[2023-03-15 17:55:35] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 1 ms to minimize.
[2023-03-15 17:55:35] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 1 ms to minimize.
[2023-03-15 17:55:35] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1927 ms
[2023-03-15 17:55:36] [INFO ] Deduced a trap composed of 44 places in 173 ms of which 1 ms to minimize.
[2023-03-15 17:55:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2023-03-15 17:55:36] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 1 ms to minimize.
[2023-03-15 17:55:36] [INFO ] Deduced a trap composed of 58 places in 163 ms of which 1 ms to minimize.
[2023-03-15 17:55:36] [INFO ] Deduced a trap composed of 57 places in 157 ms of which 1 ms to minimize.
[2023-03-15 17:55:37] [INFO ] Deduced a trap composed of 54 places in 168 ms of which 1 ms to minimize.
[2023-03-15 17:55:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 842 ms
[2023-03-15 17:55:37] [INFO ] Deduced a trap composed of 43 places in 190 ms of which 1 ms to minimize.
[2023-03-15 17:55:37] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 0 ms to minimize.
[2023-03-15 17:55:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 476 ms
[2023-03-15 17:55:37] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 0 ms to minimize.
[2023-03-15 17:55:38] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 1 ms to minimize.
[2023-03-15 17:55:38] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 1 ms to minimize.
[2023-03-15 17:55:38] [INFO ] Deduced a trap composed of 54 places in 195 ms of which 1 ms to minimize.
[2023-03-15 17:55:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 954 ms
[2023-03-15 17:55:38] [INFO ] Deduced a trap composed of 18 places in 233 ms of which 1 ms to minimize.
[2023-03-15 17:55:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2023-03-15 17:55:39] [INFO ] After 50591ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :83
Attempting to minimize the solution found.
Minimization took 3002 ms.
[2023-03-15 17:55:42] [INFO ] After 54308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :83
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Finished random walk after 42 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Finished random walk after 919 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=229 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 8642 steps, including 2 resets, run visited all 1 properties in 30 ms. (steps per millisecond=288 )
Finished random walk after 1264 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=316 )
Finished random walk after 4404 steps, including 1 resets, run visited all 1 properties in 12 ms. (steps per millisecond=367 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Finished Best-First random walk after 2674 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=534 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 442363 steps, run visited all 1 properties in 1474 ms. (steps per millisecond=300 )
Probabilistic random walk after 442363 steps, saw 65797 distinct states, run finished after 1474 ms. (steps per millisecond=300 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1043742 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :{}
Probabilistic random walk after 1043742 steps, saw 152472 distinct states, run finished after 3003 ms. (steps per millisecond=347 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:55:46] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:55:46] [INFO ] Invariant cache hit.
[2023-03-15 17:55:46] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:55:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 17:55:47] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:55:47] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:55:47] [INFO ] After 72ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:55:47] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-15 17:55:47] [INFO ] After 538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 30 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 951216 steps, run timeout after 3001 ms. (steps per millisecond=316 ) properties seen :{}
Probabilistic random walk after 951216 steps, saw 138847 distinct states, run finished after 3001 ms. (steps per millisecond=316 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:55:50] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:55:50] [INFO ] Invariant cache hit.
[2023-03-15 17:55:50] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:55:50] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 17:55:50] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:55:50] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:55:50] [INFO ] After 77ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:55:50] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-15 17:55:50] [INFO ] After 443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 23 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 23 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 17:55:51] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:55:51] [INFO ] Invariant cache hit.
[2023-03-15 17:55:51] [INFO ] Implicit Places using invariants in 513 ms returned []
[2023-03-15 17:55:51] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:55:51] [INFO ] Invariant cache hit.
[2023-03-15 17:55:51] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:55:53] [INFO ] Implicit Places using invariants and state equation in 1545 ms returned []
Implicit Place search using SMT with State Equation took 2060 ms to find 0 implicit places.
[2023-03-15 17:55:53] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 17:55:53] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:55:53] [INFO ] Invariant cache hit.
[2023-03-15 17:55:53] [INFO ] Dead Transitions using invariants and state equation in 773 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2873 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 6 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 40 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-15 17:55:53] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-15 17:55:53] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:55:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 17:55:53] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:55:53] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-15 17:55:53] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 987784 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :{}
Probabilistic random walk after 987784 steps, saw 143796 distinct states, run finished after 3001 ms. (steps per millisecond=329 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:55:56] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 17:55:56] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 17:55:57] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:55:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 17:55:57] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:55:57] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:55:57] [INFO ] After 65ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:55:57] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-15 17:55:57] [INFO ] After 441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 18 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 966133 steps, run timeout after 3001 ms. (steps per millisecond=321 ) properties seen :{}
Probabilistic random walk after 966133 steps, saw 141300 distinct states, run finished after 3001 ms. (steps per millisecond=321 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:56:00] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:00] [INFO ] Invariant cache hit.
[2023-03-15 17:56:00] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:56:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 17:56:00] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:00] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:56:00] [INFO ] After 41ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:00] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-15 17:56:00] [INFO ] After 350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 17:56:01] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:01] [INFO ] Invariant cache hit.
[2023-03-15 17:56:01] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-15 17:56:01] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:01] [INFO ] Invariant cache hit.
[2023-03-15 17:56:01] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:56:02] [INFO ] Implicit Places using invariants and state equation in 977 ms returned []
Implicit Place search using SMT with State Equation took 1312 ms to find 0 implicit places.
[2023-03-15 17:56:02] [INFO ] Redundant transitions in 86 ms returned []
[2023-03-15 17:56:02] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:02] [INFO ] Invariant cache hit.
[2023-03-15 17:56:02] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1868 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 16 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-15 17:56:02] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 17:56:02] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:56:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 17:56:02] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:02] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-15 17:56:02] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17776 steps, run visited all 1 properties in 59 ms. (steps per millisecond=301 )
Probabilistic random walk after 17776 steps, saw 4285 distinct states, run finished after 60 ms. (steps per millisecond=296 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 993580 steps, run timeout after 3001 ms. (steps per millisecond=331 ) properties seen :{}
Probabilistic random walk after 993580 steps, saw 144016 distinct states, run finished after 3001 ms. (steps per millisecond=331 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:56:06] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 17:56:06] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 17:56:06] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:56:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-15 17:56:06] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:56:06] [INFO ] After 69ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:06] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-15 17:56:06] [INFO ] After 477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 15 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 982653 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :{}
Probabilistic random walk after 982653 steps, saw 143244 distinct states, run finished after 3001 ms. (steps per millisecond=327 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:56:09] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:09] [INFO ] Invariant cache hit.
[2023-03-15 17:56:09] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:56:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 17:56:10] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:10] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:56:10] [INFO ] After 63ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:10] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-15 17:56:10] [INFO ] After 509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 14 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 13 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 17:56:10] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:10] [INFO ] Invariant cache hit.
[2023-03-15 17:56:10] [INFO ] Implicit Places using invariants in 474 ms returned []
[2023-03-15 17:56:10] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:10] [INFO ] Invariant cache hit.
[2023-03-15 17:56:10] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:56:11] [INFO ] Implicit Places using invariants and state equation in 972 ms returned []
Implicit Place search using SMT with State Equation took 1448 ms to find 0 implicit places.
[2023-03-15 17:56:11] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 17:56:11] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:11] [INFO ] Invariant cache hit.
[2023-03-15 17:56:12] [INFO ] Dead Transitions using invariants and state equation in 690 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2168 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 15 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-15 17:56:12] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 17:56:12] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:56:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 17:56:12] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:12] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-15 17:56:12] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 996982 steps, run timeout after 3001 ms. (steps per millisecond=332 ) properties seen :{}
Probabilistic random walk after 996982 steps, saw 144469 distinct states, run finished after 3001 ms. (steps per millisecond=332 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:56:15] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 17:56:15] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 17:56:15] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:56:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 17:56:15] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:15] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:56:15] [INFO ] After 79ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:16] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-15 17:56:16] [INFO ] After 467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 14 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 975842 steps, run timeout after 3001 ms. (steps per millisecond=325 ) properties seen :{}
Probabilistic random walk after 975842 steps, saw 142606 distinct states, run finished after 3001 ms. (steps per millisecond=325 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:56:19] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:19] [INFO ] Invariant cache hit.
[2023-03-15 17:56:19] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:56:19] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-15 17:56:19] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:19] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:56:19] [INFO ] After 58ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:19] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-15 17:56:19] [INFO ] After 502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 14 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 13 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 17:56:19] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:19] [INFO ] Invariant cache hit.
[2023-03-15 17:56:20] [INFO ] Implicit Places using invariants in 485 ms returned []
[2023-03-15 17:56:20] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:20] [INFO ] Invariant cache hit.
[2023-03-15 17:56:20] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:56:21] [INFO ] Implicit Places using invariants and state equation in 1224 ms returned []
Implicit Place search using SMT with State Equation took 1710 ms to find 0 implicit places.
[2023-03-15 17:56:21] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 17:56:21] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:21] [INFO ] Invariant cache hit.
[2023-03-15 17:56:22] [INFO ] Dead Transitions using invariants and state equation in 819 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2559 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 1 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 22 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-15 17:56:22] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 17:56:22] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:56:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 17:56:22] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:22] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-15 17:56:22] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 2515 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=228 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1024226 steps, run timeout after 3001 ms. (steps per millisecond=341 ) properties seen :{}
Probabilistic random walk after 1024226 steps, saw 149337 distinct states, run finished after 3001 ms. (steps per millisecond=341 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:56:25] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 17:56:25] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 17:56:25] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:56:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 17:56:25] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:25] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:56:25] [INFO ] After 40ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:25] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-15 17:56:25] [INFO ] After 349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1018388 steps, run timeout after 3001 ms. (steps per millisecond=339 ) properties seen :{}
Probabilistic random walk after 1018388 steps, saw 148796 distinct states, run finished after 3001 ms. (steps per millisecond=339 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:56:28] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:28] [INFO ] Invariant cache hit.
[2023-03-15 17:56:28] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:56:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 17:56:29] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:29] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:56:29] [INFO ] After 43ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:29] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-15 17:56:29] [INFO ] After 371ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 13 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 13 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 17:56:29] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:29] [INFO ] Invariant cache hit.
[2023-03-15 17:56:29] [INFO ] Implicit Places using invariants in 461 ms returned []
[2023-03-15 17:56:29] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:29] [INFO ] Invariant cache hit.
[2023-03-15 17:56:30] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:56:30] [INFO ] Implicit Places using invariants and state equation in 927 ms returned []
Implicit Place search using SMT with State Equation took 1389 ms to find 0 implicit places.
[2023-03-15 17:56:30] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 17:56:30] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:30] [INFO ] Invariant cache hit.
[2023-03-15 17:56:31] [INFO ] Dead Transitions using invariants and state equation in 792 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2205 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 21 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-15 17:56:31] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 17:56:31] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:56:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 17:56:31] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:31] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-15 17:56:31] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 979608 steps, run timeout after 3001 ms. (steps per millisecond=326 ) properties seen :{}
Probabilistic random walk after 979608 steps, saw 142977 distinct states, run finished after 3001 ms. (steps per millisecond=326 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:56:34] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 17:56:34] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 17:56:34] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:56:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 17:56:34] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:34] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:56:35] [INFO ] After 44ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:35] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-15 17:56:35] [INFO ] After 345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1027656 steps, run timeout after 3001 ms. (steps per millisecond=342 ) properties seen :{}
Probabilistic random walk after 1027656 steps, saw 149656 distinct states, run finished after 3001 ms. (steps per millisecond=342 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:56:38] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:38] [INFO ] Invariant cache hit.
[2023-03-15 17:56:38] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:56:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 17:56:38] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:38] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:56:38] [INFO ] After 48ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:38] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-15 17:56:38] [INFO ] After 383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 17:56:38] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:38] [INFO ] Invariant cache hit.
[2023-03-15 17:56:38] [INFO ] Implicit Places using invariants in 407 ms returned []
[2023-03-15 17:56:38] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:38] [INFO ] Invariant cache hit.
[2023-03-15 17:56:39] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:56:40] [INFO ] Implicit Places using invariants and state equation in 1204 ms returned []
Implicit Place search using SMT with State Equation took 1612 ms to find 0 implicit places.
[2023-03-15 17:56:40] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-15 17:56:40] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:40] [INFO ] Invariant cache hit.
[2023-03-15 17:56:40] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1993 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 10 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-15 17:56:40] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-15 17:56:40] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:56:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 17:56:40] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:40] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-15 17:56:40] [INFO ] After 21ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 131093 steps, run visited all 1 properties in 373 ms. (steps per millisecond=351 )
Probabilistic random walk after 131093 steps, saw 20848 distinct states, run finished after 374 ms. (steps per millisecond=350 ) properties seen :1
Finished random walk after 7532 steps, including 2 resets, run visited all 1 properties in 18 ms. (steps per millisecond=418 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1077090 steps, run timeout after 3001 ms. (steps per millisecond=358 ) properties seen :{}
Probabilistic random walk after 1077090 steps, saw 156980 distinct states, run finished after 3001 ms. (steps per millisecond=358 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:56:44] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 17:56:44] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 17:56:44] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:56:44] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-15 17:56:44] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:44] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:56:44] [INFO ] After 41ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:44] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-15 17:56:44] [INFO ] After 344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 991375 steps, run timeout after 3001 ms. (steps per millisecond=330 ) properties seen :{}
Probabilistic random walk after 991375 steps, saw 143863 distinct states, run finished after 3001 ms. (steps per millisecond=330 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:56:47] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:47] [INFO ] Invariant cache hit.
[2023-03-15 17:56:47] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:56:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 17:56:47] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:47] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:56:47] [INFO ] After 60ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:47] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-15 17:56:48] [INFO ] After 444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 12 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 12 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 17:56:48] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:48] [INFO ] Invariant cache hit.
[2023-03-15 17:56:48] [INFO ] Implicit Places using invariants in 494 ms returned []
[2023-03-15 17:56:48] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:48] [INFO ] Invariant cache hit.
[2023-03-15 17:56:48] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:56:50] [INFO ] Implicit Places using invariants and state equation in 1496 ms returned []
Implicit Place search using SMT with State Equation took 1991 ms to find 0 implicit places.
[2023-03-15 17:56:50] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-15 17:56:50] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:50] [INFO ] Invariant cache hit.
[2023-03-15 17:56:50] [INFO ] Dead Transitions using invariants and state equation in 742 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2761 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 13 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-15 17:56:50] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-15 17:56:50] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:56:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 17:56:50] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:50] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-15 17:56:50] [INFO ] After 21ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1066191 steps, run timeout after 3001 ms. (steps per millisecond=355 ) properties seen :{}
Probabilistic random walk after 1066191 steps, saw 154748 distinct states, run finished after 3001 ms. (steps per millisecond=355 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:56:53] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 17:56:53] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 17:56:53] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:56:54] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 17:56:54] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:54] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:56:54] [INFO ] After 39ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:54] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-15 17:56:54] [INFO ] After 380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 12 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 948017 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :{}
Probabilistic random walk after 948017 steps, saw 138630 distinct states, run finished after 3001 ms. (steps per millisecond=315 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:56:57] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:57] [INFO ] Invariant cache hit.
[2023-03-15 17:56:57] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:56:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-15 17:56:57] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:57] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:56:57] [INFO ] After 40ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:56:57] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-15 17:56:57] [INFO ] After 367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 13 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 13 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 17:56:57] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:57] [INFO ] Invariant cache hit.
[2023-03-15 17:56:58] [INFO ] Implicit Places using invariants in 486 ms returned []
[2023-03-15 17:56:58] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:58] [INFO ] Invariant cache hit.
[2023-03-15 17:56:58] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:56:59] [INFO ] Implicit Places using invariants and state equation in 1505 ms returned []
Implicit Place search using SMT with State Equation took 1993 ms to find 0 implicit places.
[2023-03-15 17:56:59] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-15 17:56:59] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:56:59] [INFO ] Invariant cache hit.
[2023-03-15 17:57:00] [INFO ] Dead Transitions using invariants and state equation in 849 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2871 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 18 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-15 17:57:00] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 17:57:00] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:57:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 17:57:00] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:00] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-15 17:57:00] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 221272 steps, run visited all 1 properties in 941 ms. (steps per millisecond=235 )
Probabilistic random walk after 221272 steps, saw 35224 distinct states, run finished after 941 ms. (steps per millisecond=235 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1001602 steps, run timeout after 3001 ms. (steps per millisecond=333 ) properties seen :{}
Probabilistic random walk after 1001602 steps, saw 146181 distinct states, run finished after 3001 ms. (steps per millisecond=333 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:57:04] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 17:57:04] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-15 17:57:04] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:57:04] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 17:57:05] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:05] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:57:05] [INFO ] After 35ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:05] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-15 17:57:05] [INFO ] After 334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1000272 steps, run timeout after 3001 ms. (steps per millisecond=333 ) properties seen :{}
Probabilistic random walk after 1000272 steps, saw 145492 distinct states, run finished after 3001 ms. (steps per millisecond=333 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:57:08] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:57:08] [INFO ] Invariant cache hit.
[2023-03-15 17:57:08] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:57:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 17:57:08] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:08] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:57:08] [INFO ] After 36ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:08] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-15 17:57:08] [INFO ] After 332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 17:57:08] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:57:08] [INFO ] Invariant cache hit.
[2023-03-15 17:57:09] [INFO ] Implicit Places using invariants in 448 ms returned []
[2023-03-15 17:57:09] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:57:09] [INFO ] Invariant cache hit.
[2023-03-15 17:57:09] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:57:10] [INFO ] Implicit Places using invariants and state equation in 1295 ms returned []
Implicit Place search using SMT with State Equation took 1744 ms to find 0 implicit places.
[2023-03-15 17:57:10] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 17:57:10] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:57:10] [INFO ] Invariant cache hit.
[2023-03-15 17:57:10] [INFO ] Dead Transitions using invariants and state equation in 550 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2312 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 19 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-15 17:57:10] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 17:57:11] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:57:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 17:57:11] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:11] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-15 17:57:11] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 978509 steps, run timeout after 3001 ms. (steps per millisecond=326 ) properties seen :{}
Probabilistic random walk after 978509 steps, saw 142885 distinct states, run finished after 3001 ms. (steps per millisecond=326 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:57:14] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 17:57:14] [INFO ] Computed 17 place invariants in 5 ms
[2023-03-15 17:57:14] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:57:14] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 17:57:14] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:14] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:57:14] [INFO ] After 43ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:14] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-15 17:57:14] [INFO ] After 385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1010002 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :{}
Probabilistic random walk after 1010002 steps, saw 147637 distinct states, run finished after 3001 ms. (steps per millisecond=336 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:57:17] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:57:17] [INFO ] Invariant cache hit.
[2023-03-15 17:57:17] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:57:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 17:57:17] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:17] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:57:17] [INFO ] After 34ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:17] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-15 17:57:17] [INFO ] After 329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 17:57:18] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:57:18] [INFO ] Invariant cache hit.
[2023-03-15 17:57:18] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-15 17:57:18] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:57:18] [INFO ] Invariant cache hit.
[2023-03-15 17:57:18] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:57:19] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1197 ms to find 0 implicit places.
[2023-03-15 17:57:19] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 17:57:19] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:57:19] [INFO ] Invariant cache hit.
[2023-03-15 17:57:19] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1619 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 11 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-15 17:57:19] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 17:57:19] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:57:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 17:57:19] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:19] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-15 17:57:19] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 211559 steps, run visited all 1 properties in 690 ms. (steps per millisecond=306 )
Probabilistic random walk after 211559 steps, saw 32809 distinct states, run finished after 691 ms. (steps per millisecond=306 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1076747 steps, run timeout after 3001 ms. (steps per millisecond=358 ) properties seen :{}
Probabilistic random walk after 1076747 steps, saw 156948 distinct states, run finished after 3001 ms. (steps per millisecond=358 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:57:23] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 17:57:23] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-15 17:57:23] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:57:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 17:57:23] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:23] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:57:23] [INFO ] After 52ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:23] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-15 17:57:23] [INFO ] After 383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 880866 steps, run timeout after 3001 ms. (steps per millisecond=293 ) properties seen :{}
Probabilistic random walk after 880866 steps, saw 128492 distinct states, run finished after 3001 ms. (steps per millisecond=293 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:57:26] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:57:26] [INFO ] Invariant cache hit.
[2023-03-15 17:57:27] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:57:27] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 17:57:27] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:27] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:57:27] [INFO ] After 58ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:27] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-15 17:57:27] [INFO ] After 386ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 17:57:27] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:57:27] [INFO ] Invariant cache hit.
[2023-03-15 17:57:27] [INFO ] Implicit Places using invariants in 483 ms returned []
[2023-03-15 17:57:27] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:57:27] [INFO ] Invariant cache hit.
[2023-03-15 17:57:28] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:57:29] [INFO ] Implicit Places using invariants and state equation in 1397 ms returned []
Implicit Place search using SMT with State Equation took 1882 ms to find 0 implicit places.
[2023-03-15 17:57:29] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-15 17:57:29] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:57:29] [INFO ] Invariant cache hit.
[2023-03-15 17:57:30] [INFO ] Dead Transitions using invariants and state equation in 751 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2659 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 16 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-15 17:57:30] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-15 17:57:30] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:57:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 17:57:30] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:30] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-15 17:57:30] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 5166 steps, including 1 resets, run visited all 1 properties in 17 ms. (steps per millisecond=303 )
Finished random walk after 887 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=221 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 938574 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :{}
Probabilistic random walk after 938574 steps, saw 137361 distinct states, run finished after 3001 ms. (steps per millisecond=312 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:57:33] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 17:57:33] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 17:57:33] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:57:33] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 17:57:33] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:33] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:57:33] [INFO ] After 65ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:33] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-15 17:57:33] [INFO ] After 526ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 928515 steps, run timeout after 3001 ms. (steps per millisecond=309 ) properties seen :{}
Probabilistic random walk after 928515 steps, saw 136144 distinct states, run finished after 3001 ms. (steps per millisecond=309 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:57:36] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:57:36] [INFO ] Invariant cache hit.
[2023-03-15 17:57:36] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:57:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 17:57:37] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:37] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:57:37] [INFO ] After 43ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:37] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-15 17:57:37] [INFO ] After 355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 12 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 17:57:37] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:57:37] [INFO ] Invariant cache hit.
[2023-03-15 17:57:37] [INFO ] Implicit Places using invariants in 480 ms returned []
[2023-03-15 17:57:37] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:57:37] [INFO ] Invariant cache hit.
[2023-03-15 17:57:38] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:57:39] [INFO ] Implicit Places using invariants and state equation in 1500 ms returned []
Implicit Place search using SMT with State Equation took 1982 ms to find 0 implicit places.
[2023-03-15 17:57:39] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 17:57:39] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:57:39] [INFO ] Invariant cache hit.
[2023-03-15 17:57:40] [INFO ] Dead Transitions using invariants and state equation in 845 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2855 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 176 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 146 places
Drop transitions removed 292 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 441 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 112 transition count 202
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 83 transition count 202
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 65 place count 80 transition count 199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 68 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 86 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 98 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 104 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 137 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 162 place count 2 transition count 2
Applied a total of 162 rules in 18 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-15 17:57:40] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-15 17:57:40] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:57:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 17:57:40] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:40] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-15 17:57:40] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Finished Best-First random walk after 2569 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=642 )
Finished random walk after 4305 steps, including 1 resets, run visited all 1 properties in 17 ms. (steps per millisecond=253 )
Finished random walk after 276 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=138 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1016610 steps, run timeout after 3001 ms. (steps per millisecond=338 ) properties seen :{}
Probabilistic random walk after 1016610 steps, saw 148618 distinct states, run finished after 3001 ms. (steps per millisecond=338 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:57:43] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 17:57:43] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-15 17:57:43] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:57:43] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 17:57:43] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:43] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:57:43] [INFO ] After 37ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:43] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-15 17:57:43] [INFO ] After 343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1009001 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :{}
Probabilistic random walk after 1009001 steps, saw 147537 distinct states, run finished after 3001 ms. (steps per millisecond=336 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:57:46] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:57:46] [INFO ] Invariant cache hit.
[2023-03-15 17:57:46] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:57:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 17:57:47] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:47] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:57:47] [INFO ] After 35ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:47] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-15 17:57:47] [INFO ] After 329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 17:57:47] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:57:47] [INFO ] Invariant cache hit.
[2023-03-15 17:57:47] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-03-15 17:57:47] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:57:47] [INFO ] Invariant cache hit.
[2023-03-15 17:57:48] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:57:49] [INFO ] Implicit Places using invariants and state equation in 1463 ms returned []
Implicit Place search using SMT with State Equation took 1934 ms to find 0 implicit places.
[2023-03-15 17:57:49] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-15 17:57:49] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:57:49] [INFO ] Invariant cache hit.
[2023-03-15 17:57:49] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2707 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 12 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-15 17:57:49] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-15 17:57:49] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:57:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 17:57:49] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:49] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-15 17:57:49] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 979314 steps, run timeout after 3001 ms. (steps per millisecond=326 ) properties seen :{}
Probabilistic random walk after 979314 steps, saw 142945 distinct states, run finished after 3001 ms. (steps per millisecond=326 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:57:53] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 17:57:53] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-15 17:57:53] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:57:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 17:57:53] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:53] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:57:53] [INFO ] After 77ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:53] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-15 17:57:53] [INFO ] After 484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 989800 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :{}
Probabilistic random walk after 989800 steps, saw 143862 distinct states, run finished after 3001 ms. (steps per millisecond=329 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:57:56] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:57:56] [INFO ] Invariant cache hit.
[2023-03-15 17:57:56] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:57:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 17:57:56] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:56] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:57:57] [INFO ] After 42ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:57] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-15 17:57:57] [INFO ] After 340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 17:57:57] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:57:57] [INFO ] Invariant cache hit.
[2023-03-15 17:57:57] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-15 17:57:57] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:57:57] [INFO ] Invariant cache hit.
[2023-03-15 17:57:57] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:57:58] [INFO ] Implicit Places using invariants and state equation in 1431 ms returned []
Implicit Place search using SMT with State Equation took 1827 ms to find 0 implicit places.
[2023-03-15 17:57:58] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 17:57:58] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:57:58] [INFO ] Invariant cache hit.
[2023-03-15 17:57:59] [INFO ] Dead Transitions using invariants and state equation in 819 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2669 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 12 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-15 17:57:59] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 17:57:59] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:57:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 17:57:59] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:57:59] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-15 17:57:59] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1049104 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :{}
Probabilistic random walk after 1049104 steps, saw 153345 distinct states, run finished after 3001 ms. (steps per millisecond=349 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:58:02] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 17:58:02] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-15 17:58:02] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:58:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 17:58:03] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:58:03] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:58:03] [INFO ] After 39ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:58:03] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-15 17:58:03] [INFO ] After 333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1030841 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :{}
Probabilistic random walk after 1030841 steps, saw 149786 distinct states, run finished after 3001 ms. (steps per millisecond=343 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:58:06] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:58:06] [INFO ] Invariant cache hit.
[2023-03-15 17:58:06] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:58:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 17:58:06] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:58:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:58:06] [INFO ] After 42ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:58:06] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-15 17:58:06] [INFO ] After 338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 17:58:06] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:58:06] [INFO ] Invariant cache hit.
[2023-03-15 17:58:07] [INFO ] Implicit Places using invariants in 468 ms returned []
[2023-03-15 17:58:07] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:58:07] [INFO ] Invariant cache hit.
[2023-03-15 17:58:07] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:58:08] [INFO ] Implicit Places using invariants and state equation in 1312 ms returned []
Implicit Place search using SMT with State Equation took 1781 ms to find 0 implicit places.
[2023-03-15 17:58:08] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 17:58:08] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:58:08] [INFO ] Invariant cache hit.
[2023-03-15 17:58:09] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2398 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 23 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-15 17:58:09] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 17:58:09] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:58:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 17:58:09] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:58:09] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-15 17:58:09] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 981253 steps, run timeout after 3001 ms. (steps per millisecond=326 ) properties seen :{}
Probabilistic random walk after 981253 steps, saw 143138 distinct states, run finished after 3001 ms. (steps per millisecond=326 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:58:12] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 17:58:12] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-15 17:58:12] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:58:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 17:58:12] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:58:12] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:58:12] [INFO ] After 68ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:58:12] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-15 17:58:12] [INFO ] After 528ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 952315 steps, run timeout after 3001 ms. (steps per millisecond=317 ) properties seen :{}
Probabilistic random walk after 952315 steps, saw 138848 distinct states, run finished after 3001 ms. (steps per millisecond=317 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:58:15] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:58:15] [INFO ] Invariant cache hit.
[2023-03-15 17:58:15] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:58:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 17:58:16] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:58:16] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:58:16] [INFO ] After 58ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:58:16] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-15 17:58:16] [INFO ] After 388ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 17:58:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:58:16] [INFO ] Invariant cache hit.
[2023-03-15 17:58:16] [INFO ] Implicit Places using invariants in 467 ms returned []
[2023-03-15 17:58:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:58:16] [INFO ] Invariant cache hit.
[2023-03-15 17:58:17] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:58:18] [INFO ] Implicit Places using invariants and state equation in 1252 ms returned []
Implicit Place search using SMT with State Equation took 1721 ms to find 0 implicit places.
[2023-03-15 17:58:18] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 17:58:18] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:58:18] [INFO ] Invariant cache hit.
[2023-03-15 17:58:18] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2423 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 12 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-15 17:58:18] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 17:58:18] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:58:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 17:58:18] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:58:18] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-15 17:58:18] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1075004 steps, run timeout after 3001 ms. (steps per millisecond=358 ) properties seen :{}
Probabilistic random walk after 1075004 steps, saw 156567 distinct states, run finished after 3001 ms. (steps per millisecond=358 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:58:21] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 17:58:21] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-15 17:58:21] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:58:22] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-15 17:58:22] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:58:22] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:58:22] [INFO ] After 37ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:58:22] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-15 17:58:22] [INFO ] After 344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1010870 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :{}
Probabilistic random walk after 1010870 steps, saw 147843 distinct states, run finished after 3001 ms. (steps per millisecond=336 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:58:25] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:58:25] [INFO ] Invariant cache hit.
[2023-03-15 17:58:25] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:58:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 17:58:25] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:58:25] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:58:25] [INFO ] After 36ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:58:25] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-15 17:58:25] [INFO ] After 331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 17:58:25] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:58:25] [INFO ] Invariant cache hit.
[2023-03-15 17:58:26] [INFO ] Implicit Places using invariants in 478 ms returned []
[2023-03-15 17:58:26] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:58:26] [INFO ] Invariant cache hit.
[2023-03-15 17:58:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 17:58:27] [INFO ] Implicit Places using invariants and state equation in 1429 ms returned []
Implicit Place search using SMT with State Equation took 1908 ms to find 0 implicit places.
[2023-03-15 17:58:27] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-15 17:58:27] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 17:58:27] [INFO ] Invariant cache hit.
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 15146152 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16162664 kB
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-5"
export BK_EXAMINATION="Liveness"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is Peterson-PT-5, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r279-smll-167863550000394"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-5.tgz
mv Peterson-PT-5 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;