About the Execution of LoLa+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 |
| 1323.308 | 1800000.00 | 2469670.00 | 3708.10 | [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.r277-smll-167863548900394.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 lolaxred
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 r277-smll-167863548900394
=====================================================================
--------------------
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 1678885856602
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=lolaxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-PT-5
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 13:11:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2023-03-15 13:11:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 13:11:00] [INFO ] Load time of PNML (sax parser for PT used): 247 ms
[2023-03-15 13:11:00] [INFO ] Transformed 834 places.
[2023-03-15 13:11:00] [INFO ] Transformed 1242 transitions.
[2023-03-15 13:11:00] [INFO ] Found NUPN structural information;
[2023-03-15 13:11:00] [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 13:11:00] [INFO ] Parsed PT model containing 834 places and 1242 transitions and 3828 arcs in 406 ms.
Built sparse matrix representations for Structural reductions in 20 ms.20892KB 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 136 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 137 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 61 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 13:11:01] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2023-03-15 13:11:01] [INFO ] Computed 23 place invariants in 53 ms
[2023-03-15 13:11:01] [INFO ] Implicit Places using invariants in 709 ms returned []
[2023-03-15 13:11:01] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 13:11:01] [INFO ] Invariant cache hit.
[2023-03-15 13:11:02] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:11:02] [INFO ] Implicit Places using invariants and state equation in 988 ms returned []
Implicit Place search using SMT with State Equation took 1740 ms to find 0 implicit places.
[2023-03-15 13:11:02] [INFO ] Redundant transitions in 137 ms returned []
[2023-03-15 13:11:02] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 13:11:02] [INFO ] Invariant cache hit.
[2023-03-15 13:11:04] [INFO ] Dead Transitions using invariants and state equation in 1803 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 3758 ms. Remains : 834/834 places, 1242/1242 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3163 ms (no deadlock found). (steps per millisecond=395 )
Random directed walk for 1250002 steps, including 0 resets, run took 3537 ms (no deadlock found). (steps per millisecond=353 )
[2023-03-15 13:11:11] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 13:11:11] [INFO ] Invariant cache hit.
[2023-03-15 13:11:12] [INFO ] [Real]Absence check using 17 positive place invariants in 42 ms returned sat
[2023-03-15 13:11:12] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 30 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 68 ms. Remains 264 /834 variables (removed 570) and now considering 672/1242 (removed 570) transitions.
[2023-03-15 13:11:12] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 264 cols
[2023-03-15 13:11:12] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-15 13:11:12] [INFO ] Implicit Places using invariants in 356 ms returned [228, 240, 241, 242, 243, 244]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 361 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 440 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 1356 ms. (steps per millisecond=7 ) properties (out of 666) seen :274
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 392) 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 391) 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 391) 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 390) 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 389) 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 388) 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 387) 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 385) 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 385) 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 385) 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 385) 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 384) 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 384) 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 384) 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 382) 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 382) 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 382) 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 381) 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 381) 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 381) 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 381) 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 381) 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 381) 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 381) 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 381) 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 381) 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 380) 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 379) 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 379) 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 379) 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 379) 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 379) 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 379) 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 379) 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 379) 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 379) 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 379) 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 378) 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 378) 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 378) 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 377) 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 377) 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 377) 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 377) 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 377) 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 377) 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 377) 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 377) 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 376) 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 376) 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 376) 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 376) 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 376) 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 376) 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 376) 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 375) 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 375) 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 375) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 375) 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 375) 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 375) 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 375) 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 375) 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 375) 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 375) 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 375) 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 375) 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 375) 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 374) 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 374) 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 374) 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 374) 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 374) 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 374) 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 374) 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 374) 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 374) 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 374) 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 374) 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 374) 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 374) 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 373) 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 373) 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 373) 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 373) 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 373) 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 373) 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 373) 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 373) 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 373) 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 373) 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 373) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 372) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) 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 371) seen :0
Running SMT prover for 371 properties.
[2023-03-15 13:11:14] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:11:14] [INFO ] Computed 17 place invariants in 5 ms
[2023-03-15 13:11:17] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2023-03-15 13:11:35] [INFO ] After 20642ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:371
[2023-03-15 13:11:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 13:11:51] [INFO ] After 10404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :371
[2023-03-15 13:11:51] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:12:00] [INFO ] After 8285ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :370
[2023-03-15 13:12:00] [INFO ] After 8288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :370
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-15 13:12:00] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :370
Fused 371 Parikh solutions to 360 different solutions.
Parikh walk visited 29 properties in 7688 ms.
Support contains 214 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 565286 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen 61
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 281) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 278) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 267) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 259) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 252) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 242) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 234) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 230) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 230) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 224) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 224) 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 224) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 224) 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 224) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 223) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 219) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 217) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 216) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 214) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 212) 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 212) 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 212) 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 212) 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 212) 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 212) 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 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 212) 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 212) 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 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 212) 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 212) 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 212) 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 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 212) 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 212) 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 212) 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 212) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 211) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) 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 62 ms. (steps per millisecond=161 ) properties (out of 210) 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 210) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 210) 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 210) 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 210) 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 210) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 210) 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 210) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 210) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 210) 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 210) 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 210) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 208) 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 208) 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 208) 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 208) 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 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 208) 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 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 208) 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 208) 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 208) 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 208) 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 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 208) 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 208) 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 208) 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 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 208) 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 208) 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 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 208) 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 208) 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 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 208) 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 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 208) 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 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 208) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 207) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 207) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 207) 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 207) 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 207) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 207) 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 207) 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 207) 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 207) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 207) 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 207) 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 207) 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 207) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 207) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 207) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 207) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 207) 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 207) 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 207) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 207) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 207) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 207) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 207) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 207) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 207) 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 207) 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 207) 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 207) 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 207) 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 207) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 207) 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 207) 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 207) 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 207) 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 207) 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 207) 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 207) 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 207) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 205) 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 205) 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 205) 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 205) 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 205) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 205) 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 205) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 205) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 205) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 203) 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 203) 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 203) 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 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 203) 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 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 203) 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 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 203) 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 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 203) 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 203) 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 203) 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 203) 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 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 203) 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 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 203) 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 203) 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 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 203) 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 203) 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 203) 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 203) 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 203) 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 203) 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 203) 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 203) 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 203) 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 203) 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 203) 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 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 203) 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 203) 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 203) 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 203) 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 203) 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 203) 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 203) 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 203) 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 203) 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 203) seen :0
Running SMT prover for 203 properties.
[2023-03-15 13:12:51] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:12:51] [INFO ] Invariant cache hit.
[2023-03-15 13:12:53] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:12:58] [INFO ] After 4537ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:201
[2023-03-15 13:12:58] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:12:59] [INFO ] After 73ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:203
[2023-03-15 13:12:59] [INFO ] After 7352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:203
[2023-03-15 13:13:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:13:05] [INFO ] After 3994ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :203
[2023-03-15 13:13:10] [INFO ] After 5269ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :203
[2023-03-15 13:13:10] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 6 ms to minimize.
[2023-03-15 13:13:11] [INFO ] Deduced a trap composed of 16 places in 193 ms of which 2 ms to minimize.
[2023-03-15 13:13:11] [INFO ] Deduced a trap composed of 9 places in 281 ms of which 2 ms to minimize.
[2023-03-15 13:13:11] [INFO ] Deduced a trap composed of 27 places in 216 ms of which 2 ms to minimize.
[2023-03-15 13:13:11] [INFO ] Deduced a trap composed of 29 places in 248 ms of which 2 ms to minimize.
[2023-03-15 13:13:12] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 1 ms to minimize.
[2023-03-15 13:13:12] [INFO ] Deduced a trap composed of 22 places in 194 ms of which 1 ms to minimize.
[2023-03-15 13:13:12] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 1 ms to minimize.
[2023-03-15 13:13:12] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 1 ms to minimize.
[2023-03-15 13:13:13] [INFO ] Deduced a trap composed of 40 places in 222 ms of which 1 ms to minimize.
[2023-03-15 13:13:13] [INFO ] Deduced a trap composed of 12 places in 242 ms of which 1 ms to minimize.
[2023-03-15 13:13:13] [INFO ] Deduced a trap composed of 74 places in 237 ms of which 1 ms to minimize.
[2023-03-15 13:13:13] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 1 ms to minimize.
[2023-03-15 13:13:14] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 1 ms to minimize.
[2023-03-15 13:13:14] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 1 ms to minimize.
[2023-03-15 13:13:14] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3691 ms
[2023-03-15 13:13:14] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 1 ms to minimize.
[2023-03-15 13:13:15] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 1 ms to minimize.
[2023-03-15 13:13:15] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 1 ms to minimize.
[2023-03-15 13:13:15] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 0 ms to minimize.
[2023-03-15 13:13:15] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 1 ms to minimize.
[2023-03-15 13:13:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1127 ms
[2023-03-15 13:13:15] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 1 ms to minimize.
[2023-03-15 13:13:16] [INFO ] Deduced a trap composed of 18 places in 209 ms of which 3 ms to minimize.
[2023-03-15 13:13:16] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 2 ms to minimize.
[2023-03-15 13:13:16] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 1 ms to minimize.
[2023-03-15 13:13:16] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 1 ms to minimize.
[2023-03-15 13:13:16] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 1 ms to minimize.
[2023-03-15 13:13:17] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 1 ms to minimize.
[2023-03-15 13:13:17] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 1 ms to minimize.
[2023-03-15 13:13:17] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 2 ms to minimize.
[2023-03-15 13:13:17] [INFO ] Deduced a trap composed of 18 places in 212 ms of which 1 ms to minimize.
[2023-03-15 13:13:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2012 ms
[2023-03-15 13:13:18] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 1 ms to minimize.
[2023-03-15 13:13:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2023-03-15 13:13:18] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 1 ms to minimize.
[2023-03-15 13:13:18] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 1 ms to minimize.
[2023-03-15 13:13:18] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 1 ms to minimize.
[2023-03-15 13:13:18] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 1 ms to minimize.
[2023-03-15 13:13:19] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 1 ms to minimize.
[2023-03-15 13:13:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1028 ms
[2023-03-15 13:13:19] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 1 ms to minimize.
[2023-03-15 13:13:19] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 1 ms to minimize.
[2023-03-15 13:13:19] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 1 ms to minimize.
[2023-03-15 13:13:20] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 2 ms to minimize.
[2023-03-15 13:13:20] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 0 ms to minimize.
[2023-03-15 13:13:20] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 1 ms to minimize.
[2023-03-15 13:13:20] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 1 ms to minimize.
[2023-03-15 13:13:20] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 1 ms to minimize.
[2023-03-15 13:13:21] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 1 ms to minimize.
[2023-03-15 13:13:21] [INFO ] Deduced a trap composed of 33 places in 177 ms of which 0 ms to minimize.
[2023-03-15 13:13:21] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 1 ms to minimize.
[2023-03-15 13:13:21] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 0 ms to minimize.
[2023-03-15 13:13:21] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2550 ms
[2023-03-15 13:13:22] [INFO ] Deduced a trap composed of 37 places in 234 ms of which 0 ms to minimize.
[2023-03-15 13:13:22] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 1 ms to minimize.
[2023-03-15 13:13:22] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 2 ms to minimize.
[2023-03-15 13:13:22] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 1 ms to minimize.
[2023-03-15 13:13:23] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 1 ms to minimize.
[2023-03-15 13:13:23] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 0 ms to minimize.
[2023-03-15 13:13:23] [INFO ] Deduced a trap composed of 33 places in 223 ms of which 1 ms to minimize.
[2023-03-15 13:13:23] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 1 ms to minimize.
[2023-03-15 13:13:24] [INFO ] Deduced a trap composed of 16 places in 224 ms of which 2 ms to minimize.
[2023-03-15 13:13:24] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 1 ms to minimize.
[2023-03-15 13:13:24] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 1 ms to minimize.
[2023-03-15 13:13:24] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 1 ms to minimize.
[2023-03-15 13:13:25] [INFO ] Deduced a trap composed of 29 places in 216 ms of which 1 ms to minimize.
[2023-03-15 13:13:25] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 1 ms to minimize.
[2023-03-15 13:13:25] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 1 ms to minimize.
[2023-03-15 13:13:25] [INFO ] Deduced a trap composed of 30 places in 177 ms of which 1 ms to minimize.
[2023-03-15 13:13:25] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 1 ms to minimize.
[2023-03-15 13:13:26] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 4 ms to minimize.
[2023-03-15 13:13:26] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 1 ms to minimize.
[2023-03-15 13:13:26] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 4 ms to minimize.
[2023-03-15 13:13:26] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4789 ms
[2023-03-15 13:13:27] [INFO ] Deduced a trap composed of 12 places in 250 ms of which 3 ms to minimize.
[2023-03-15 13:13:27] [INFO ] Deduced a trap composed of 12 places in 248 ms of which 2 ms to minimize.
[2023-03-15 13:13:27] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 0 ms to minimize.
[2023-03-15 13:13:27] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 1 ms to minimize.
[2023-03-15 13:13:27] [INFO ] Deduced a trap composed of 47 places in 210 ms of which 1 ms to minimize.
[2023-03-15 13:13:28] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 1 ms to minimize.
[2023-03-15 13:13:28] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 1 ms to minimize.
[2023-03-15 13:13:28] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 1 ms to minimize.
[2023-03-15 13:13:28] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 1 ms to minimize.
[2023-03-15 13:13:29] [INFO ] Deduced a trap composed of 60 places in 266 ms of which 1 ms to minimize.
[2023-03-15 13:13:29] [INFO ] Deduced a trap composed of 9 places in 261 ms of which 1 ms to minimize.
[2023-03-15 13:13:29] [INFO ] Deduced a trap composed of 60 places in 201 ms of which 1 ms to minimize.
[2023-03-15 13:13:29] [INFO ] Deduced a trap composed of 12 places in 258 ms of which 1 ms to minimize.
[2023-03-15 13:13:30] [INFO ] Deduced a trap composed of 19 places in 258 ms of which 1 ms to minimize.
[2023-03-15 13:13:30] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 1 ms to minimize.
[2023-03-15 13:13:30] [INFO ] Deduced a trap composed of 41 places in 224 ms of which 0 ms to minimize.
[2023-03-15 13:13:30] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 1 ms to minimize.
[2023-03-15 13:13:31] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 1 ms to minimize.
[2023-03-15 13:13:31] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 1 ms to minimize.
[2023-03-15 13:13:31] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 1 ms to minimize.
[2023-03-15 13:13:31] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 0 ms to minimize.
[2023-03-15 13:13:32] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 1 ms to minimize.
[2023-03-15 13:13:32] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 1 ms to minimize.
[2023-03-15 13:13:32] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 1 ms to minimize.
[2023-03-15 13:13:32] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 1 ms to minimize.
[2023-03-15 13:13:32] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 5811 ms
[2023-03-15 13:13:32] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 1 ms to minimize.
[2023-03-15 13:13:33] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 0 ms to minimize.
[2023-03-15 13:13:33] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 0 ms to minimize.
[2023-03-15 13:13:33] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 0 ms to minimize.
[2023-03-15 13:13:33] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 1 ms to minimize.
[2023-03-15 13:13:34] [INFO ] Deduced a trap composed of 20 places in 204 ms of which 1 ms to minimize.
[2023-03-15 13:13:34] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 0 ms to minimize.
[2023-03-15 13:13:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1550 ms
[2023-03-15 13:13:34] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 1 ms to minimize.
[2023-03-15 13:13:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-03-15 13:13:34] [INFO ] Deduced a trap composed of 13 places in 267 ms of which 1 ms to minimize.
[2023-03-15 13:13:35] [INFO ] Deduced a trap composed of 20 places in 230 ms of which 0 ms to minimize.
[2023-03-15 13:13:35] [INFO ] Deduced a trap composed of 13 places in 254 ms of which 1 ms to minimize.
[2023-03-15 13:13:35] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 0 ms to minimize.
[2023-03-15 13:13:35] [INFO ] Deduced a trap composed of 17 places in 234 ms of which 1 ms to minimize.
[2023-03-15 13:13:36] [INFO ] Deduced a trap composed of 31 places in 207 ms of which 1 ms to minimize.
[2023-03-15 13:13:36] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 1 ms to minimize.
[2023-03-15 13:13:36] [INFO ] Deduced a trap composed of 31 places in 211 ms of which 1 ms to minimize.
[2023-03-15 13:13:36] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 1 ms to minimize.
[2023-03-15 13:13:37] [INFO ] Deduced a trap composed of 42 places in 218 ms of which 1 ms to minimize.
[2023-03-15 13:13:37] [INFO ] Deduced a trap composed of 17 places in 230 ms of which 0 ms to minimize.
[2023-03-15 13:13:37] [INFO ] Deduced a trap composed of 10 places in 221 ms of which 1 ms to minimize.
[2023-03-15 13:13:37] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 1 ms to minimize.
[2023-03-15 13:13:38] [INFO ] Deduced a trap composed of 38 places in 199 ms of which 1 ms to minimize.
[2023-03-15 13:13:38] [INFO ] Deduced a trap composed of 38 places in 195 ms of which 1 ms to minimize.
[2023-03-15 13:13:38] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 1 ms to minimize.
[2023-03-15 13:13:38] [INFO ] Deduced a trap composed of 38 places in 202 ms of which 1 ms to minimize.
[2023-03-15 13:13:39] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 1 ms to minimize.
[2023-03-15 13:13:39] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 1 ms to minimize.
[2023-03-15 13:13:39] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 1 ms to minimize.
[2023-03-15 13:13:39] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 0 ms to minimize.
[2023-03-15 13:13:39] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 1 ms to minimize.
[2023-03-15 13:13:39] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 1 ms to minimize.
[2023-03-15 13:13:40] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 1 ms to minimize.
[2023-03-15 13:13:40] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5628 ms
[2023-03-15 13:13:40] [INFO ] Deduced a trap composed of 39 places in 215 ms of which 1 ms to minimize.
[2023-03-15 13:13:40] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 1 ms to minimize.
[2023-03-15 13:13:40] [INFO ] Deduced a trap composed of 32 places in 215 ms of which 1 ms to minimize.
[2023-03-15 13:13:41] [INFO ] Deduced a trap composed of 48 places in 207 ms of which 0 ms to minimize.
[2023-03-15 13:13:41] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2023-03-15 13:13:41] [INFO ] Deduced a trap composed of 40 places in 218 ms of which 1 ms to minimize.
[2023-03-15 13:13:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1374 ms
[2023-03-15 13:13:41] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 1 ms to minimize.
[2023-03-15 13:13:42] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 1 ms to minimize.
[2023-03-15 13:13:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 467 ms
[2023-03-15 13:13:42] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 0 ms to minimize.
[2023-03-15 13:13:42] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2023-03-15 13:13:42] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 1 ms to minimize.
[2023-03-15 13:13:43] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 1 ms to minimize.
[2023-03-15 13:13:43] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 0 ms to minimize.
[2023-03-15 13:13:43] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 0 ms to minimize.
[2023-03-15 13:13:43] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 1 ms to minimize.
[2023-03-15 13:13:43] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1645 ms
[2023-03-15 13:13:43] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 0 ms to minimize.
[2023-03-15 13:13:44] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 0 ms to minimize.
[2023-03-15 13:13:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 321 ms
[2023-03-15 13:13:44] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 0 ms to minimize.
[2023-03-15 13:13:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2023-03-15 13:13:44] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 1 ms to minimize.
[2023-03-15 13:13:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2023-03-15 13:13:45] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 1 ms to minimize.
[2023-03-15 13:13:45] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 1 ms to minimize.
[2023-03-15 13:13:45] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 1 ms to minimize.
[2023-03-15 13:13:45] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 1 ms to minimize.
[2023-03-15 13:13:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 947 ms
[2023-03-15 13:13:46] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 1 ms to minimize.
[2023-03-15 13:13:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-03-15 13:13:46] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 1 ms to minimize.
[2023-03-15 13:13:46] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 1 ms to minimize.
[2023-03-15 13:13:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 478 ms
[2023-03-15 13:13:47] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2023-03-15 13:13:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-03-15 13:13:48] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 0 ms to minimize.
[2023-03-15 13:13:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-15 13:13:48] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 0 ms to minimize.
[2023-03-15 13:13:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2023-03-15 13:13:49] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2023-03-15 13:13:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-03-15 13:13:49] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 1 ms to minimize.
[2023-03-15 13:13:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2023-03-15 13:13:50] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 0 ms to minimize.
[2023-03-15 13:13:50] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 1 ms to minimize.
[2023-03-15 13:13:51] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 1 ms to minimize.
[2023-03-15 13:13:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 666 ms
[2023-03-15 13:13:52] [INFO ] Deduced a trap composed of 32 places in 206 ms of which 1 ms to minimize.
[2023-03-15 13:13:52] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 0 ms to minimize.
[2023-03-15 13:13:52] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 0 ms to minimize.
[2023-03-15 13:13:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 701 ms
[2023-03-15 13:13:52] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 0 ms to minimize.
[2023-03-15 13:13:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2023-03-15 13:13:53] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 1 ms to minimize.
[2023-03-15 13:13:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2023-03-15 13:13:54] [INFO ] Deduced a trap composed of 26 places in 204 ms of which 1 ms to minimize.
[2023-03-15 13:13:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2023-03-15 13:13:56] [INFO ] Deduced a trap composed of 44 places in 213 ms of which 1 ms to minimize.
[2023-03-15 13:13:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2023-03-15 13:13:56] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 1 ms to minimize.
[2023-03-15 13:13:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2023-03-15 13:13:57] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 0 ms to minimize.
[2023-03-15 13:13:57] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 1 ms to minimize.
[2023-03-15 13:13:57] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 1 ms to minimize.
[2023-03-15 13:13:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 502 ms
[2023-03-15 13:13:58] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 0 ms to minimize.
[2023-03-15 13:13:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-03-15 13:13:59] [INFO ] Deduced a trap composed of 52 places in 170 ms of which 1 ms to minimize.
[2023-03-15 13:14:00] [INFO ] Deduced a trap composed of 52 places in 161 ms of which 1 ms to minimize.
[2023-03-15 13:14:00] [INFO ] Deduced a trap composed of 54 places in 185 ms of which 1 ms to minimize.
[2023-03-15 13:14:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 667 ms
[2023-03-15 13:14:00] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 1 ms to minimize.
[2023-03-15 13:14:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2023-03-15 13:14:03] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 1 ms to minimize.
[2023-03-15 13:14:04] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 1 ms to minimize.
[2023-03-15 13:14:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 549 ms
[2023-03-15 13:14:04] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 1 ms to minimize.
[2023-03-15 13:14:04] [INFO ] Deduced a trap composed of 25 places in 205 ms of which 0 ms to minimize.
[2023-03-15 13:14:05] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 0 ms to minimize.
[2023-03-15 13:14:05] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 2 ms to minimize.
[2023-03-15 13:14:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 956 ms
[2023-03-15 13:14:05] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 0 ms to minimize.
[2023-03-15 13:14:05] [INFO ] Deduced a trap composed of 44 places in 211 ms of which 1 ms to minimize.
[2023-03-15 13:14:06] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 1 ms to minimize.
[2023-03-15 13:14:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 766 ms
[2023-03-15 13:14:06] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 1 ms to minimize.
[2023-03-15 13:14:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2023-03-15 13:14:07] [INFO ] Deduced a trap composed of 30 places in 239 ms of which 1 ms to minimize.
[2023-03-15 13:14:07] [INFO ] Deduced a trap composed of 28 places in 203 ms of which 1 ms to minimize.
[2023-03-15 13:14:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 598 ms
[2023-03-15 13:14:07] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 1 ms to minimize.
[2023-03-15 13:14:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2023-03-15 13:14:08] [INFO ] Deduced a trap composed of 35 places in 169 ms of which 1 ms to minimize.
[2023-03-15 13:14:08] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 1 ms to minimize.
[2023-03-15 13:14:08] [INFO ] Deduced a trap composed of 30 places in 175 ms of which 1 ms to minimize.
[2023-03-15 13:14:08] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 1 ms to minimize.
[2023-03-15 13:14:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 855 ms
[2023-03-15 13:14:09] [INFO ] Deduced a trap composed of 49 places in 228 ms of which 1 ms to minimize.
[2023-03-15 13:14:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 298 ms
[2023-03-15 13:14:09] [INFO ] Deduced a trap composed of 54 places in 210 ms of which 0 ms to minimize.
[2023-03-15 13:14:09] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 1 ms to minimize.
[2023-03-15 13:14:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 525 ms
[2023-03-15 13:14:10] [INFO ] Deduced a trap composed of 28 places in 186 ms of which 1 ms to minimize.
[2023-03-15 13:14:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-03-15 13:14:12] [INFO ] Deduced a trap composed of 12 places in 253 ms of which 1 ms to minimize.
[2023-03-15 13:14:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 324 ms
[2023-03-15 13:14:12] [INFO ] Deduced a trap composed of 10 places in 242 ms of which 1 ms to minimize.
[2023-03-15 13:14:13] [INFO ] Deduced a trap composed of 12 places in 234 ms of which 1 ms to minimize.
[2023-03-15 13:14:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 584 ms
[2023-03-15 13:14:13] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 0 ms to minimize.
[2023-03-15 13:14:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2023-03-15 13:14:13] [INFO ] Deduced a trap composed of 22 places in 221 ms of which 1 ms to minimize.
[2023-03-15 13:14:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2023-03-15 13:14:14] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 1 ms to minimize.
[2023-03-15 13:14:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 294 ms
[2023-03-15 13:14:14] [INFO ] Deduced a trap composed of 64 places in 180 ms of which 0 ms to minimize.
[2023-03-15 13:14:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2023-03-15 13:14:17] [INFO ] After 72174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :203
Attempting to minimize the solution found.
Minimization took 18482 ms.
[2023-03-15 13:14:36] [INFO ] After 96959ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :203
Fused 203 Parikh solutions to 200 different solutions.
Parikh walk visited 0 properties in 1449 ms.
Support contains 163 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 16 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.
Interrupted random walk after 727032 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=24 ) properties 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 203) 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 203) 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 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 203) 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 203) 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 203) 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 203) 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 203) 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 203) 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 203) 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 203) 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 203) 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 203) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 202) 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 202) 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 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 202) 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 202) 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 202) 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 202) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 201) 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 201) 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 201) 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 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 201) 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 201) 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 201) 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 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 201) 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 199) 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 199) 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 199) 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 199) 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 199) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 199) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 199) 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 199) 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 199) 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 199) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 199) 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 199) 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 199) 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 199) 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 199) 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 199) 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 199) 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 199) 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 199) 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 199) 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 199) 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 199) 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 199) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 199) 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 199) 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 199) 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 199) 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 199) 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 199) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 199) 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 199) 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 199) 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 199) 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 199) 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 199) 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 199) 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 199) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 199) 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 199) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 199) 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 199) 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 199) 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 199) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 199) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 199) 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 199) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 199) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 199) 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 199) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 92052 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 199 properties.
[2023-03-15 13:16:45] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:16:45] [INFO ] Invariant cache hit.
[2023-03-15 13:16:46] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 13:16:55] [INFO ] After 9907ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:199
[2023-03-15 13:16:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 13:17:04] [INFO ] After 5716ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :199
[2023-03-15 13:17:04] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:17:10] [INFO ] After 6029ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :199
[2023-03-15 13:17:10] [INFO ] Deduced a trap composed of 31 places in 277 ms of which 2 ms to minimize.
[2023-03-15 13:17:10] [INFO ] Deduced a trap composed of 43 places in 255 ms of which 1 ms to minimize.
[2023-03-15 13:17:10] [INFO ] Deduced a trap composed of 10 places in 257 ms of which 1 ms to minimize.
[2023-03-15 13:17:11] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 1 ms to minimize.
[2023-03-15 13:17:11] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 1 ms to minimize.
[2023-03-15 13:17:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1401 ms
[2023-03-15 13:17:11] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 1 ms to minimize.
[2023-03-15 13:17:12] [INFO ] Deduced a trap composed of 18 places in 225 ms of which 1 ms to minimize.
[2023-03-15 13:17:12] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 0 ms to minimize.
[2023-03-15 13:17:12] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 0 ms to minimize.
[2023-03-15 13:17:12] [INFO ] Deduced a trap composed of 18 places in 197 ms of which 1 ms to minimize.
[2023-03-15 13:17:13] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 1 ms to minimize.
[2023-03-15 13:17:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1470 ms
[2023-03-15 13:17:13] [INFO ] Deduced a trap composed of 18 places in 202 ms of which 0 ms to minimize.
[2023-03-15 13:17:13] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 2 ms to minimize.
[2023-03-15 13:17:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 479 ms
[2023-03-15 13:17:13] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 1 ms to minimize.
[2023-03-15 13:17:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2023-03-15 13:17:14] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 1 ms to minimize.
[2023-03-15 13:17:14] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 1 ms to minimize.
[2023-03-15 13:17:14] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 1 ms to minimize.
[2023-03-15 13:17:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 622 ms
[2023-03-15 13:17:14] [INFO ] Deduced a trap composed of 9 places in 225 ms of which 1 ms to minimize.
[2023-03-15 13:17:15] [INFO ] Deduced a trap composed of 10 places in 225 ms of which 1 ms to minimize.
[2023-03-15 13:17:15] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 0 ms to minimize.
[2023-03-15 13:17:15] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 1 ms to minimize.
[2023-03-15 13:17:15] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 1 ms to minimize.
[2023-03-15 13:17:15] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 1 ms to minimize.
[2023-03-15 13:17:16] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 1 ms to minimize.
[2023-03-15 13:17:16] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 1 ms to minimize.
[2023-03-15 13:17:16] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1630 ms
[2023-03-15 13:17:16] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 1 ms to minimize.
[2023-03-15 13:17:16] [INFO ] Deduced a trap composed of 55 places in 157 ms of which 1 ms to minimize.
[2023-03-15 13:17:16] [INFO ] Deduced a trap composed of 47 places in 157 ms of which 3 ms to minimize.
[2023-03-15 13:17:17] [INFO ] Deduced a trap composed of 46 places in 148 ms of which 1 ms to minimize.
[2023-03-15 13:17:17] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 0 ms to minimize.
[2023-03-15 13:17:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 975 ms
[2023-03-15 13:17:17] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 2 ms to minimize.
[2023-03-15 13:17:17] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 1 ms to minimize.
[2023-03-15 13:17:18] [INFO ] Deduced a trap composed of 33 places in 186 ms of which 1 ms to minimize.
[2023-03-15 13:17:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 674 ms
[2023-03-15 13:17:18] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 0 ms to minimize.
[2023-03-15 13:17:18] [INFO ] Deduced a trap composed of 33 places in 243 ms of which 1 ms to minimize.
[2023-03-15 13:17:18] [INFO ] Deduced a trap composed of 12 places in 237 ms of which 1 ms to minimize.
[2023-03-15 13:17:19] [INFO ] Deduced a trap composed of 18 places in 209 ms of which 1 ms to minimize.
[2023-03-15 13:17:19] [INFO ] Deduced a trap composed of 40 places in 227 ms of which 1 ms to minimize.
[2023-03-15 13:17:19] [INFO ] Deduced a trap composed of 10 places in 252 ms of which 1 ms to minimize.
[2023-03-15 13:17:19] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 1 ms to minimize.
[2023-03-15 13:17:20] [INFO ] Deduced a trap composed of 32 places in 219 ms of which 1 ms to minimize.
[2023-03-15 13:17:20] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 1 ms to minimize.
[2023-03-15 13:17:20] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 1 ms to minimize.
[2023-03-15 13:17:20] [INFO ] Deduced a trap composed of 17 places in 230 ms of which 1 ms to minimize.
[2023-03-15 13:17:21] [INFO ] Deduced a trap composed of 13 places in 255 ms of which 2 ms to minimize.
[2023-03-15 13:17:21] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 1 ms to minimize.
[2023-03-15 13:17:21] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 2 ms to minimize.
[2023-03-15 13:17:21] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 1 ms to minimize.
[2023-03-15 13:17:21] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 1 ms to minimize.
[2023-03-15 13:17:22] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 0 ms to minimize.
[2023-03-15 13:17:22] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 3 ms to minimize.
[2023-03-15 13:17:22] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 1 ms to minimize.
[2023-03-15 13:17:22] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 1 ms to minimize.
[2023-03-15 13:17:22] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 1 ms to minimize.
[2023-03-15 13:17:23] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 1 ms to minimize.
[2023-03-15 13:17:23] [INFO ] Deduced a trap composed of 17 places in 266 ms of which 2 ms to minimize.
[2023-03-15 13:17:23] [INFO ] Deduced a trap composed of 45 places in 262 ms of which 0 ms to minimize.
[2023-03-15 13:17:23] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 0 ms to minimize.
[2023-03-15 13:17:24] [INFO ] Deduced a trap composed of 9 places in 266 ms of which 1 ms to minimize.
[2023-03-15 13:17:24] [INFO ] Deduced a trap composed of 40 places in 187 ms of which 1 ms to minimize.
[2023-03-15 13:17:24] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 1 ms to minimize.
[2023-03-15 13:17:24] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 0 ms to minimize.
[2023-03-15 13:17:25] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 1 ms to minimize.
[2023-03-15 13:17:25] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 6955 ms
[2023-03-15 13:17:25] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 1 ms to minimize.
[2023-03-15 13:17:25] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 1 ms to minimize.
[2023-03-15 13:17:25] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 1 ms to minimize.
[2023-03-15 13:17:25] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
[2023-03-15 13:17:25] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 1 ms to minimize.
[2023-03-15 13:17:26] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2023-03-15 13:17:26] [INFO ] Deduced a trap composed of 25 places in 225 ms of which 1 ms to minimize.
[2023-03-15 13:17:26] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 1 ms to minimize.
[2023-03-15 13:17:26] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 1 ms to minimize.
[2023-03-15 13:17:26] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 1 ms to minimize.
[2023-03-15 13:17:27] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 1 ms to minimize.
[2023-03-15 13:17:27] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 0 ms to minimize.
[2023-03-15 13:17:27] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 1 ms to minimize.
[2023-03-15 13:17:27] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 0 ms to minimize.
[2023-03-15 13:17:27] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2023-03-15 13:17:27] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2810 ms
[2023-03-15 13:17:28] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 1 ms to minimize.
[2023-03-15 13:17:28] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 1 ms to minimize.
[2023-03-15 13:17:28] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 0 ms to minimize.
[2023-03-15 13:17:28] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 0 ms to minimize.
[2023-03-15 13:17:28] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 1 ms to minimize.
[2023-03-15 13:17:29] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 1 ms to minimize.
[2023-03-15 13:17:29] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 0 ms to minimize.
[2023-03-15 13:17:29] [INFO ] Deduced a trap composed of 54 places in 174 ms of which 1 ms to minimize.
[2023-03-15 13:17:29] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 1 ms to minimize.
[2023-03-15 13:17:30] [INFO ] Deduced a trap composed of 20 places in 223 ms of which 1 ms to minimize.
[2023-03-15 13:17:30] [INFO ] Deduced a trap composed of 52 places in 219 ms of which 1 ms to minimize.
[2023-03-15 13:17:30] [INFO ] Deduced a trap composed of 37 places in 212 ms of which 1 ms to minimize.
[2023-03-15 13:17:30] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 1 ms to minimize.
[2023-03-15 13:17:31] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 0 ms to minimize.
[2023-03-15 13:17:31] [INFO ] Deduced a trap composed of 56 places in 209 ms of which 1 ms to minimize.
[2023-03-15 13:17:31] [INFO ] Deduced a trap composed of 55 places in 207 ms of which 1 ms to minimize.
[2023-03-15 13:17:31] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 1 ms to minimize.
[2023-03-15 13:17:32] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 1 ms to minimize.
[2023-03-15 13:17:32] [INFO ] Deduced a trap composed of 39 places in 215 ms of which 0 ms to minimize.
[2023-03-15 13:17:32] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 1 ms to minimize.
[2023-03-15 13:17:32] [INFO ] Deduced a trap composed of 41 places in 221 ms of which 1 ms to minimize.
[2023-03-15 13:17:32] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 1 ms to minimize.
[2023-03-15 13:17:33] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 0 ms to minimize.
[2023-03-15 13:17:33] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 1 ms to minimize.
[2023-03-15 13:17:33] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 1 ms to minimize.
[2023-03-15 13:17:33] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 1 ms to minimize.
[2023-03-15 13:17:33] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 5698 ms
[2023-03-15 13:17:34] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 0 ms to minimize.
[2023-03-15 13:17:34] [INFO ] Deduced a trap composed of 51 places in 245 ms of which 1 ms to minimize.
[2023-03-15 13:17:34] [INFO ] Deduced a trap composed of 20 places in 221 ms of which 1 ms to minimize.
[2023-03-15 13:17:34] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 1 ms to minimize.
[2023-03-15 13:17:35] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 0 ms to minimize.
[2023-03-15 13:17:35] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 1 ms to minimize.
[2023-03-15 13:17:35] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 0 ms to minimize.
[2023-03-15 13:17:35] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 0 ms to minimize.
[2023-03-15 13:17:35] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 0 ms to minimize.
[2023-03-15 13:17:35] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2103 ms
[2023-03-15 13:17:36] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 1 ms to minimize.
[2023-03-15 13:17:36] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 0 ms to minimize.
[2023-03-15 13:17:36] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 0 ms to minimize.
[2023-03-15 13:17:36] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 0 ms to minimize.
[2023-03-15 13:17:36] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 0 ms to minimize.
[2023-03-15 13:17:36] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 1 ms to minimize.
[2023-03-15 13:17:37] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 1 ms to minimize.
[2023-03-15 13:17:37] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 1 ms to minimize.
[2023-03-15 13:17:37] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 0 ms to minimize.
[2023-03-15 13:17:37] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2023-03-15 13:17:37] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1480 ms
[2023-03-15 13:17:37] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 1 ms to minimize.
[2023-03-15 13:17:37] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 1 ms to minimize.
[2023-03-15 13:17:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 436 ms
[2023-03-15 13:17:38] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 1 ms to minimize.
[2023-03-15 13:17:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2023-03-15 13:17:38] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 0 ms to minimize.
[2023-03-15 13:17:38] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2023-03-15 13:17:38] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2023-03-15 13:17:38] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2023-03-15 13:17:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 484 ms
[2023-03-15 13:17:38] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 1 ms to minimize.
[2023-03-15 13:17:39] [INFO ] Deduced a trap composed of 30 places in 191 ms of which 0 ms to minimize.
[2023-03-15 13:17:39] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 1 ms to minimize.
[2023-03-15 13:17:39] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 0 ms to minimize.
[2023-03-15 13:17:39] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2023-03-15 13:17:40] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2023-03-15 13:17:40] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 1 ms to minimize.
[2023-03-15 13:17:40] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 0 ms to minimize.
[2023-03-15 13:17:40] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 1 ms to minimize.
[2023-03-15 13:17:40] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 1 ms to minimize.
[2023-03-15 13:17:40] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 1 ms to minimize.
[2023-03-15 13:17:40] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2165 ms
[2023-03-15 13:17:41] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2023-03-15 13:17:41] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2023-03-15 13:17:41] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2023-03-15 13:17:41] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 0 ms to minimize.
[2023-03-15 13:17:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 748 ms
[2023-03-15 13:17:41] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 0 ms to minimize.
[2023-03-15 13:17:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-15 13:17:42] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 0 ms to minimize.
[2023-03-15 13:17:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-03-15 13:17:42] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 0 ms to minimize.
[2023-03-15 13:17:42] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 0 ms to minimize.
[2023-03-15 13:17:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 258 ms
[2023-03-15 13:17:42] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 0 ms to minimize.
[2023-03-15 13:17:42] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2023-03-15 13:17:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2023-03-15 13:17:43] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 0 ms to minimize.
[2023-03-15 13:17:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-15 13:17:43] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 1 ms to minimize.
[2023-03-15 13:17:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-03-15 13:17:44] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2023-03-15 13:17:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2023-03-15 13:17:44] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 0 ms to minimize.
[2023-03-15 13:17:44] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 0 ms to minimize.
[2023-03-15 13:17:44] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 1 ms to minimize.
[2023-03-15 13:17:44] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
[2023-03-15 13:17:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 590 ms
[2023-03-15 13:17:45] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 0 ms to minimize.
[2023-03-15 13:17:45] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 1 ms to minimize.
[2023-03-15 13:17:45] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
[2023-03-15 13:17:45] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
[2023-03-15 13:17:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 501 ms
[2023-03-15 13:17:45] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 1 ms to minimize.
[2023-03-15 13:17:45] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 1 ms to minimize.
[2023-03-15 13:17:45] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 1 ms to minimize.
[2023-03-15 13:17:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 424 ms
[2023-03-15 13:17:46] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 0 ms to minimize.
[2023-03-15 13:17:46] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 0 ms to minimize.
[2023-03-15 13:17:46] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 0 ms to minimize.
[2023-03-15 13:17:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 381 ms
[2023-03-15 13:17:47] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 1 ms to minimize.
[2023-03-15 13:17:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-03-15 13:17:47] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2023-03-15 13:17:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-15 13:17:48] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 0 ms to minimize.
[2023-03-15 13:17:48] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 0 ms to minimize.
[2023-03-15 13:17:48] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 0 ms to minimize.
[2023-03-15 13:17:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 387 ms
[2023-03-15 13:17:48] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 0 ms to minimize.
[2023-03-15 13:17:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2023-03-15 13:17:49] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 1 ms to minimize.
[2023-03-15 13:17:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2023-03-15 13:17:49] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 0 ms to minimize.
[2023-03-15 13:17:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-03-15 13:17:49] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 0 ms to minimize.
[2023-03-15 13:17:49] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 1 ms to minimize.
[2023-03-15 13:17:49] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 0 ms to minimize.
[2023-03-15 13:17:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 445 ms
[2023-03-15 13:17:50] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2023-03-15 13:17:50] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 1 ms to minimize.
[2023-03-15 13:17:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2023-03-15 13:17:51] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 0 ms to minimize.
[2023-03-15 13:17:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-03-15 13:17:51] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 1 ms to minimize.
[2023-03-15 13:17:52] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2023-03-15 13:17:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 280 ms
[2023-03-15 13:17:53] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 1 ms to minimize.
[2023-03-15 13:17:53] [INFO ] Deduced a trap composed of 59 places in 131 ms of which 0 ms to minimize.
[2023-03-15 13:17:53] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 0 ms to minimize.
[2023-03-15 13:17:53] [INFO ] Deduced a trap composed of 83 places in 133 ms of which 1 ms to minimize.
[2023-03-15 13:17:54] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 0 ms to minimize.
[2023-03-15 13:17:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 790 ms
[2023-03-15 13:17:54] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 1 ms to minimize.
[2023-03-15 13:17:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-15 13:17:54] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 0 ms to minimize.
[2023-03-15 13:17:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-03-15 13:17:54] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 0 ms to minimize.
[2023-03-15 13:17:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-03-15 13:17:55] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 0 ms to minimize.
[2023-03-15 13:17:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2023-03-15 13:17:57] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 0 ms to minimize.
[2023-03-15 13:17:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2023-03-15 13:17:57] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 1 ms to minimize.
[2023-03-15 13:17:57] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 1 ms to minimize.
[2023-03-15 13:17:57] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 0 ms to minimize.
[2023-03-15 13:17:57] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 1 ms to minimize.
[2023-03-15 13:17:57] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 1 ms to minimize.
[2023-03-15 13:17:58] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 1 ms to minimize.
[2023-03-15 13:17:58] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 1 ms to minimize.
[2023-03-15 13:17:58] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 1 ms to minimize.
[2023-03-15 13:17:58] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 0 ms to minimize.
[2023-03-15 13:17:58] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1293 ms
[2023-03-15 13:17:58] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 1 ms to minimize.
[2023-03-15 13:17:59] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 1 ms to minimize.
[2023-03-15 13:17:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 271 ms
[2023-03-15 13:17:59] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 1 ms to minimize.
[2023-03-15 13:17:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-03-15 13:17:59] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 1 ms to minimize.
[2023-03-15 13:17:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-03-15 13:18:00] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 1 ms to minimize.
[2023-03-15 13:18:00] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 1 ms to minimize.
[2023-03-15 13:18:00] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 0 ms to minimize.
[2023-03-15 13:18:00] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 0 ms to minimize.
[2023-03-15 13:18:00] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 1 ms to minimize.
[2023-03-15 13:18:00] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 1 ms to minimize.
[2023-03-15 13:18:00] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 0 ms to minimize.
[2023-03-15 13:18:01] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 0 ms to minimize.
[2023-03-15 13:18:01] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1133 ms
[2023-03-15 13:18:01] [INFO ] After 57812ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :199
Attempting to minimize the solution found.
Minimization took 10737 ms.
[2023-03-15 13:18:12] [INFO ] After 77457ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :199
Fused 199 Parikh solutions to 195 different solutions.
Parikh walk visited 6 properties in 2421 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 16 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.
Interrupted random walk after 848765 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=28 ) properties 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 193) 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 193) 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 193) 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 193) 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 193) 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 193) 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 193) 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 193) 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 193) 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 193) 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 193) 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 193) 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 193) 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 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 53 ms. (steps per millisecond=188 ) properties (out of 193) 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 193) 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 193) 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 193) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 191) 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 191) 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 191) 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 191) 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 191) 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 191) 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 191) 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 191) 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 191) 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 191) 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 191) 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 191) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 190) 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 190) 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 190) 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 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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 190) 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 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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 190) 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 190) 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 190) 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 190) 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 190) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 86099 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 190 properties.
[2023-03-15 13:20:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:20:16] [INFO ] Invariant cache hit.
[2023-03-15 13:20:18] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2023-03-15 13:20:26] [INFO ] After 6242ms SMT Verify possible using state equation in real domain returned unsat :0 sat :22 real:168
[2023-03-15 13:20:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:20:27] [INFO ] After 886ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:190
[2023-03-15 13:20:27] [INFO ] After 10599ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:190
[2023-03-15 13:20:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 13:20:36] [INFO ] After 5577ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :190
[2023-03-15 13:20:42] [INFO ] After 6177ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :190
[2023-03-15 13:20:42] [INFO ] Deduced a trap composed of 10 places in 254 ms of which 1 ms to minimize.
[2023-03-15 13:20:43] [INFO ] Deduced a trap composed of 9 places in 246 ms of which 3 ms to minimize.
[2023-03-15 13:20:43] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 1 ms to minimize.
[2023-03-15 13:20:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 881 ms
[2023-03-15 13:20:43] [INFO ] Deduced a trap composed of 18 places in 227 ms of which 0 ms to minimize.
[2023-03-15 13:20:44] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 1 ms to minimize.
[2023-03-15 13:20:44] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 0 ms to minimize.
[2023-03-15 13:20:44] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 1 ms to minimize.
[2023-03-15 13:20:44] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 1 ms to minimize.
[2023-03-15 13:20:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1157 ms
[2023-03-15 13:20:45] [INFO ] Deduced a trap composed of 18 places in 211 ms of which 5 ms to minimize.
[2023-03-15 13:20:45] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 1 ms to minimize.
[2023-03-15 13:20:45] [INFO ] Deduced a trap composed of 18 places in 199 ms of which 1 ms to minimize.
[2023-03-15 13:20:45] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 1 ms to minimize.
[2023-03-15 13:20:45] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 1 ms to minimize.
[2023-03-15 13:20:46] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 1 ms to minimize.
[2023-03-15 13:20:46] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 1 ms to minimize.
[2023-03-15 13:20:46] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 0 ms to minimize.
[2023-03-15 13:20:46] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 1 ms to minimize.
[2023-03-15 13:20:47] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 1 ms to minimize.
[2023-03-15 13:20:47] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2237 ms
[2023-03-15 13:20:47] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 0 ms to minimize.
[2023-03-15 13:20:47] [INFO ] Deduced a trap composed of 20 places in 187 ms of which 1 ms to minimize.
[2023-03-15 13:20:47] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 1 ms to minimize.
[2023-03-15 13:20:48] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 1 ms to minimize.
[2023-03-15 13:20:48] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 4 ms to minimize.
[2023-03-15 13:20:48] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 0 ms to minimize.
[2023-03-15 13:20:48] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 1 ms to minimize.
[2023-03-15 13:20:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1615 ms
[2023-03-15 13:20:49] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 1 ms to minimize.
[2023-03-15 13:20:49] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 1 ms to minimize.
[2023-03-15 13:20:49] [INFO ] Deduced a trap composed of 36 places in 192 ms of which 1 ms to minimize.
[2023-03-15 13:20:49] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 1 ms to minimize.
[2023-03-15 13:20:49] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 0 ms to minimize.
[2023-03-15 13:20:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1098 ms
[2023-03-15 13:20:50] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 1 ms to minimize.
[2023-03-15 13:20:50] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 0 ms to minimize.
[2023-03-15 13:20:50] [INFO ] Deduced a trap composed of 58 places in 159 ms of which 1 ms to minimize.
[2023-03-15 13:20:50] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 0 ms to minimize.
[2023-03-15 13:20:50] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 1 ms to minimize.
[2023-03-15 13:20:51] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 0 ms to minimize.
[2023-03-15 13:20:51] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 1 ms to minimize.
[2023-03-15 13:20:51] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 1 ms to minimize.
[2023-03-15 13:20:51] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 1 ms to minimize.
[2023-03-15 13:20:51] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1701 ms
[2023-03-15 13:20:51] [INFO ] Deduced a trap composed of 18 places in 218 ms of which 0 ms to minimize.
[2023-03-15 13:20:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2023-03-15 13:20:52] [INFO ] Deduced a trap composed of 12 places in 269 ms of which 0 ms to minimize.
[2023-03-15 13:20:52] [INFO ] Deduced a trap composed of 12 places in 252 ms of which 1 ms to minimize.
[2023-03-15 13:20:52] [INFO ] Deduced a trap composed of 16 places in 237 ms of which 1 ms to minimize.
[2023-03-15 13:20:53] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 1 ms to minimize.
[2023-03-15 13:20:53] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 1 ms to minimize.
[2023-03-15 13:20:53] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 1 ms to minimize.
[2023-03-15 13:20:53] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 1 ms to minimize.
[2023-03-15 13:20:53] [INFO ] Deduced a trap composed of 60 places in 173 ms of which 1 ms to minimize.
[2023-03-15 13:20:54] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 1 ms to minimize.
[2023-03-15 13:20:54] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 0 ms to minimize.
[2023-03-15 13:20:54] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 0 ms to minimize.
[2023-03-15 13:20:54] [INFO ] Deduced a trap composed of 60 places in 182 ms of which 1 ms to minimize.
[2023-03-15 13:20:54] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2023-03-15 13:20:55] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 1 ms to minimize.
[2023-03-15 13:20:55] [INFO ] Deduced a trap composed of 40 places in 202 ms of which 1 ms to minimize.
[2023-03-15 13:20:55] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 1 ms to minimize.
[2023-03-15 13:20:55] [INFO ] Deduced a trap composed of 16 places in 192 ms of which 0 ms to minimize.
[2023-03-15 13:20:55] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 1 ms to minimize.
[2023-03-15 13:20:56] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 0 ms to minimize.
[2023-03-15 13:20:56] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 0 ms to minimize.
[2023-03-15 13:20:56] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 1 ms to minimize.
[2023-03-15 13:20:56] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 1 ms to minimize.
[2023-03-15 13:20:57] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 1 ms to minimize.
[2023-03-15 13:20:57] [INFO ] Deduced a trap composed of 20 places in 196 ms of which 1 ms to minimize.
[2023-03-15 13:20:57] [INFO ] Deduced a trap composed of 19 places in 208 ms of which 0 ms to minimize.
[2023-03-15 13:20:57] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 0 ms to minimize.
[2023-03-15 13:20:58] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 1 ms to minimize.
[2023-03-15 13:20:58] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 1 ms to minimize.
[2023-03-15 13:20:58] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 1 ms to minimize.
[2023-03-15 13:20:58] [INFO ] Deduced a trap composed of 61 places in 141 ms of which 1 ms to minimize.
[2023-03-15 13:20:58] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 1 ms to minimize.
[2023-03-15 13:20:58] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 1 ms to minimize.
[2023-03-15 13:20:59] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 1 ms to minimize.
[2023-03-15 13:20:59] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 0 ms to minimize.
[2023-03-15 13:20:59] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 1 ms to minimize.
[2023-03-15 13:20:59] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 1 ms to minimize.
[2023-03-15 13:20:59] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 0 ms to minimize.
[2023-03-15 13:20:59] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 7803 ms
[2023-03-15 13:21:00] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 0 ms to minimize.
[2023-03-15 13:21:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2023-03-15 13:21:00] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 1 ms to minimize.
[2023-03-15 13:21:00] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 1 ms to minimize.
[2023-03-15 13:21:00] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 1 ms to minimize.
[2023-03-15 13:21:01] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 0 ms to minimize.
[2023-03-15 13:21:01] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 0 ms to minimize.
[2023-03-15 13:21:01] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 0 ms to minimize.
[2023-03-15 13:21:01] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 0 ms to minimize.
[2023-03-15 13:21:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1505 ms
[2023-03-15 13:21:01] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 0 ms to minimize.
[2023-03-15 13:21:02] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 1 ms to minimize.
[2023-03-15 13:21:02] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 1 ms to minimize.
[2023-03-15 13:21:02] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 1 ms to minimize.
[2023-03-15 13:21:02] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 1 ms to minimize.
[2023-03-15 13:21:02] [INFO ] Deduced a trap composed of 48 places in 141 ms of which 0 ms to minimize.
[2023-03-15 13:21:03] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 4 ms to minimize.
[2023-03-15 13:21:03] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 1 ms to minimize.
[2023-03-15 13:21:03] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 1 ms to minimize.
[2023-03-15 13:21:03] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 1 ms to minimize.
[2023-03-15 13:21:03] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 1 ms to minimize.
[2023-03-15 13:21:04] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 1 ms to minimize.
[2023-03-15 13:21:04] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 1 ms to minimize.
[2023-03-15 13:21:04] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 1 ms to minimize.
[2023-03-15 13:21:04] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 0 ms to minimize.
[2023-03-15 13:21:04] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 1 ms to minimize.
[2023-03-15 13:21:04] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 0 ms to minimize.
[2023-03-15 13:21:04] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3116 ms
[2023-03-15 13:21:05] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 1 ms to minimize.
[2023-03-15 13:21:05] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 1 ms to minimize.
[2023-03-15 13:21:05] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 0 ms to minimize.
[2023-03-15 13:21:05] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 1 ms to minimize.
[2023-03-15 13:21:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 660 ms
[2023-03-15 13:21:05] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 0 ms to minimize.
[2023-03-15 13:21:06] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 0 ms to minimize.
[2023-03-15 13:21:06] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 0 ms to minimize.
[2023-03-15 13:21:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 545 ms
[2023-03-15 13:21:06] [INFO ] Deduced a trap composed of 26 places in 235 ms of which 1 ms to minimize.
[2023-03-15 13:21:06] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 1 ms to minimize.
[2023-03-15 13:21:06] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 0 ms to minimize.
[2023-03-15 13:21:07] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 1 ms to minimize.
[2023-03-15 13:21:07] [INFO ] Deduced a trap composed of 34 places in 204 ms of which 1 ms to minimize.
[2023-03-15 13:21:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1255 ms
[2023-03-15 13:21:07] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 0 ms to minimize.
[2023-03-15 13:21:07] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 0 ms to minimize.
[2023-03-15 13:21:08] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 1 ms to minimize.
[2023-03-15 13:21:08] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 1 ms to minimize.
[2023-03-15 13:21:08] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 0 ms to minimize.
[2023-03-15 13:21:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 833 ms
[2023-03-15 13:21:08] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 1 ms to minimize.
[2023-03-15 13:21:08] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 1 ms to minimize.
[2023-03-15 13:21:09] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 1 ms to minimize.
[2023-03-15 13:21:09] [INFO ] Deduced a trap composed of 27 places in 210 ms of which 1 ms to minimize.
[2023-03-15 13:21:09] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 1 ms to minimize.
[2023-03-15 13:21:09] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 1 ms to minimize.
[2023-03-15 13:21:10] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 0 ms to minimize.
[2023-03-15 13:21:10] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 0 ms to minimize.
[2023-03-15 13:21:10] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 1 ms to minimize.
[2023-03-15 13:21:10] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 1 ms to minimize.
[2023-03-15 13:21:11] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 1 ms to minimize.
[2023-03-15 13:21:11] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 1 ms to minimize.
[2023-03-15 13:21:11] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 1 ms to minimize.
[2023-03-15 13:21:11] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 1 ms to minimize.
[2023-03-15 13:21:11] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 1 ms to minimize.
[2023-03-15 13:21:12] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 1 ms to minimize.
[2023-03-15 13:21:12] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3762 ms
[2023-03-15 13:21:12] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 1 ms to minimize.
[2023-03-15 13:21:12] [INFO ] Deduced a trap composed of 55 places in 191 ms of which 1 ms to minimize.
[2023-03-15 13:21:12] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 1 ms to minimize.
[2023-03-15 13:21:13] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 1 ms to minimize.
[2023-03-15 13:21:13] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 1 ms to minimize.
[2023-03-15 13:21:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1091 ms
[2023-03-15 13:21:13] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 1 ms to minimize.
[2023-03-15 13:21:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2023-03-15 13:21:13] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 0 ms to minimize.
[2023-03-15 13:21:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-03-15 13:21:14] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 0 ms to minimize.
[2023-03-15 13:21:14] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2023-03-15 13:21:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 257 ms
[2023-03-15 13:21:14] [INFO ] Deduced a trap composed of 9 places in 251 ms of which 1 ms to minimize.
[2023-03-15 13:21:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 316 ms
[2023-03-15 13:21:15] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2023-03-15 13:21:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-03-15 13:21:15] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 1 ms to minimize.
[2023-03-15 13:21:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-15 13:21:16] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 0 ms to minimize.
[2023-03-15 13:21:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2023-03-15 13:21:16] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 1 ms to minimize.
[2023-03-15 13:21:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-03-15 13:21:16] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 1 ms to minimize.
[2023-03-15 13:21:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-15 13:21:17] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 0 ms to minimize.
[2023-03-15 13:21:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 364 ms
[2023-03-15 13:21:17] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 1 ms to minimize.
[2023-03-15 13:21:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-03-15 13:21:17] [INFO ] Deduced a trap composed of 16 places in 235 ms of which 1 ms to minimize.
[2023-03-15 13:21:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2023-03-15 13:21:18] [INFO ] Deduced a trap composed of 42 places in 236 ms of which 1 ms to minimize.
[2023-03-15 13:21:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 303 ms
[2023-03-15 13:21:18] [INFO ] Deduced a trap composed of 36 places in 209 ms of which 1 ms to minimize.
[2023-03-15 13:21:18] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 1 ms to minimize.
[2023-03-15 13:21:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 542 ms
[2023-03-15 13:21:19] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 1 ms to minimize.
[2023-03-15 13:21:19] [INFO ] Deduced a trap composed of 41 places in 187 ms of which 0 ms to minimize.
[2023-03-15 13:21:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 485 ms
[2023-03-15 13:21:20] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 0 ms to minimize.
[2023-03-15 13:21:20] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 1 ms to minimize.
[2023-03-15 13:21:20] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 1 ms to minimize.
[2023-03-15 13:21:20] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 1 ms to minimize.
[2023-03-15 13:21:20] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2023-03-15 13:21:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 955 ms
[2023-03-15 13:21:21] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2023-03-15 13:21:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-03-15 13:21:22] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 0 ms to minimize.
[2023-03-15 13:21:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2023-03-15 13:21:22] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 0 ms to minimize.
[2023-03-15 13:21:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2023-03-15 13:21:22] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 1 ms to minimize.
[2023-03-15 13:21:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2023-03-15 13:21:23] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 1 ms to minimize.
[2023-03-15 13:21:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 334 ms
[2023-03-15 13:21:23] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 0 ms to minimize.
[2023-03-15 13:21:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2023-03-15 13:21:25] [INFO ] Deduced a trap composed of 26 places in 201 ms of which 0 ms to minimize.
[2023-03-15 13:21:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2023-03-15 13:21:26] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 1 ms to minimize.
[2023-03-15 13:21:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2023-03-15 13:21:28] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 1 ms to minimize.
[2023-03-15 13:21:28] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 1 ms to minimize.
[2023-03-15 13:21:29] [INFO ] Deduced a trap composed of 44 places in 207 ms of which 1 ms to minimize.
[2023-03-15 13:21:29] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 0 ms to minimize.
[2023-03-15 13:21:29] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 1 ms to minimize.
[2023-03-15 13:21:29] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 1 ms to minimize.
[2023-03-15 13:21:29] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 0 ms to minimize.
[2023-03-15 13:21:29] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2040 ms
[2023-03-15 13:21:30] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 1 ms to minimize.
[2023-03-15 13:21:30] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 0 ms to minimize.
[2023-03-15 13:21:30] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 1 ms to minimize.
[2023-03-15 13:21:31] [INFO ] Deduced a trap composed of 54 places in 172 ms of which 1 ms to minimize.
[2023-03-15 13:21:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 836 ms
[2023-03-15 13:21:31] [INFO ] Deduced a trap composed of 42 places in 218 ms of which 1 ms to minimize.
[2023-03-15 13:21:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 307 ms
[2023-03-15 13:21:31] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 1 ms to minimize.
[2023-03-15 13:21:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2023-03-15 13:21:32] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2023-03-15 13:21:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2023-03-15 13:21:33] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 1 ms to minimize.
[2023-03-15 13:21:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2023-03-15 13:21:33] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 1 ms to minimize.
[2023-03-15 13:21:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2023-03-15 13:21:34] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 0 ms to minimize.
[2023-03-15 13:21:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-15 13:21:35] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 1 ms to minimize.
[2023-03-15 13:21:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2023-03-15 13:21:35] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 1 ms to minimize.
[2023-03-15 13:21:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2023-03-15 13:21:36] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 1 ms to minimize.
[2023-03-15 13:21:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2023-03-15 13:21:36] [INFO ] Deduced a trap composed of 44 places in 204 ms of which 0 ms to minimize.
[2023-03-15 13:21:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2023-03-15 13:21:37] [INFO ] Deduced a trap composed of 44 places in 199 ms of which 1 ms to minimize.
[2023-03-15 13:21:37] [INFO ] Deduced a trap composed of 28 places in 191 ms of which 1 ms to minimize.
[2023-03-15 13:21:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 490 ms
[2023-03-15 13:21:37] [INFO ] Deduced a trap composed of 54 places in 205 ms of which 1 ms to minimize.
[2023-03-15 13:21:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2023-03-15 13:21:39] [INFO ] Deduced a trap composed of 11 places in 240 ms of which 1 ms to minimize.
[2023-03-15 13:21:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2023-03-15 13:21:39] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 1 ms to minimize.
[2023-03-15 13:21:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2023-03-15 13:21:41] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 1 ms to minimize.
[2023-03-15 13:21:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-15 13:21:43] [INFO ] After 67151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :190
Attempting to minimize the solution found.
Minimization took 13447 ms.
[2023-03-15 13:21:56] [INFO ] After 89604ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :190
Parikh walk visited 0 properties in 3992 ms.
Support contains 156 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 16 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.
Interrupted random walk after 902057 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 54 ms. (steps per millisecond=185 ) properties (out of 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 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 :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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 190) 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 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 188) 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 188) 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 188) 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 188) 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 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 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 53 ms. (steps per millisecond=188 ) 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 :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 186) 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 186) 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 186) 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 186) 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 186) 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 186) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 77413 ms. (steps per millisecond=129 ) properties seen :0
Running SMT prover for 184 properties.
[2023-03-15 13:23:53] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:23:53] [INFO ] Invariant cache hit.
[2023-03-15 13:23:55] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 13:24:02] [INFO ] After 6025ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7 real:177
[2023-03-15 13:24:02] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:24:03] [INFO ] After 311ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:184
[2023-03-15 13:24:03] [INFO ] After 9333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:184
[2023-03-15 13:24:04] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 13:24:10] [INFO ] After 4741ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :184
[2023-03-15 13:24:16] [INFO ] After 5695ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :184
[2023-03-15 13:24:16] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 1 ms to minimize.
[2023-03-15 13:24:16] [INFO ] Deduced a trap composed of 9 places in 225 ms of which 0 ms to minimize.
[2023-03-15 13:24:17] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 1 ms to minimize.
[2023-03-15 13:24:17] [INFO ] Deduced a trap composed of 43 places in 204 ms of which 1 ms to minimize.
[2023-03-15 13:24:17] [INFO ] Deduced a trap composed of 50 places in 204 ms of which 0 ms to minimize.
[2023-03-15 13:24:17] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 1 ms to minimize.
[2023-03-15 13:24:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1517 ms
[2023-03-15 13:24:18] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 0 ms to minimize.
[2023-03-15 13:24:18] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 0 ms to minimize.
[2023-03-15 13:24:18] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 0 ms to minimize.
[2023-03-15 13:24:18] [INFO ] Deduced a trap composed of 24 places in 196 ms of which 1 ms to minimize.
[2023-03-15 13:24:19] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 1 ms to minimize.
[2023-03-15 13:24:19] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 1 ms to minimize.
[2023-03-15 13:24:19] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 1 ms to minimize.
[2023-03-15 13:24:19] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 1 ms to minimize.
[2023-03-15 13:24:19] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 1 ms to minimize.
[2023-03-15 13:24:20] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 2 ms to minimize.
[2023-03-15 13:24:20] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 1 ms to minimize.
[2023-03-15 13:24:20] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2286 ms
[2023-03-15 13:24:20] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 0 ms to minimize.
[2023-03-15 13:24:20] [INFO ] Deduced a trap composed of 55 places in 172 ms of which 1 ms to minimize.
[2023-03-15 13:24:20] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 1 ms to minimize.
[2023-03-15 13:24:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 637 ms
[2023-03-15 13:24:21] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 0 ms to minimize.
[2023-03-15 13:24:21] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 1 ms to minimize.
[2023-03-15 13:24:21] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 1 ms to minimize.
[2023-03-15 13:24:21] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 1 ms to minimize.
[2023-03-15 13:24:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 834 ms
[2023-03-15 13:24:22] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 0 ms to minimize.
[2023-03-15 13:24:22] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 1 ms to minimize.
[2023-03-15 13:24:22] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 1 ms to minimize.
[2023-03-15 13:24:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 691 ms
[2023-03-15 13:24:22] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 0 ms to minimize.
[2023-03-15 13:24:22] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 1 ms to minimize.
[2023-03-15 13:24:23] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 0 ms to minimize.
[2023-03-15 13:24:23] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 1 ms to minimize.
[2023-03-15 13:24:23] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 1 ms to minimize.
[2023-03-15 13:24:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 894 ms
[2023-03-15 13:24:23] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 1 ms to minimize.
[2023-03-15 13:24:23] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 1 ms to minimize.
[2023-03-15 13:24:24] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 0 ms to minimize.
[2023-03-15 13:24:24] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 0 ms to minimize.
[2023-03-15 13:24:24] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2023-03-15 13:24:24] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 1 ms to minimize.
[2023-03-15 13:24:24] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 1 ms to minimize.
[2023-03-15 13:24:24] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 1 ms to minimize.
[2023-03-15 13:24:24] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 1 ms to minimize.
[2023-03-15 13:24:24] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 0 ms to minimize.
[2023-03-15 13:24:25] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 1 ms to minimize.
[2023-03-15 13:24:25] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 0 ms to minimize.
[2023-03-15 13:24:25] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 0 ms to minimize.
[2023-03-15 13:24:25] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 0 ms to minimize.
[2023-03-15 13:24:25] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 1 ms to minimize.
[2023-03-15 13:24:25] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 1 ms to minimize.
[2023-03-15 13:24:25] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 1 ms to minimize.
[2023-03-15 13:24:26] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 1 ms to minimize.
[2023-03-15 13:24:26] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 0 ms to minimize.
[2023-03-15 13:24:26] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 0 ms to minimize.
[2023-03-15 13:24:26] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 0 ms to minimize.
[2023-03-15 13:24:26] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 0 ms to minimize.
[2023-03-15 13:24:26] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2023-03-15 13:24:26] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
[2023-03-15 13:24:26] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3332 ms
[2023-03-15 13:24:27] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 0 ms to minimize.
[2023-03-15 13:24:27] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 0 ms to minimize.
[2023-03-15 13:24:27] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 0 ms to minimize.
[2023-03-15 13:24:27] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 1 ms to minimize.
[2023-03-15 13:24:27] [INFO ] Deduced a trap composed of 16 places in 213 ms of which 1 ms to minimize.
[2023-03-15 13:24:27] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 1 ms to minimize.
[2023-03-15 13:24:28] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 0 ms to minimize.
[2023-03-15 13:24:28] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 0 ms to minimize.
[2023-03-15 13:24:28] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1431 ms
[2023-03-15 13:24:28] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 1 ms to minimize.
[2023-03-15 13:24:28] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 0 ms to minimize.
[2023-03-15 13:24:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 503 ms
[2023-03-15 13:24:29] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 1 ms to minimize.
[2023-03-15 13:24:29] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 1 ms to minimize.
[2023-03-15 13:24:29] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 1 ms to minimize.
[2023-03-15 13:24:29] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2023-03-15 13:24:29] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 1 ms to minimize.
[2023-03-15 13:24:30] [INFO ] Deduced a trap composed of 41 places in 221 ms of which 1 ms to minimize.
[2023-03-15 13:24:30] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 1 ms to minimize.
[2023-03-15 13:24:30] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 1 ms to minimize.
[2023-03-15 13:24:30] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 0 ms to minimize.
[2023-03-15 13:24:30] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 1 ms to minimize.
[2023-03-15 13:24:30] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1844 ms
[2023-03-15 13:24:31] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2023-03-15 13:24:31] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 1 ms to minimize.
[2023-03-15 13:24:31] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 1 ms to minimize.
[2023-03-15 13:24:31] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 1 ms to minimize.
[2023-03-15 13:24:31] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 0 ms to minimize.
[2023-03-15 13:24:31] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2023-03-15 13:24:31] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 0 ms to minimize.
[2023-03-15 13:24:32] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2023-03-15 13:24:32] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 1 ms to minimize.
[2023-03-15 13:24:32] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 0 ms to minimize.
[2023-03-15 13:24:32] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 1 ms to minimize.
[2023-03-15 13:24:32] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 0 ms to minimize.
[2023-03-15 13:24:32] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2054 ms
[2023-03-15 13:24:33] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 1 ms to minimize.
[2023-03-15 13:24:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-03-15 13:24:33] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 0 ms to minimize.
[2023-03-15 13:24:33] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 1 ms to minimize.
[2023-03-15 13:24:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 358 ms
[2023-03-15 13:24:33] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 1 ms to minimize.
[2023-03-15 13:24:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2023-03-15 13:24:34] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 1 ms to minimize.
[2023-03-15 13:24:34] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 1 ms to minimize.
[2023-03-15 13:24:34] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 1 ms to minimize.
[2023-03-15 13:24:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 478 ms
[2023-03-15 13:24:34] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 1 ms to minimize.
[2023-03-15 13:24:34] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 0 ms to minimize.
[2023-03-15 13:24:34] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 1 ms to minimize.
[2023-03-15 13:24:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 464 ms
[2023-03-15 13:24:35] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 1 ms to minimize.
[2023-03-15 13:24:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2023-03-15 13:24:35] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 1 ms to minimize.
[2023-03-15 13:24:35] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 1 ms to minimize.
[2023-03-15 13:24:35] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 1 ms to minimize.
[2023-03-15 13:24:36] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 1 ms to minimize.
[2023-03-15 13:24:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 726 ms
[2023-03-15 13:24:36] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 1 ms to minimize.
[2023-03-15 13:24:36] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 1 ms to minimize.
[2023-03-15 13:24:37] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 1 ms to minimize.
[2023-03-15 13:24:37] [INFO ] Deduced a trap composed of 20 places in 172 ms of which 1 ms to minimize.
[2023-03-15 13:24:37] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 1 ms to minimize.
[2023-03-15 13:24:37] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 1 ms to minimize.
[2023-03-15 13:24:37] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 1 ms to minimize.
[2023-03-15 13:24:37] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 0 ms to minimize.
[2023-03-15 13:24:38] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2023-03-15 13:24:38] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 0 ms to minimize.
[2023-03-15 13:24:38] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 0 ms to minimize.
[2023-03-15 13:24:38] [INFO ] Deduced a trap composed of 30 places in 175 ms of which 1 ms to minimize.
[2023-03-15 13:24:39] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 1 ms to minimize.
[2023-03-15 13:24:39] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2756 ms
[2023-03-15 13:24:39] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 1 ms to minimize.
[2023-03-15 13:24:39] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 1 ms to minimize.
[2023-03-15 13:24:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 372 ms
[2023-03-15 13:24:40] [INFO ] Deduced a trap composed of 36 places in 189 ms of which 0 ms to minimize.
[2023-03-15 13:24:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2023-03-15 13:24:40] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 0 ms to minimize.
[2023-03-15 13:24:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2023-03-15 13:24:40] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 1 ms to minimize.
[2023-03-15 13:24:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2023-03-15 13:24:41] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 0 ms to minimize.
[2023-03-15 13:24:41] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 0 ms to minimize.
[2023-03-15 13:24:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 374 ms
[2023-03-15 13:24:41] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 0 ms to minimize.
[2023-03-15 13:24:41] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 1 ms to minimize.
[2023-03-15 13:24:41] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2023-03-15 13:24:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 698 ms
[2023-03-15 13:24:42] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 0 ms to minimize.
[2023-03-15 13:24:42] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 0 ms to minimize.
[2023-03-15 13:24:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 389 ms
[2023-03-15 13:24:42] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 0 ms to minimize.
[2023-03-15 13:24:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2023-03-15 13:24:43] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 1 ms to minimize.
[2023-03-15 13:24:43] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 1 ms to minimize.
[2023-03-15 13:24:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 434 ms
[2023-03-15 13:24:43] [INFO ] Deduced a trap composed of 43 places in 205 ms of which 1 ms to minimize.
[2023-03-15 13:24:43] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 0 ms to minimize.
[2023-03-15 13:24:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 505 ms
[2023-03-15 13:24:44] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 1 ms to minimize.
[2023-03-15 13:24:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2023-03-15 13:24:44] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 1 ms to minimize.
[2023-03-15 13:24:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2023-03-15 13:24:44] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 1 ms to minimize.
[2023-03-15 13:24:44] [INFO ] Deduced a trap composed of 20 places in 222 ms of which 1 ms to minimize.
[2023-03-15 13:24:45] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 1 ms to minimize.
[2023-03-15 13:24:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 710 ms
[2023-03-15 13:24:45] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 0 ms to minimize.
[2023-03-15 13:24:45] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 1 ms to minimize.
[2023-03-15 13:24:46] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 1 ms to minimize.
[2023-03-15 13:24:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 878 ms
[2023-03-15 13:24:46] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 1 ms to minimize.
[2023-03-15 13:24:46] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 1 ms to minimize.
[2023-03-15 13:24:46] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 0 ms to minimize.
[2023-03-15 13:24:46] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 1 ms to minimize.
[2023-03-15 13:24:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 697 ms
[2023-03-15 13:24:47] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 0 ms to minimize.
[2023-03-15 13:24:47] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 1 ms to minimize.
[2023-03-15 13:24:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 322 ms
[2023-03-15 13:24:47] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2023-03-15 13:24:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-15 13:24:48] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 0 ms to minimize.
[2023-03-15 13:24:48] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 1 ms to minimize.
[2023-03-15 13:24:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 382 ms
[2023-03-15 13:24:48] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 1 ms to minimize.
[2023-03-15 13:24:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-15 13:24:49] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 1 ms to minimize.
[2023-03-15 13:24:49] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 1 ms to minimize.
[2023-03-15 13:24:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 417 ms
[2023-03-15 13:24:50] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 0 ms to minimize.
[2023-03-15 13:24:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2023-03-15 13:24:50] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 1 ms to minimize.
[2023-03-15 13:24:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-15 13:24:51] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 1 ms to minimize.
[2023-03-15 13:24:52] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 0 ms to minimize.
[2023-03-15 13:24:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 466 ms
[2023-03-15 13:24:52] [INFO ] Deduced a trap composed of 39 places in 196 ms of which 1 ms to minimize.
[2023-03-15 13:24:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2023-03-15 13:24:52] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 0 ms to minimize.
[2023-03-15 13:24:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2023-03-15 13:24:53] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 1 ms to minimize.
[2023-03-15 13:24:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2023-03-15 13:24:54] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 1 ms to minimize.
[2023-03-15 13:24:55] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 1 ms to minimize.
[2023-03-15 13:24:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 358 ms
[2023-03-15 13:24:55] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 0 ms to minimize.
[2023-03-15 13:24:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2023-03-15 13:24:56] [INFO ] Deduced a trap composed of 11 places in 242 ms of which 1 ms to minimize.
[2023-03-15 13:24:57] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 1 ms to minimize.
[2023-03-15 13:24:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 568 ms
[2023-03-15 13:24:57] [INFO ] Deduced a trap composed of 29 places in 205 ms of which 0 ms to minimize.
[2023-03-15 13:24:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2023-03-15 13:24:58] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2023-03-15 13:24:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-15 13:25:00] [INFO ] Deduced a trap composed of 20 places in 172 ms of which 0 ms to minimize.
[2023-03-15 13:25:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2023-03-15 13:25:00] [INFO ] Deduced a trap composed of 11 places in 247 ms of which 1 ms to minimize.
[2023-03-15 13:25:01] [INFO ] Deduced a trap composed of 33 places in 214 ms of which 0 ms to minimize.
[2023-03-15 13:25:01] [INFO ] Deduced a trap composed of 54 places in 175 ms of which 1 ms to minimize.
[2023-03-15 13:25:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 794 ms
[2023-03-15 13:25:01] [INFO ] Deduced a trap composed of 49 places in 228 ms of which 1 ms to minimize.
[2023-03-15 13:25:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
[2023-03-15 13:25:02] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 0 ms to minimize.
[2023-03-15 13:25:02] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 1 ms to minimize.
[2023-03-15 13:25:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 357 ms
[2023-03-15 13:25:03] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 1 ms to minimize.
[2023-03-15 13:25:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2023-03-15 13:25:03] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 0 ms to minimize.
[2023-03-15 13:25:04] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 0 ms to minimize.
[2023-03-15 13:25:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 490 ms
[2023-03-15 13:25:04] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 1 ms to minimize.
[2023-03-15 13:25:04] [INFO ] Deduced a trap composed of 32 places in 204 ms of which 0 ms to minimize.
[2023-03-15 13:25:04] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 1 ms to minimize.
[2023-03-15 13:25:05] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 1 ms to minimize.
[2023-03-15 13:25:05] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 1 ms to minimize.
[2023-03-15 13:25:05] [INFO ] Deduced a trap composed of 42 places in 195 ms of which 1 ms to minimize.
[2023-03-15 13:25:05] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 1 ms to minimize.
[2023-03-15 13:25:05] [INFO ] Deduced a trap composed of 44 places in 188 ms of which 0 ms to minimize.
[2023-03-15 13:25:06] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 1 ms to minimize.
[2023-03-15 13:25:06] [INFO ] Deduced a trap composed of 42 places in 192 ms of which 1 ms to minimize.
[2023-03-15 13:25:06] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 1 ms to minimize.
[2023-03-15 13:25:06] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 0 ms to minimize.
[2023-03-15 13:25:06] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 1 ms to minimize.
[2023-03-15 13:25:07] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3369 ms
[2023-03-15 13:25:08] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 0 ms to minimize.
[2023-03-15 13:25:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-15 13:25:09] [INFO ] Deduced a trap composed of 20 places in 203 ms of which 0 ms to minimize.
[2023-03-15 13:25:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2023-03-15 13:25:10] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 1 ms to minimize.
[2023-03-15 13:25:10] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 1 ms to minimize.
[2023-03-15 13:25:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 500 ms
[2023-03-15 13:25:10] [INFO ] Deduced a trap composed of 35 places in 230 ms of which 1 ms to minimize.
[2023-03-15 13:25:10] [INFO ] Deduced a trap composed of 38 places in 217 ms of which 1 ms to minimize.
[2023-03-15 13:25:11] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 1 ms to minimize.
[2023-03-15 13:25:11] [INFO ] Deduced a trap composed of 50 places in 175 ms of which 0 ms to minimize.
[2023-03-15 13:25:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1037 ms
[2023-03-15 13:25:11] [INFO ] Deduced a trap composed of 64 places in 151 ms of which 0 ms to minimize.
[2023-03-15 13:25:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-15 13:25:12] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 0 ms to minimize.
[2023-03-15 13:25:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2023-03-15 13:25:13] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 1 ms to minimize.
[2023-03-15 13:25:13] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 1 ms to minimize.
[2023-03-15 13:25:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 382 ms
[2023-03-15 13:25:13] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 0 ms to minimize.
[2023-03-15 13:25:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2023-03-15 13:25:14] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 0 ms to minimize.
[2023-03-15 13:25:14] [INFO ] Deduced a trap composed of 22 places in 221 ms of which 1 ms to minimize.
[2023-03-15 13:25:14] [INFO ] Deduced a trap composed of 40 places in 206 ms of which 0 ms to minimize.
[2023-03-15 13:25:14] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 1 ms to minimize.
[2023-03-15 13:25:15] [INFO ] Deduced a trap composed of 30 places in 177 ms of which 1 ms to minimize.
[2023-03-15 13:25:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1253 ms
[2023-03-15 13:25:16] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 0 ms to minimize.
[2023-03-15 13:25:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2023-03-15 13:25:17] [INFO ] After 66592ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :184
Attempting to minimize the solution found.
Minimization took 17009 ms.
[2023-03-15 13:25:34] [INFO ] After 91121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :184
Fused 184 Parikh solutions to 181 different solutions.
Parikh walk visited 0 properties in 2369 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 22 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 22 ms. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 873771 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=29 ) properties 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 84680 ms. (steps per millisecond=118 ) properties seen :0
Running SMT prover for 184 properties.
[2023-03-15 13:27:34] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:27:34] [INFO ] Invariant cache hit.
[2023-03-15 13:27:35] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:27:42] [INFO ] After 5901ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7 real:177
[2023-03-15 13:27:42] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:27:42] [INFO ] After 322ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:184
[2023-03-15 13:27:42] [INFO ] After 8890ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:184
[2023-03-15 13:27:44] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 13:27:51] [INFO ] After 5384ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :184
[2023-03-15 13:27:57] [INFO ] After 5936ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :184
[2023-03-15 13:27:57] [INFO ] Deduced a trap composed of 17 places in 245 ms of which 1 ms to minimize.
[2023-03-15 13:27:58] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 1 ms to minimize.
[2023-03-15 13:27:58] [INFO ] Deduced a trap composed of 10 places in 223 ms of which 0 ms to minimize.
[2023-03-15 13:27:58] [INFO ] Deduced a trap composed of 43 places in 211 ms of which 1 ms to minimize.
[2023-03-15 13:27:58] [INFO ] Deduced a trap composed of 50 places in 216 ms of which 0 ms to minimize.
[2023-03-15 13:27:59] [INFO ] Deduced a trap composed of 12 places in 218 ms of which 0 ms to minimize.
[2023-03-15 13:27:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1575 ms
[2023-03-15 13:27:59] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 1 ms to minimize.
[2023-03-15 13:27:59] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 0 ms to minimize.
[2023-03-15 13:28:00] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 0 ms to minimize.
[2023-03-15 13:28:00] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 0 ms to minimize.
[2023-03-15 13:28:00] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 1 ms to minimize.
[2023-03-15 13:28:00] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 1 ms to minimize.
[2023-03-15 13:28:01] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 0 ms to minimize.
[2023-03-15 13:28:01] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 1 ms to minimize.
[2023-03-15 13:28:01] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 1 ms to minimize.
[2023-03-15 13:28:01] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 0 ms to minimize.
[2023-03-15 13:28:01] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 0 ms to minimize.
[2023-03-15 13:28:01] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2450 ms
[2023-03-15 13:28:02] [INFO ] Deduced a trap composed of 18 places in 185 ms of which 0 ms to minimize.
[2023-03-15 13:28:02] [INFO ] Deduced a trap composed of 55 places in 192 ms of which 1 ms to minimize.
[2023-03-15 13:28:02] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 1 ms to minimize.
[2023-03-15 13:28:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 689 ms
[2023-03-15 13:28:02] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 1 ms to minimize.
[2023-03-15 13:28:03] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 1 ms to minimize.
[2023-03-15 13:28:03] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 1 ms to minimize.
[2023-03-15 13:28:03] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 1 ms to minimize.
[2023-03-15 13:28:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 877 ms
[2023-03-15 13:28:03] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 0 ms to minimize.
[2023-03-15 13:28:04] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 1 ms to minimize.
[2023-03-15 13:28:04] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 1 ms to minimize.
[2023-03-15 13:28:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 733 ms
[2023-03-15 13:28:04] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 1 ms to minimize.
[2023-03-15 13:28:04] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 0 ms to minimize.
[2023-03-15 13:28:04] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 1 ms to minimize.
[2023-03-15 13:28:05] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 0 ms to minimize.
[2023-03-15 13:28:05] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 1 ms to minimize.
[2023-03-15 13:28:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 976 ms
[2023-03-15 13:28:05] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 0 ms to minimize.
[2023-03-15 13:28:05] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 1 ms to minimize.
[2023-03-15 13:28:05] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 1 ms to minimize.
[2023-03-15 13:28:06] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 1 ms to minimize.
[2023-03-15 13:28:06] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 0 ms to minimize.
[2023-03-15 13:28:06] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 1 ms to minimize.
[2023-03-15 13:28:06] [INFO ] Deduced a trap composed of 27 places in 223 ms of which 0 ms to minimize.
[2023-03-15 13:28:07] [INFO ] Deduced a trap composed of 58 places in 212 ms of which 1 ms to minimize.
[2023-03-15 13:28:07] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 0 ms to minimize.
[2023-03-15 13:28:07] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 1 ms to minimize.
[2023-03-15 13:28:07] [INFO ] Deduced a trap composed of 52 places in 195 ms of which 1 ms to minimize.
[2023-03-15 13:28:08] [INFO ] Deduced a trap composed of 28 places in 196 ms of which 0 ms to minimize.
[2023-03-15 13:28:08] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 1 ms to minimize.
[2023-03-15 13:28:08] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 0 ms to minimize.
[2023-03-15 13:28:08] [INFO ] Deduced a trap composed of 43 places in 211 ms of which 0 ms to minimize.
[2023-03-15 13:28:09] [INFO ] Deduced a trap composed of 18 places in 220 ms of which 1 ms to minimize.
[2023-03-15 13:28:09] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 0 ms to minimize.
[2023-03-15 13:28:09] [INFO ] Deduced a trap composed of 51 places in 162 ms of which 0 ms to minimize.
[2023-03-15 13:28:09] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 1 ms to minimize.
[2023-03-15 13:28:09] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 1 ms to minimize.
[2023-03-15 13:28:10] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 1 ms to minimize.
[2023-03-15 13:28:10] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 1 ms to minimize.
[2023-03-15 13:28:10] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 0 ms to minimize.
[2023-03-15 13:28:10] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 0 ms to minimize.
[2023-03-15 13:28:10] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5428 ms
[2023-03-15 13:28:11] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 1 ms to minimize.
[2023-03-15 13:28:11] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 1 ms to minimize.
[2023-03-15 13:28:11] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 1 ms to minimize.
[2023-03-15 13:28:11] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 0 ms to minimize.
[2023-03-15 13:28:12] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 1 ms to minimize.
[2023-03-15 13:28:12] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 1 ms to minimize.
[2023-03-15 13:28:12] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 0 ms to minimize.
[2023-03-15 13:28:12] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 1 ms to minimize.
[2023-03-15 13:28:12] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1876 ms
[2023-03-15 13:28:12] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 1 ms to minimize.
[2023-03-15 13:28:13] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 1 ms to minimize.
[2023-03-15 13:28:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 499 ms
[2023-03-15 13:28:13] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 1 ms to minimize.
[2023-03-15 13:28:13] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 1 ms to minimize.
[2023-03-15 13:28:13] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 1 ms to minimize.
[2023-03-15 13:28:14] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 0 ms to minimize.
[2023-03-15 13:28:14] [INFO ] Deduced a trap composed of 27 places in 248 ms of which 0 ms to minimize.
[2023-03-15 13:28:14] [INFO ] Deduced a trap composed of 41 places in 250 ms of which 1 ms to minimize.
[2023-03-15 13:28:14] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 0 ms to minimize.
[2023-03-15 13:28:15] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 1 ms to minimize.
[2023-03-15 13:28:15] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 0 ms to minimize.
[2023-03-15 13:28:15] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 1 ms to minimize.
[2023-03-15 13:28:15] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2196 ms
[2023-03-15 13:28:15] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 1 ms to minimize.
[2023-03-15 13:28:16] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 0 ms to minimize.
[2023-03-15 13:28:16] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 1 ms to minimize.
[2023-03-15 13:28:16] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 1 ms to minimize.
[2023-03-15 13:28:16] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 0 ms to minimize.
[2023-03-15 13:28:16] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 1 ms to minimize.
[2023-03-15 13:28:16] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 1 ms to minimize.
[2023-03-15 13:28:17] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 0 ms to minimize.
[2023-03-15 13:28:17] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 1 ms to minimize.
[2023-03-15 13:28:17] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 1 ms to minimize.
[2023-03-15 13:28:17] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 1 ms to minimize.
[2023-03-15 13:28:17] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 1 ms to minimize.
[2023-03-15 13:28:17] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2344 ms
[2023-03-15 13:28:18] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
[2023-03-15 13:28:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2023-03-15 13:28:18] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 0 ms to minimize.
[2023-03-15 13:28:18] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
[2023-03-15 13:28:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 344 ms
[2023-03-15 13:28:18] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 1 ms to minimize.
[2023-03-15 13:28:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-03-15 13:28:19] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 0 ms to minimize.
[2023-03-15 13:28:19] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 1 ms to minimize.
[2023-03-15 13:28:19] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 0 ms to minimize.
[2023-03-15 13:28:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 429 ms
[2023-03-15 13:28:19] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 0 ms to minimize.
[2023-03-15 13:28:19] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2023-03-15 13:28:19] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2023-03-15 13:28:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 424 ms
[2023-03-15 13:28:20] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 0 ms to minimize.
[2023-03-15 13:28:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-15 13:28:20] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 0 ms to minimize.
[2023-03-15 13:28:20] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 1 ms to minimize.
[2023-03-15 13:28:20] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 1 ms to minimize.
[2023-03-15 13:28:20] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2023-03-15 13:28:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 663 ms
[2023-03-15 13:28:21] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 1 ms to minimize.
[2023-03-15 13:28:21] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 0 ms to minimize.
[2023-03-15 13:28:21] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 1 ms to minimize.
[2023-03-15 13:28:22] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 1 ms to minimize.
[2023-03-15 13:28:22] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 1 ms to minimize.
[2023-03-15 13:28:22] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 0 ms to minimize.
[2023-03-15 13:28:22] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 0 ms to minimize.
[2023-03-15 13:28:22] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 0 ms to minimize.
[2023-03-15 13:28:22] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2023-03-15 13:28:23] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 1 ms to minimize.
[2023-03-15 13:28:23] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 0 ms to minimize.
[2023-03-15 13:28:23] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 0 ms to minimize.
[2023-03-15 13:28:23] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 0 ms to minimize.
[2023-03-15 13:28:24] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2817 ms
[2023-03-15 13:28:24] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 1 ms to minimize.
[2023-03-15 13:28:24] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 1 ms to minimize.
[2023-03-15 13:28:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 418 ms
[2023-03-15 13:28:25] [INFO ] Deduced a trap composed of 36 places in 250 ms of which 1 ms to minimize.
[2023-03-15 13:28:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 316 ms
[2023-03-15 13:28:25] [INFO ] Deduced a trap composed of 42 places in 223 ms of which 1 ms to minimize.
[2023-03-15 13:28:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
[2023-03-15 13:28:25] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 0 ms to minimize.
[2023-03-15 13:28:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-03-15 13:28:26] [INFO ] Deduced a trap composed of 34 places in 139 ms of which 0 ms to minimize.
[2023-03-15 13:28:26] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 1 ms to minimize.
[2023-03-15 13:28:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 402 ms
[2023-03-15 13:28:26] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 0 ms to minimize.
[2023-03-15 13:28:26] [INFO ] Deduced a trap composed of 27 places in 220 ms of which 1 ms to minimize.
[2023-03-15 13:28:27] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 1 ms to minimize.
[2023-03-15 13:28:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 882 ms
[2023-03-15 13:28:27] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 1 ms to minimize.
[2023-03-15 13:28:27] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 0 ms to minimize.
[2023-03-15 13:28:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 481 ms
[2023-03-15 13:28:28] [INFO ] Deduced a trap composed of 27 places in 195 ms of which 1 ms to minimize.
[2023-03-15 13:28:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 364 ms
[2023-03-15 13:28:28] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 1 ms to minimize.
[2023-03-15 13:28:28] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 1 ms to minimize.
[2023-03-15 13:28:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 405 ms
[2023-03-15 13:28:29] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 0 ms to minimize.
[2023-03-15 13:28:29] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 0 ms to minimize.
[2023-03-15 13:28:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 451 ms
[2023-03-15 13:28:29] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 1 ms to minimize.
[2023-03-15 13:28:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2023-03-15 13:28:29] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 1 ms to minimize.
[2023-03-15 13:28:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2023-03-15 13:28:30] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 1 ms to minimize.
[2023-03-15 13:28:30] [INFO ] Deduced a trap composed of 20 places in 203 ms of which 0 ms to minimize.
[2023-03-15 13:28:30] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 1 ms to minimize.
[2023-03-15 13:28:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 703 ms
[2023-03-15 13:28:30] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2023-03-15 13:28:31] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 0 ms to minimize.
[2023-03-15 13:28:31] [INFO ] Deduced a trap composed of 9 places in 253 ms of which 0 ms to minimize.
[2023-03-15 13:28:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 881 ms
[2023-03-15 13:28:31] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 0 ms to minimize.
[2023-03-15 13:28:32] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 0 ms to minimize.
[2023-03-15 13:28:32] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 0 ms to minimize.
[2023-03-15 13:28:32] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 0 ms to minimize.
[2023-03-15 13:28:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 679 ms
[2023-03-15 13:28:32] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 0 ms to minimize.
[2023-03-15 13:28:32] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 1 ms to minimize.
[2023-03-15 13:28:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 338 ms
[2023-03-15 13:28:33] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 0 ms to minimize.
[2023-03-15 13:28:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-15 13:28:33] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2023-03-15 13:28:33] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 1 ms to minimize.
[2023-03-15 13:28:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 385 ms
[2023-03-15 13:28:34] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
[2023-03-15 13:28:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-03-15 13:28:35] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 1 ms to minimize.
[2023-03-15 13:28:35] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 0 ms to minimize.
[2023-03-15 13:28:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 386 ms
[2023-03-15 13:28:35] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 0 ms to minimize.
[2023-03-15 13:28:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2023-03-15 13:28:36] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 1 ms to minimize.
[2023-03-15 13:28:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2023-03-15 13:28:37] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 1 ms to minimize.
[2023-03-15 13:28:37] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 1 ms to minimize.
[2023-03-15 13:28:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 445 ms
[2023-03-15 13:28:37] [INFO ] Deduced a trap composed of 39 places in 202 ms of which 1 ms to minimize.
[2023-03-15 13:28:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2023-03-15 13:28:38] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 1 ms to minimize.
[2023-03-15 13:28:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-03-15 13:28:38] [INFO ] Deduced a trap composed of 37 places in 231 ms of which 0 ms to minimize.
[2023-03-15 13:28:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2023-03-15 13:28:40] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 0 ms to minimize.
[2023-03-15 13:28:40] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 1 ms to minimize.
[2023-03-15 13:28:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 371 ms
[2023-03-15 13:28:41] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 0 ms to minimize.
[2023-03-15 13:28:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-03-15 13:28:42] [INFO ] Deduced a trap composed of 11 places in 251 ms of which 1 ms to minimize.
[2023-03-15 13:28:42] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 1 ms to minimize.
[2023-03-15 13:28:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 567 ms
[2023-03-15 13:28:43] [INFO ] Deduced a trap composed of 29 places in 212 ms of which 1 ms to minimize.
[2023-03-15 13:28:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2023-03-15 13:28:44] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2023-03-15 13:28:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-03-15 13:28:46] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 0 ms to minimize.
[2023-03-15 13:28:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2023-03-15 13:28:46] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 1 ms to minimize.
[2023-03-15 13:28:46] [INFO ] Deduced a trap composed of 33 places in 205 ms of which 0 ms to minimize.
[2023-03-15 13:28:46] [INFO ] Deduced a trap composed of 54 places in 125 ms of which 0 ms to minimize.
[2023-03-15 13:28:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 651 ms
[2023-03-15 13:28:47] [INFO ] Deduced a trap composed of 49 places in 241 ms of which 1 ms to minimize.
[2023-03-15 13:28:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2023-03-15 13:28:48] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 0 ms to minimize.
[2023-03-15 13:28:48] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 1 ms to minimize.
[2023-03-15 13:28:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 359 ms
[2023-03-15 13:28:48] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 1 ms to minimize.
[2023-03-15 13:28:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2023-03-15 13:28:49] [INFO ] Deduced a trap composed of 44 places in 220 ms of which 1 ms to minimize.
[2023-03-15 13:28:49] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 0 ms to minimize.
[2023-03-15 13:28:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 491 ms
[2023-03-15 13:28:49] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 1 ms to minimize.
[2023-03-15 13:28:50] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 1 ms to minimize.
[2023-03-15 13:28:50] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 0 ms to minimize.
[2023-03-15 13:28:50] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 0 ms to minimize.
[2023-03-15 13:28:50] [INFO ] Deduced a trap composed of 42 places in 182 ms of which 1 ms to minimize.
[2023-03-15 13:28:51] [INFO ] Deduced a trap composed of 42 places in 199 ms of which 1 ms to minimize.
[2023-03-15 13:28:51] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 1 ms to minimize.
[2023-03-15 13:28:51] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 0 ms to minimize.
[2023-03-15 13:28:51] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 1 ms to minimize.
[2023-03-15 13:28:51] [INFO ] Deduced a trap composed of 42 places in 182 ms of which 1 ms to minimize.
[2023-03-15 13:28:52] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 1 ms to minimize.
[2023-03-15 13:28:52] [INFO ] Deduced a trap composed of 58 places in 151 ms of which 1 ms to minimize.
[2023-03-15 13:28:52] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 1 ms to minimize.
[2023-03-15 13:28:52] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3343 ms
[2023-03-15 13:28:53] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 1 ms to minimize.
[2023-03-15 13:28:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2023-03-15 13:28:55] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 1 ms to minimize.
[2023-03-15 13:28:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2023-03-15 13:28:55] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 1 ms to minimize.
[2023-03-15 13:28:55] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 0 ms to minimize.
[2023-03-15 13:28:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 490 ms
[2023-03-15 13:28:56] [INFO ] Deduced a trap composed of 35 places in 253 ms of which 1 ms to minimize.
[2023-03-15 13:28:56] [INFO ] Deduced a trap composed of 38 places in 216 ms of which 1 ms to minimize.
[2023-03-15 13:28:56] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 1 ms to minimize.
[2023-03-15 13:28:56] [INFO ] Deduced a trap composed of 50 places in 171 ms of which 0 ms to minimize.
[2023-03-15 13:28:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1046 ms
[2023-03-15 13:28:57] [INFO ] Deduced a trap composed of 64 places in 177 ms of which 0 ms to minimize.
[2023-03-15 13:28:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2023-03-15 13:28:57] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 1 ms to minimize.
[2023-03-15 13:28:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2023-03-15 13:28:58] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 0 ms to minimize.
[2023-03-15 13:28:59] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 1 ms to minimize.
[2023-03-15 13:28:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 381 ms
[2023-03-15 13:28:59] [INFO ] Deduced a trap composed of 33 places in 200 ms of which 1 ms to minimize.
[2023-03-15 13:28:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2023-03-15 13:28:59] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 0 ms to minimize.
[2023-03-15 13:28:59] [INFO ] Deduced a trap composed of 22 places in 213 ms of which 1 ms to minimize.
[2023-03-15 13:29:00] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 1 ms to minimize.
[2023-03-15 13:29:00] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 0 ms to minimize.
[2023-03-15 13:29:00] [INFO ] Deduced a trap composed of 30 places in 171 ms of which 1 ms to minimize.
[2023-03-15 13:29:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1210 ms
[2023-03-15 13:29:02] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 0 ms to minimize.
[2023-03-15 13:29:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2023-03-15 13:29:02] [INFO ] After 71018ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :184
Attempting to minimize the solution found.
Minimization took 16321 ms.
[2023-03-15 13:29:19] [INFO ] After 96065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :184
Fused 184 Parikh solutions to 181 different solutions.
Parikh walk visited 0 properties in 2229 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 29 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 29 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 14 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 13:29:21] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:29:21] [INFO ] Invariant cache hit.
[2023-03-15 13:29:21] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-15 13:29:21] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:29:21] [INFO ] Invariant cache hit.
[2023-03-15 13:29:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:29:22] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2023-03-15 13:29:22] [INFO ] Redundant transitions in 72 ms returned []
[2023-03-15 13:29:22] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:29:22] [INFO ] Invariant cache hit.
[2023-03-15 13:29:22] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1318 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 3839 ms. (steps per millisecond=26 ) properties (out of 153) seen :67
Running SMT prover for 86 properties.
[2023-03-15 13:29:26] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:29:26] [INFO ] Invariant cache hit.
[2023-03-15 13:29:26] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:29:26] [INFO ] After 313ms SMT Verify possible using state equation in real domain returned unsat :0 sat :86
[2023-03-15 13:29:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:29:27] [INFO ] After 306ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :86
[2023-03-15 13:29:27] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 0 ms to minimize.
[2023-03-15 13:29:27] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 1 ms to minimize.
[2023-03-15 13:29:27] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 1 ms to minimize.
[2023-03-15 13:29:27] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 0 ms to minimize.
[2023-03-15 13:29:28] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 1 ms to minimize.
[2023-03-15 13:29:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 751 ms
[2023-03-15 13:29:28] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 0 ms to minimize.
[2023-03-15 13:29:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2023-03-15 13:29:29] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2023-03-15 13:29:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-03-15 13:29:29] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2023-03-15 13:29:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-03-15 13:29:29] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2023-03-15 13:29:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-15 13:29:29] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 0 ms to minimize.
[2023-03-15 13:29:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-03-15 13:29:30] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 0 ms to minimize.
[2023-03-15 13:29:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-03-15 13:29:30] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2023-03-15 13:29:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-15 13:29:30] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 0 ms to minimize.
[2023-03-15 13:29:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-15 13:29:30] [INFO ] Deduced a trap composed of 48 places in 127 ms of which 0 ms to minimize.
[2023-03-15 13:29:30] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 0 ms to minimize.
[2023-03-15 13:29:31] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2023-03-15 13:29:31] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 0 ms to minimize.
[2023-03-15 13:29:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 488 ms
[2023-03-15 13:29:31] [INFO ] Deduced a trap composed of 60 places in 115 ms of which 1 ms to minimize.
[2023-03-15 13:29:31] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 0 ms to minimize.
[2023-03-15 13:29:31] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2023-03-15 13:29:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 375 ms
[2023-03-15 13:29:31] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 0 ms to minimize.
[2023-03-15 13:29:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-03-15 13:29:32] [INFO ] Deduced a trap composed of 54 places in 124 ms of which 0 ms to minimize.
[2023-03-15 13:29:32] [INFO ] Deduced a trap composed of 69 places in 126 ms of which 1 ms to minimize.
[2023-03-15 13:29:32] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 1 ms to minimize.
[2023-03-15 13:29:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 446 ms
[2023-03-15 13:29:33] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 0 ms to minimize.
[2023-03-15 13:29:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-03-15 13:29:33] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 0 ms to minimize.
[2023-03-15 13:29:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-15 13:29:33] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 0 ms to minimize.
[2023-03-15 13:29:33] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2023-03-15 13:29:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 218 ms
[2023-03-15 13:29:33] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 0 ms to minimize.
[2023-03-15 13:29:33] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 0 ms to minimize.
[2023-03-15 13:29:34] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 1 ms to minimize.
[2023-03-15 13:29:34] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 1 ms to minimize.
[2023-03-15 13:29:34] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 1 ms to minimize.
[2023-03-15 13:29:34] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 0 ms to minimize.
[2023-03-15 13:29:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 767 ms
[2023-03-15 13:29:34] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2023-03-15 13:29:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-15 13:29:35] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 1 ms to minimize.
[2023-03-15 13:29:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-03-15 13:29:35] [INFO ] After 8275ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:86
[2023-03-15 13:29:35] [INFO ] After 8785ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:86
[2023-03-15 13:29:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:29:35] [INFO ] After 300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :86
[2023-03-15 13:29:36] [INFO ] After 342ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :86
[2023-03-15 13:29:36] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2023-03-15 13:29:36] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 0 ms to minimize.
[2023-03-15 13:29:36] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 1 ms to minimize.
[2023-03-15 13:29:36] [INFO ] Deduced a trap composed of 10 places in 221 ms of which 1 ms to minimize.
[2023-03-15 13:29:37] [INFO ] Deduced a trap composed of 34 places in 158 ms of which 0 ms to minimize.
[2023-03-15 13:29:37] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 0 ms to minimize.
[2023-03-15 13:29:37] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 0 ms to minimize.
[2023-03-15 13:29:37] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 1 ms to minimize.
[2023-03-15 13:29:37] [INFO ] Deduced a trap composed of 45 places in 229 ms of which 1 ms to minimize.
[2023-03-15 13:29:38] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 1 ms to minimize.
[2023-03-15 13:29:38] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 0 ms to minimize.
[2023-03-15 13:29:38] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 0 ms to minimize.
[2023-03-15 13:29:38] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 0 ms to minimize.
[2023-03-15 13:29:38] [INFO ] Deduced a trap composed of 35 places in 210 ms of which 1 ms to minimize.
[2023-03-15 13:29:38] [INFO ] Deduced a trap composed of 25 places in 189 ms of which 0 ms to minimize.
[2023-03-15 13:29:39] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
[2023-03-15 13:29:39] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 1 ms to minimize.
[2023-03-15 13:29:39] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 1 ms to minimize.
[2023-03-15 13:29:39] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3329 ms
[2023-03-15 13:29:39] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 0 ms to minimize.
[2023-03-15 13:29:39] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 0 ms to minimize.
[2023-03-15 13:29:39] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 1 ms to minimize.
[2023-03-15 13:29:39] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 0 ms to minimize.
[2023-03-15 13:29:40] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 0 ms to minimize.
[2023-03-15 13:29:40] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 1 ms to minimize.
[2023-03-15 13:29:40] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 0 ms to minimize.
[2023-03-15 13:29:40] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2023-03-15 13:29:40] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 1 ms to minimize.
[2023-03-15 13:29:40] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 1 ms to minimize.
[2023-03-15 13:29:41] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2023-03-15 13:29:41] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2023-03-15 13:29:41] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 0 ms to minimize.
[2023-03-15 13:29:41] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 1 ms to minimize.
[2023-03-15 13:29:41] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 1 ms to minimize.
[2023-03-15 13:29:41] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 1 ms to minimize.
[2023-03-15 13:29:41] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2023-03-15 13:29:41] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 0 ms to minimize.
[2023-03-15 13:29:42] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 0 ms to minimize.
[2023-03-15 13:29:42] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2023-03-15 13:29:42] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2717 ms
[2023-03-15 13:29:42] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2023-03-15 13:29:42] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 0 ms to minimize.
[2023-03-15 13:29:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2023-03-15 13:29:42] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 1 ms to minimize.
[2023-03-15 13:29:42] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 0 ms to minimize.
[2023-03-15 13:29:42] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2023-03-15 13:29:42] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2023-03-15 13:29:42] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2023-03-15 13:29:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 540 ms
[2023-03-15 13:29:43] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2023-03-15 13:29:43] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 0 ms to minimize.
[2023-03-15 13:29:43] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 0 ms to minimize.
[2023-03-15 13:29:43] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 1 ms to minimize.
[2023-03-15 13:29:43] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 0 ms to minimize.
[2023-03-15 13:29:43] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 0 ms to minimize.
[2023-03-15 13:29:44] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 0 ms to minimize.
[2023-03-15 13:29:44] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 0 ms to minimize.
[2023-03-15 13:29:44] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 0 ms to minimize.
[2023-03-15 13:29:44] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 0 ms to minimize.
[2023-03-15 13:29:44] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1453 ms
[2023-03-15 13:29:44] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 0 ms to minimize.
[2023-03-15 13:29:44] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 0 ms to minimize.
[2023-03-15 13:29:44] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2023-03-15 13:29:44] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 0 ms to minimize.
[2023-03-15 13:29:44] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 0 ms to minimize.
[2023-03-15 13:29:45] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 0 ms to minimize.
[2023-03-15 13:29:45] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
[2023-03-15 13:29:45] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2023-03-15 13:29:45] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 0 ms to minimize.
[2023-03-15 13:29:45] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 0 ms to minimize.
[2023-03-15 13:29:45] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2023-03-15 13:29:45] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 0 ms to minimize.
[2023-03-15 13:29:45] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2023-03-15 13:29:46] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2023-03-15 13:29:46] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2023-03-15 13:29:46] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1663 ms
[2023-03-15 13:29:46] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 0 ms to minimize.
[2023-03-15 13:29:46] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2023-03-15 13:29:46] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 0 ms to minimize.
[2023-03-15 13:29:46] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2023-03-15 13:29:46] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2023-03-15 13:29:46] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2023-03-15 13:29:47] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 0 ms to minimize.
[2023-03-15 13:29:47] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 0 ms to minimize.
[2023-03-15 13:29:47] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 974 ms
[2023-03-15 13:29:47] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 1 ms to minimize.
[2023-03-15 13:29:47] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 0 ms to minimize.
[2023-03-15 13:29:47] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 1 ms to minimize.
[2023-03-15 13:29:47] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 1 ms to minimize.
[2023-03-15 13:29:47] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 0 ms to minimize.
[2023-03-15 13:29:47] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 0 ms to minimize.
[2023-03-15 13:29:47] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2023-03-15 13:29:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 783 ms
[2023-03-15 13:29:48] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 1 ms to minimize.
[2023-03-15 13:29:48] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
[2023-03-15 13:29:48] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 0 ms to minimize.
[2023-03-15 13:29:48] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 0 ms to minimize.
[2023-03-15 13:29:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 448 ms
[2023-03-15 13:29:48] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 0 ms to minimize.
[2023-03-15 13:29:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-03-15 13:29:48] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 0 ms to minimize.
[2023-03-15 13:29:48] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 1 ms to minimize.
[2023-03-15 13:29:49] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 0 ms to minimize.
[2023-03-15 13:29:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 454 ms
[2023-03-15 13:29:49] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 0 ms to minimize.
[2023-03-15 13:29:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-15 13:29:49] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 0 ms to minimize.
[2023-03-15 13:29:49] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2023-03-15 13:29:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 292 ms
[2023-03-15 13:29:49] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 1 ms to minimize.
[2023-03-15 13:29:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2023-03-15 13:29:49] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 0 ms to minimize.
[2023-03-15 13:29:50] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 0 ms to minimize.
[2023-03-15 13:29:50] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 0 ms to minimize.
[2023-03-15 13:29:50] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 1 ms to minimize.
[2023-03-15 13:29:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 499 ms
[2023-03-15 13:29:50] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2023-03-15 13:29:50] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 0 ms to minimize.
[2023-03-15 13:29:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 200 ms
[2023-03-15 13:29:50] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 0 ms to minimize.
[2023-03-15 13:29:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-03-15 13:29:50] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 0 ms to minimize.
[2023-03-15 13:29:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2023-03-15 13:29:51] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 1 ms to minimize.
[2023-03-15 13:29:51] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 0 ms to minimize.
[2023-03-15 13:29:51] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 0 ms to minimize.
[2023-03-15 13:29:51] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 1 ms to minimize.
[2023-03-15 13:29:51] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 1 ms to minimize.
[2023-03-15 13:29:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 919 ms
[2023-03-15 13:29:52] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 1 ms to minimize.
[2023-03-15 13:29:52] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 0 ms to minimize.
[2023-03-15 13:29:52] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 0 ms to minimize.
[2023-03-15 13:29:52] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 1 ms to minimize.
[2023-03-15 13:29:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 811 ms
[2023-03-15 13:29:53] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 1 ms to minimize.
[2023-03-15 13:29:53] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 1 ms to minimize.
[2023-03-15 13:29:53] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 1 ms to minimize.
[2023-03-15 13:29:53] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 1 ms to minimize.
[2023-03-15 13:29:54] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 1 ms to minimize.
[2023-03-15 13:29:54] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 0 ms to minimize.
[2023-03-15 13:29:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1351 ms
[2023-03-15 13:29:54] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 0 ms to minimize.
[2023-03-15 13:29:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2023-03-15 13:29:54] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 0 ms to minimize.
[2023-03-15 13:29:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2023-03-15 13:29:55] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 1 ms to minimize.
[2023-03-15 13:29:55] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 1 ms to minimize.
[2023-03-15 13:29:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 389 ms
[2023-03-15 13:29:55] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 0 ms to minimize.
[2023-03-15 13:29:56] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 1 ms to minimize.
[2023-03-15 13:29:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 395 ms
[2023-03-15 13:29:56] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 1 ms to minimize.
[2023-03-15 13:29:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-15 13:29:56] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 0 ms to minimize.
[2023-03-15 13:29:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2023-03-15 13:29:56] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 1 ms to minimize.
[2023-03-15 13:29:57] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 1 ms to minimize.
[2023-03-15 13:29:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 395 ms
[2023-03-15 13:29:57] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 1 ms to minimize.
[2023-03-15 13:29:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2023-03-15 13:29:57] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 1 ms to minimize.
[2023-03-15 13:29:58] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 0 ms to minimize.
[2023-03-15 13:29:58] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 0 ms to minimize.
[2023-03-15 13:29:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 780 ms
[2023-03-15 13:29:58] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 1 ms to minimize.
[2023-03-15 13:29:58] [INFO ] Deduced a trap composed of 36 places in 227 ms of which 1 ms to minimize.
[2023-03-15 13:29:59] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 1 ms to minimize.
[2023-03-15 13:29:59] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 1 ms to minimize.
[2023-03-15 13:29:59] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 1 ms to minimize.
[2023-03-15 13:29:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1305 ms
[2023-03-15 13:29:59] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 0 ms to minimize.
[2023-03-15 13:30:00] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 0 ms to minimize.
[2023-03-15 13:30:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 340 ms
[2023-03-15 13:30:00] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 1 ms to minimize.
[2023-03-15 13:30:00] [INFO ] Deduced a trap composed of 38 places in 241 ms of which 1 ms to minimize.
[2023-03-15 13:30:01] [INFO ] Deduced a trap composed of 34 places in 221 ms of which 1 ms to minimize.
[2023-03-15 13:30:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 910 ms
[2023-03-15 13:30:01] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 0 ms to minimize.
[2023-03-15 13:30:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2023-03-15 13:30:02] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 0 ms to minimize.
[2023-03-15 13:30:02] [INFO ] Deduced a trap composed of 40 places in 195 ms of which 1 ms to minimize.
[2023-03-15 13:30:02] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 1 ms to minimize.
[2023-03-15 13:30:02] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 0 ms to minimize.
[2023-03-15 13:30:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 797 ms
[2023-03-15 13:30:03] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 1 ms to minimize.
[2023-03-15 13:30:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2023-03-15 13:30:03] [INFO ] Deduced a trap composed of 13 places in 253 ms of which 1 ms to minimize.
[2023-03-15 13:30:03] [INFO ] Deduced a trap composed of 16 places in 240 ms of which 1 ms to minimize.
[2023-03-15 13:30:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 589 ms
[2023-03-15 13:30:04] [INFO ] Deduced a trap composed of 19 places in 224 ms of which 1 ms to minimize.
[2023-03-15 13:30:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2023-03-15 13:30:04] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 1 ms to minimize.
[2023-03-15 13:30:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2023-03-15 13:30:05] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 0 ms to minimize.
[2023-03-15 13:30:05] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 1 ms to minimize.
[2023-03-15 13:30:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 409 ms
[2023-03-15 13:30:05] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 1 ms to minimize.
[2023-03-15 13:30:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2023-03-15 13:30:06] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 1 ms to minimize.
[2023-03-15 13:30:06] [INFO ] Deduced a trap composed of 25 places in 189 ms of which 1 ms to minimize.
[2023-03-15 13:30:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 457 ms
[2023-03-15 13:30:07] [INFO ] Deduced a trap composed of 33 places in 207 ms of which 0 ms to minimize.
[2023-03-15 13:30:07] [INFO ] Deduced a trap composed of 56 places in 172 ms of which 0 ms to minimize.
[2023-03-15 13:30:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 512 ms
[2023-03-15 13:30:07] [INFO ] Deduced a trap composed of 29 places in 206 ms of which 1 ms to minimize.
[2023-03-15 13:30:07] [INFO ] Deduced a trap composed of 29 places in 200 ms of which 1 ms to minimize.
[2023-03-15 13:30:08] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 1 ms to minimize.
[2023-03-15 13:30:08] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 1 ms to minimize.
[2023-03-15 13:30:08] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 1 ms to minimize.
[2023-03-15 13:30:08] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 1 ms to minimize.
[2023-03-15 13:30:08] [INFO ] Deduced a trap composed of 35 places in 232 ms of which 1 ms to minimize.
[2023-03-15 13:30:08] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1551 ms
[2023-03-15 13:30:09] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 1 ms to minimize.
[2023-03-15 13:30:09] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 1 ms to minimize.
[2023-03-15 13:30:10] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 1 ms to minimize.
[2023-03-15 13:30:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 731 ms
[2023-03-15 13:30:10] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 0 ms to minimize.
[2023-03-15 13:30:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2023-03-15 13:30:10] [INFO ] Deduced a trap composed of 33 places in 216 ms of which 1 ms to minimize.
[2023-03-15 13:30:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2023-03-15 13:30:11] [INFO ] Deduced a trap composed of 28 places in 196 ms of which 1 ms to minimize.
[2023-03-15 13:30:11] [INFO ] Deduced a trap composed of 40 places in 198 ms of which 1 ms to minimize.
[2023-03-15 13:30:11] [INFO ] Deduced a trap composed of 28 places in 192 ms of which 1 ms to minimize.
[2023-03-15 13:30:11] [INFO ] Deduced a trap composed of 40 places in 192 ms of which 1 ms to minimize.
[2023-03-15 13:30:12] [INFO ] Deduced a trap composed of 28 places in 191 ms of which 0 ms to minimize.
[2023-03-15 13:30:12] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 0 ms to minimize.
[2023-03-15 13:30:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1395 ms
[2023-03-15 13:30:12] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 1 ms to minimize.
[2023-03-15 13:30:12] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 0 ms to minimize.
[2023-03-15 13:30:13] [INFO ] Deduced a trap composed of 42 places in 192 ms of which 1 ms to minimize.
[2023-03-15 13:30:13] [INFO ] Deduced a trap composed of 42 places in 184 ms of which 0 ms to minimize.
[2023-03-15 13:30:13] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 1 ms to minimize.
[2023-03-15 13:30:13] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 1 ms to minimize.
[2023-03-15 13:30:13] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 1 ms to minimize.
[2023-03-15 13:30:14] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 1 ms to minimize.
[2023-03-15 13:30:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1968 ms
[2023-03-15 13:30:14] [INFO ] After 38741ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :86
Attempting to minimize the solution found.
Minimization took 4189 ms.
[2023-03-15 13:30:18] [INFO ] After 43397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :86
Interrupted random walk after 827541 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=27 ) properties 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 86889 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 184 properties.
[2023-03-15 13:32:18] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:32:18] [INFO ] Invariant cache hit.
[2023-03-15 13:32:20] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 13:32:27] [INFO ] After 5811ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7 real:177
[2023-03-15 13:32:27] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:32:28] [INFO ] After 309ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:184
[2023-03-15 13:32:28] [INFO ] After 9603ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:184
[2023-03-15 13:32:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 13:32:36] [INFO ] After 5434ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :184
[2023-03-15 13:32:42] [INFO ] After 5936ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :184
[2023-03-15 13:32:42] [INFO ] Deduced a trap composed of 17 places in 251 ms of which 1 ms to minimize.
[2023-03-15 13:32:43] [INFO ] Deduced a trap composed of 9 places in 230 ms of which 1 ms to minimize.
[2023-03-15 13:32:43] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 0 ms to minimize.
[2023-03-15 13:32:43] [INFO ] Deduced a trap composed of 43 places in 233 ms of which 0 ms to minimize.
[2023-03-15 13:32:43] [INFO ] Deduced a trap composed of 50 places in 209 ms of which 1 ms to minimize.
[2023-03-15 13:32:44] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 1 ms to minimize.
[2023-03-15 13:32:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1591 ms
[2023-03-15 13:32:44] [INFO ] Deduced a trap composed of 27 places in 230 ms of which 1 ms to minimize.
[2023-03-15 13:32:45] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 1 ms to minimize.
[2023-03-15 13:32:45] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 1 ms to minimize.
[2023-03-15 13:32:45] [INFO ] Deduced a trap composed of 24 places in 204 ms of which 0 ms to minimize.
[2023-03-15 13:32:45] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 1 ms to minimize.
[2023-03-15 13:32:45] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 1 ms to minimize.
[2023-03-15 13:32:46] [INFO ] Deduced a trap composed of 18 places in 199 ms of which 0 ms to minimize.
[2023-03-15 13:32:46] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 0 ms to minimize.
[2023-03-15 13:32:46] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 1 ms to minimize.
[2023-03-15 13:32:46] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 1 ms to minimize.
[2023-03-15 13:32:47] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 0 ms to minimize.
[2023-03-15 13:32:47] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2550 ms
[2023-03-15 13:32:47] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 1 ms to minimize.
[2023-03-15 13:32:47] [INFO ] Deduced a trap composed of 55 places in 172 ms of which 0 ms to minimize.
[2023-03-15 13:32:47] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 1 ms to minimize.
[2023-03-15 13:32:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 653 ms
[2023-03-15 13:32:47] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 1 ms to minimize.
[2023-03-15 13:32:48] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 1 ms to minimize.
[2023-03-15 13:32:48] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 1 ms to minimize.
[2023-03-15 13:32:48] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 1 ms to minimize.
[2023-03-15 13:32:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 882 ms
[2023-03-15 13:32:48] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 0 ms to minimize.
[2023-03-15 13:32:49] [INFO ] Deduced a trap composed of 20 places in 196 ms of which 1 ms to minimize.
[2023-03-15 13:32:49] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 1 ms to minimize.
[2023-03-15 13:32:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 684 ms
[2023-03-15 13:32:49] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 1 ms to minimize.
[2023-03-15 13:32:49] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 1 ms to minimize.
[2023-03-15 13:32:49] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 0 ms to minimize.
[2023-03-15 13:32:50] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 1 ms to minimize.
[2023-03-15 13:32:50] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 1 ms to minimize.
[2023-03-15 13:32:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 938 ms
[2023-03-15 13:32:50] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 1 ms to minimize.
[2023-03-15 13:32:50] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 0 ms to minimize.
[2023-03-15 13:32:50] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 1 ms to minimize.
[2023-03-15 13:32:51] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 0 ms to minimize.
[2023-03-15 13:32:51] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 1 ms to minimize.
[2023-03-15 13:32:51] [INFO ] Deduced a trap composed of 27 places in 217 ms of which 1 ms to minimize.
[2023-03-15 13:32:51] [INFO ] Deduced a trap composed of 27 places in 210 ms of which 1 ms to minimize.
[2023-03-15 13:32:52] [INFO ] Deduced a trap composed of 58 places in 222 ms of which 1 ms to minimize.
[2023-03-15 13:32:52] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 1 ms to minimize.
[2023-03-15 13:32:52] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 1 ms to minimize.
[2023-03-15 13:32:52] [INFO ] Deduced a trap composed of 52 places in 195 ms of which 1 ms to minimize.
[2023-03-15 13:32:53] [INFO ] Deduced a trap composed of 28 places in 202 ms of which 1 ms to minimize.
[2023-03-15 13:32:53] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 1 ms to minimize.
[2023-03-15 13:32:53] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 1 ms to minimize.
[2023-03-15 13:32:53] [INFO ] Deduced a trap composed of 43 places in 217 ms of which 0 ms to minimize.
[2023-03-15 13:32:54] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 0 ms to minimize.
[2023-03-15 13:32:54] [INFO ] Deduced a trap composed of 18 places in 209 ms of which 0 ms to minimize.
[2023-03-15 13:32:54] [INFO ] Deduced a trap composed of 51 places in 170 ms of which 1 ms to minimize.
[2023-03-15 13:32:54] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 1 ms to minimize.
[2023-03-15 13:32:54] [INFO ] Deduced a trap composed of 34 places in 192 ms of which 1 ms to minimize.
[2023-03-15 13:32:55] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 1 ms to minimize.
[2023-03-15 13:32:55] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 1 ms to minimize.
[2023-03-15 13:32:55] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 1 ms to minimize.
[2023-03-15 13:32:55] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 0 ms to minimize.
[2023-03-15 13:32:55] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5396 ms
[2023-03-15 13:32:56] [INFO ] Deduced a trap composed of 19 places in 258 ms of which 0 ms to minimize.
[2023-03-15 13:32:56] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 1 ms to minimize.
[2023-03-15 13:32:56] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 0 ms to minimize.
[2023-03-15 13:32:56] [INFO ] Deduced a trap composed of 40 places in 214 ms of which 1 ms to minimize.
[2023-03-15 13:32:57] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 1 ms to minimize.
[2023-03-15 13:32:57] [INFO ] Deduced a trap composed of 9 places in 228 ms of which 1 ms to minimize.
[2023-03-15 13:32:57] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 1 ms to minimize.
[2023-03-15 13:32:57] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 1 ms to minimize.
[2023-03-15 13:32:57] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1962 ms
[2023-03-15 13:32:58] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 1 ms to minimize.
[2023-03-15 13:32:58] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 1 ms to minimize.
[2023-03-15 13:32:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 487 ms
[2023-03-15 13:32:58] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 1 ms to minimize.
[2023-03-15 13:32:58] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 1 ms to minimize.
[2023-03-15 13:32:59] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 1 ms to minimize.
[2023-03-15 13:32:59] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 1 ms to minimize.
[2023-03-15 13:32:59] [INFO ] Deduced a trap composed of 27 places in 258 ms of which 1 ms to minimize.
[2023-03-15 13:32:59] [INFO ] Deduced a trap composed of 41 places in 249 ms of which 0 ms to minimize.
[2023-03-15 13:32:59] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 1 ms to minimize.
[2023-03-15 13:33:00] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 0 ms to minimize.
[2023-03-15 13:33:00] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 1 ms to minimize.
[2023-03-15 13:33:00] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 1 ms to minimize.
[2023-03-15 13:33:00] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2189 ms
[2023-03-15 13:33:00] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 0 ms to minimize.
[2023-03-15 13:33:01] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 1 ms to minimize.
[2023-03-15 13:33:01] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 1 ms to minimize.
[2023-03-15 13:33:01] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 1 ms to minimize.
[2023-03-15 13:33:01] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 1 ms to minimize.
[2023-03-15 13:33:01] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 0 ms to minimize.
[2023-03-15 13:33:02] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 0 ms to minimize.
[2023-03-15 13:33:02] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 1 ms to minimize.
[2023-03-15 13:33:02] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 1 ms to minimize.
[2023-03-15 13:33:02] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 1 ms to minimize.
[2023-03-15 13:33:02] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 0 ms to minimize.
[2023-03-15 13:33:03] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 0 ms to minimize.
[2023-03-15 13:33:03] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2421 ms
[2023-03-15 13:33:03] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2023-03-15 13:33:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-15 13:33:03] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 1 ms to minimize.
[2023-03-15 13:33:03] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 0 ms to minimize.
[2023-03-15 13:33:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 377 ms
[2023-03-15 13:33:04] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 1 ms to minimize.
[2023-03-15 13:33:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2023-03-15 13:33:04] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 1 ms to minimize.
[2023-03-15 13:33:04] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 1 ms to minimize.
[2023-03-15 13:33:04] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 1 ms to minimize.
[2023-03-15 13:33:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 474 ms
[2023-03-15 13:33:04] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 0 ms to minimize.
[2023-03-15 13:33:04] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 0 ms to minimize.
[2023-03-15 13:33:05] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 1 ms to minimize.
[2023-03-15 13:33:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 441 ms
[2023-03-15 13:33:05] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 1 ms to minimize.
[2023-03-15 13:33:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2023-03-15 13:33:05] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 1 ms to minimize.
[2023-03-15 13:33:05] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 0 ms to minimize.
[2023-03-15 13:33:05] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 1 ms to minimize.
[2023-03-15 13:33:06] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 0 ms to minimize.
[2023-03-15 13:33:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 688 ms
[2023-03-15 13:33:06] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 0 ms to minimize.
[2023-03-15 13:33:06] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 1 ms to minimize.
[2023-03-15 13:33:07] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 1 ms to minimize.
[2023-03-15 13:33:07] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 0 ms to minimize.
[2023-03-15 13:33:07] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 0 ms to minimize.
[2023-03-15 13:33:07] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 0 ms to minimize.
[2023-03-15 13:33:07] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 1 ms to minimize.
[2023-03-15 13:33:08] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 1 ms to minimize.
[2023-03-15 13:33:08] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 0 ms to minimize.
[2023-03-15 13:33:08] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 1 ms to minimize.
[2023-03-15 13:33:08] [INFO ] Deduced a trap composed of 30 places in 183 ms of which 1 ms to minimize.
[2023-03-15 13:33:09] [INFO ] Deduced a trap composed of 30 places in 175 ms of which 0 ms to minimize.
[2023-03-15 13:33:09] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 0 ms to minimize.
[2023-03-15 13:33:09] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2763 ms
[2023-03-15 13:33:09] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 0 ms to minimize.
[2023-03-15 13:33:09] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 1 ms to minimize.
[2023-03-15 13:33:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 384 ms
[2023-03-15 13:33:10] [INFO ] Deduced a trap composed of 36 places in 240 ms of which 1 ms to minimize.
[2023-03-15 13:33:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
[2023-03-15 13:33:10] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 0 ms to minimize.
[2023-03-15 13:33:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-03-15 13:33:11] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 1 ms to minimize.
[2023-03-15 13:33:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2023-03-15 13:33:11] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 1 ms to minimize.
[2023-03-15 13:33:11] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 1 ms to minimize.
[2023-03-15 13:33:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 439 ms
[2023-03-15 13:33:11] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 1 ms to minimize.
[2023-03-15 13:33:12] [INFO ] Deduced a trap composed of 27 places in 246 ms of which 1 ms to minimize.
[2023-03-15 13:33:12] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 0 ms to minimize.
[2023-03-15 13:33:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 895 ms
[2023-03-15 13:33:12] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 0 ms to minimize.
[2023-03-15 13:33:13] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 0 ms to minimize.
[2023-03-15 13:33:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 480 ms
[2023-03-15 13:33:13] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 1 ms to minimize.
[2023-03-15 13:33:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 312 ms
[2023-03-15 13:33:13] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 0 ms to minimize.
[2023-03-15 13:33:14] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 1 ms to minimize.
[2023-03-15 13:33:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 408 ms
[2023-03-15 13:33:14] [INFO ] Deduced a trap composed of 43 places in 196 ms of which 1 ms to minimize.
[2023-03-15 13:33:14] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 1 ms to minimize.
[2023-03-15 13:33:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 497 ms
[2023-03-15 13:33:14] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 0 ms to minimize.
[2023-03-15 13:33:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2023-03-15 13:33:15] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 3 ms to minimize.
[2023-03-15 13:33:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2023-03-15 13:33:15] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 0 ms to minimize.
[2023-03-15 13:33:15] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 0 ms to minimize.
[2023-03-15 13:33:15] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 1 ms to minimize.
[2023-03-15 13:33:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 730 ms
[2023-03-15 13:33:16] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 0 ms to minimize.
[2023-03-15 13:33:16] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 13 ms to minimize.
[2023-03-15 13:33:16] [INFO ] Deduced a trap composed of 9 places in 265 ms of which 0 ms to minimize.
[2023-03-15 13:33:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 904 ms
[2023-03-15 13:33:17] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 0 ms to minimize.
[2023-03-15 13:33:17] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 1 ms to minimize.
[2023-03-15 13:33:17] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 0 ms to minimize.
[2023-03-15 13:33:17] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 1 ms to minimize.
[2023-03-15 13:33:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 706 ms
[2023-03-15 13:33:17] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2023-03-15 13:33:18] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 0 ms to minimize.
[2023-03-15 13:33:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 322 ms
[2023-03-15 13:33:18] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 0 ms to minimize.
[2023-03-15 13:33:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2023-03-15 13:33:19] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2023-03-15 13:33:19] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 1 ms to minimize.
[2023-03-15 13:33:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 380 ms
[2023-03-15 13:33:19] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 1 ms to minimize.
[2023-03-15 13:33:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-03-15 13:33:20] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 0 ms to minimize.
[2023-03-15 13:33:20] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 1 ms to minimize.
[2023-03-15 13:33:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 425 ms
[2023-03-15 13:33:21] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 1 ms to minimize.
[2023-03-15 13:33:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2023-03-15 13:33:21] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 0 ms to minimize.
[2023-03-15 13:33:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-15 13:33:22] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 0 ms to minimize.
[2023-03-15 13:33:22] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 0 ms to minimize.
[2023-03-15 13:33:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 455 ms
[2023-03-15 13:33:23] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 1 ms to minimize.
[2023-03-15 13:33:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-03-15 13:33:23] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 0 ms to minimize.
[2023-03-15 13:33:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2023-03-15 13:33:24] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 0 ms to minimize.
[2023-03-15 13:33:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-03-15 13:33:25] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 1 ms to minimize.
[2023-03-15 13:33:25] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 1 ms to minimize.
[2023-03-15 13:33:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 370 ms
[2023-03-15 13:33:26] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 1 ms to minimize.
[2023-03-15 13:33:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2023-03-15 13:33:27] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 1 ms to minimize.
[2023-03-15 13:33:27] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 1 ms to minimize.
[2023-03-15 13:33:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 553 ms
[2023-03-15 13:33:28] [INFO ] Deduced a trap composed of 29 places in 207 ms of which 1 ms to minimize.
[2023-03-15 13:33:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2023-03-15 13:33:29] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2023-03-15 13:33:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2023-03-15 13:33:31] [INFO ] Deduced a trap composed of 20 places in 170 ms of which 1 ms to minimize.
[2023-03-15 13:33:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-03-15 13:33:31] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 1 ms to minimize.
[2023-03-15 13:33:32] [INFO ] Deduced a trap composed of 33 places in 202 ms of which 0 ms to minimize.
[2023-03-15 13:33:32] [INFO ] Deduced a trap composed of 54 places in 165 ms of which 1 ms to minimize.
[2023-03-15 13:33:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 755 ms
[2023-03-15 13:33:32] [INFO ] Deduced a trap composed of 49 places in 177 ms of which 1 ms to minimize.
[2023-03-15 13:33:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2023-03-15 13:33:33] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 0 ms to minimize.
[2023-03-15 13:33:33] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 1 ms to minimize.
[2023-03-15 13:33:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 344 ms
[2023-03-15 13:33:33] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 0 ms to minimize.
[2023-03-15 13:33:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2023-03-15 13:33:34] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 1 ms to minimize.
[2023-03-15 13:33:34] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 1 ms to minimize.
[2023-03-15 13:33:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 431 ms
[2023-03-15 13:33:35] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 1 ms to minimize.
[2023-03-15 13:33:35] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 1 ms to minimize.
[2023-03-15 13:33:35] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 1 ms to minimize.
[2023-03-15 13:33:35] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 0 ms to minimize.
[2023-03-15 13:33:35] [INFO ] Deduced a trap composed of 42 places in 187 ms of which 1 ms to minimize.
[2023-03-15 13:33:36] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 1 ms to minimize.
[2023-03-15 13:33:36] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 0 ms to minimize.
[2023-03-15 13:33:36] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 1 ms to minimize.
[2023-03-15 13:33:36] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 1 ms to minimize.
[2023-03-15 13:33:37] [INFO ] Deduced a trap composed of 42 places in 193 ms of which 1 ms to minimize.
[2023-03-15 13:33:37] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 0 ms to minimize.
[2023-03-15 13:33:37] [INFO ] Deduced a trap composed of 58 places in 164 ms of which 1 ms to minimize.
[2023-03-15 13:33:37] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 0 ms to minimize.
[2023-03-15 13:33:38] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3374 ms
[2023-03-15 13:33:38] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 1 ms to minimize.
[2023-03-15 13:33:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2023-03-15 13:33:40] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 1 ms to minimize.
[2023-03-15 13:33:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2023-03-15 13:33:40] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 1 ms to minimize.
[2023-03-15 13:33:41] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 1 ms to minimize.
[2023-03-15 13:33:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 506 ms
[2023-03-15 13:33:41] [INFO ] Deduced a trap composed of 35 places in 232 ms of which 0 ms to minimize.
[2023-03-15 13:33:41] [INFO ] Deduced a trap composed of 38 places in 229 ms of which 1 ms to minimize.
[2023-03-15 13:33:42] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 0 ms to minimize.
[2023-03-15 13:33:42] [INFO ] Deduced a trap composed of 50 places in 162 ms of which 1 ms to minimize.
[2023-03-15 13:33:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1012 ms
[2023-03-15 13:33:42] [INFO ] Deduced a trap composed of 64 places in 138 ms of which 1 ms to minimize.
[2023-03-15 13:33:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2023-03-15 13:33:43] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 1 ms to minimize.
[2023-03-15 13:33:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2023-03-15 13:33:44] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 0 ms to minimize.
[2023-03-15 13:33:44] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 1 ms to minimize.
[2023-03-15 13:33:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 357 ms
[2023-03-15 13:33:44] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 1 ms to minimize.
[2023-03-15 13:33:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2023-03-15 13:33:44] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 1 ms to minimize.
[2023-03-15 13:33:45] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 0 ms to minimize.
[2023-03-15 13:33:45] [INFO ] Deduced a trap composed of 40 places in 209 ms of which 1 ms to minimize.
[2023-03-15 13:33:45] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 1 ms to minimize.
[2023-03-15 13:33:45] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 1 ms to minimize.
[2023-03-15 13:33:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1274 ms
[2023-03-15 13:33:47] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 1 ms to minimize.
[2023-03-15 13:33:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2023-03-15 13:33:47] [INFO ] After 71259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :184
Attempting to minimize the solution found.
Minimization took 15685 ms.
[2023-03-15 13:34:03] [INFO ] After 95666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :184
Fused 184 Parikh solutions to 181 different solutions.
Parikh walk visited 0 properties in 2284 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 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 13:34:05] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:34:05] [INFO ] Invariant cache hit.
[2023-03-15 13:34:06] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-15 13:34:06] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:34:06] [INFO ] Invariant cache hit.
[2023-03-15 13:34:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:34:06] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
[2023-03-15 13:34:06] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-15 13:34:06] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:34:06] [INFO ] Invariant cache hit.
[2023-03-15 13:34:07] [INFO ] Dead Transitions using invariants and state equation in 690 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1469 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 3043 ms. (steps per millisecond=32 ) properties (out of 153) seen :67
Running SMT prover for 86 properties.
[2023-03-15 13:34:10] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:34:10] [INFO ] Invariant cache hit.
[2023-03-15 13:34:10] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:34:10] [INFO ] After 267ms SMT Verify possible using state equation in real domain returned unsat :0 sat :86
[2023-03-15 13:34:10] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:34:11] [INFO ] After 427ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :86
[2023-03-15 13:34:11] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 1 ms to minimize.
[2023-03-15 13:34:11] [INFO ] Deduced a trap composed of 11 places in 272 ms of which 1 ms to minimize.
[2023-03-15 13:34:12] [INFO ] Deduced a trap composed of 39 places in 251 ms of which 1 ms to minimize.
[2023-03-15 13:34:12] [INFO ] Deduced a trap composed of 31 places in 246 ms of which 1 ms to minimize.
[2023-03-15 13:34:12] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 0 ms to minimize.
[2023-03-15 13:34:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1342 ms
[2023-03-15 13:34:13] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 1 ms to minimize.
[2023-03-15 13:34:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2023-03-15 13:34:13] [INFO ] Deduced a trap composed of 63 places in 128 ms of which 0 ms to minimize.
[2023-03-15 13:34:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-15 13:34:13] [INFO ] Deduced a trap composed of 63 places in 128 ms of which 1 ms to minimize.
[2023-03-15 13:34:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-15 13:34:14] [INFO ] Deduced a trap composed of 34 places in 219 ms of which 0 ms to minimize.
[2023-03-15 13:34:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2023-03-15 13:34:15] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 1 ms to minimize.
[2023-03-15 13:34:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2023-03-15 13:34:15] [INFO ] Deduced a trap composed of 56 places in 168 ms of which 1 ms to minimize.
[2023-03-15 13:34:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-03-15 13:34:16] [INFO ] Deduced a trap composed of 56 places in 143 ms of which 1 ms to minimize.
[2023-03-15 13:34:16] [INFO ] Deduced a trap composed of 64 places in 208 ms of which 1 ms to minimize.
[2023-03-15 13:34:17] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 0 ms to minimize.
[2023-03-15 13:34:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 685 ms
[2023-03-15 13:34:17] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 1 ms to minimize.
[2023-03-15 13:34:17] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 0 ms to minimize.
[2023-03-15 13:34:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 406 ms
[2023-03-15 13:34:17] [INFO ] Deduced a trap composed of 49 places in 178 ms of which 1 ms to minimize.
[2023-03-15 13:34:17] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 1 ms to minimize.
[2023-03-15 13:34:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 410 ms
[2023-03-15 13:34:18] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 0 ms to minimize.
[2023-03-15 13:34:18] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 0 ms to minimize.
[2023-03-15 13:34:18] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 0 ms to minimize.
[2023-03-15 13:34:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 396 ms
[2023-03-15 13:34:18] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 1 ms to minimize.
[2023-03-15 13:34:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2023-03-15 13:34:19] [INFO ] Deduced a trap composed of 60 places in 147 ms of which 0 ms to minimize.
[2023-03-15 13:34:19] [INFO ] Deduced a trap composed of 58 places in 146 ms of which 1 ms to minimize.
[2023-03-15 13:34:19] [INFO ] Deduced a trap composed of 53 places in 149 ms of which 1 ms to minimize.
[2023-03-15 13:34:19] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 0 ms to minimize.
[2023-03-15 13:34:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 734 ms
[2023-03-15 13:34:20] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 0 ms to minimize.
[2023-03-15 13:34:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2023-03-15 13:34:20] [INFO ] Deduced a trap composed of 57 places in 230 ms of which 1 ms to minimize.
[2023-03-15 13:34:20] [INFO ] Deduced a trap composed of 66 places in 216 ms of which 0 ms to minimize.
[2023-03-15 13:34:21] [INFO ] Deduced a trap composed of 79 places in 224 ms of which 1 ms to minimize.
[2023-03-15 13:34:21] [INFO ] Deduced a trap composed of 62 places in 227 ms of which 1 ms to minimize.
[2023-03-15 13:34:21] [INFO ] Deduced a trap composed of 46 places in 226 ms of which 0 ms to minimize.
[2023-03-15 13:34:21] [INFO ] Deduced a trap composed of 57 places in 233 ms of which 0 ms to minimize.
[2023-03-15 13:34:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1639 ms
[2023-03-15 13:34:22] [INFO ] Deduced a trap composed of 95 places in 216 ms of which 1 ms to minimize.
[2023-03-15 13:34:22] [INFO ] Deduced a trap composed of 80 places in 250 ms of which 1 ms to minimize.
[2023-03-15 13:34:22] [INFO ] Deduced a trap composed of 64 places in 238 ms of which 1 ms to minimize.
[2023-03-15 13:34:23] [INFO ] Deduced a trap composed of 70 places in 232 ms of which 1 ms to minimize.
[2023-03-15 13:34:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1144 ms
[2023-03-15 13:34:23] [INFO ] Deduced a trap composed of 53 places in 160 ms of which 1 ms to minimize.
[2023-03-15 13:34:23] [INFO ] Deduced a trap composed of 55 places in 199 ms of which 1 ms to minimize.
[2023-03-15 13:34:23] [INFO ] Deduced a trap composed of 75 places in 190 ms of which 1 ms to minimize.
[2023-03-15 13:34:24] [INFO ] Deduced a trap composed of 55 places in 209 ms of which 1 ms to minimize.
[2023-03-15 13:34:24] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 1 ms to minimize.
[2023-03-15 13:34:24] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 1 ms to minimize.
[2023-03-15 13:34:24] [INFO ] Deduced a trap composed of 51 places in 196 ms of which 0 ms to minimize.
[2023-03-15 13:34:25] [INFO ] Deduced a trap composed of 51 places in 188 ms of which 1 ms to minimize.
[2023-03-15 13:34:25] [INFO ] Deduced a trap composed of 53 places in 186 ms of which 1 ms to minimize.
[2023-03-15 13:34:25] [INFO ] Deduced a trap composed of 63 places in 181 ms of which 1 ms to minimize.
[2023-03-15 13:34:25] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 1 ms to minimize.
[2023-03-15 13:34:26] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 0 ms to minimize.
[2023-03-15 13:34:26] [INFO ] Deduced a trap composed of 91 places in 173 ms of which 1 ms to minimize.
[2023-03-15 13:34:26] [INFO ] Deduced a trap composed of 79 places in 169 ms of which 0 ms to minimize.
[2023-03-15 13:34:26] [INFO ] Deduced a trap composed of 56 places in 184 ms of which 0 ms to minimize.
[2023-03-15 13:34:26] [INFO ] Deduced a trap composed of 49 places in 179 ms of which 1 ms to minimize.
[2023-03-15 13:34:27] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 0 ms to minimize.
[2023-03-15 13:34:27] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 0 ms to minimize.
[2023-03-15 13:34:27] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 0 ms to minimize.
[2023-03-15 13:34:27] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4203 ms
[2023-03-15 13:34:27] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 0 ms to minimize.
[2023-03-15 13:34:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-15 13:34:28] [INFO ] Deduced a trap composed of 59 places in 170 ms of which 1 ms to minimize.
[2023-03-15 13:34:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2023-03-15 13:34:28] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 0 ms to minimize.
[2023-03-15 13:34:28] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 1 ms to minimize.
[2023-03-15 13:34:28] [INFO ] Deduced a trap composed of 54 places in 123 ms of which 1 ms to minimize.
[2023-03-15 13:34:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 529 ms
[2023-03-15 13:34:29] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 1 ms to minimize.
[2023-03-15 13:34:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2023-03-15 13:34:30] [INFO ] After 19356ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:86
[2023-03-15 13:34:30] [INFO ] After 19769ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:86
[2023-03-15 13:34:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2023-03-15 13:34:31] [INFO ] After 447ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :86
[2023-03-15 13:34:31] [INFO ] After 467ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :86
[2023-03-15 13:34:31] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 1 ms to minimize.
[2023-03-15 13:34:31] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 0 ms to minimize.
[2023-03-15 13:34:31] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2023-03-15 13:34:32] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 1 ms to minimize.
[2023-03-15 13:34:32] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 1 ms to minimize.
[2023-03-15 13:34:32] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 1 ms to minimize.
[2023-03-15 13:34:32] [INFO ] Deduced a trap composed of 37 places in 229 ms of which 1 ms to minimize.
[2023-03-15 13:34:32] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 0 ms to minimize.
[2023-03-15 13:34:33] [INFO ] Deduced a trap composed of 11 places in 235 ms of which 0 ms to minimize.
[2023-03-15 13:34:33] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1819 ms
[2023-03-15 13:34:33] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 1 ms to minimize.
[2023-03-15 13:34:33] [INFO ] Deduced a trap composed of 10 places in 228 ms of which 1 ms to minimize.
[2023-03-15 13:34:34] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 1 ms to minimize.
[2023-03-15 13:34:34] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 1 ms to minimize.
[2023-03-15 13:34:34] [INFO ] Deduced a trap composed of 52 places in 218 ms of which 1 ms to minimize.
[2023-03-15 13:34:34] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 0 ms to minimize.
[2023-03-15 13:34:35] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 1 ms to minimize.
[2023-03-15 13:34:35] [INFO ] Deduced a trap composed of 48 places in 210 ms of which 1 ms to minimize.
[2023-03-15 13:34:35] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 1 ms to minimize.
[2023-03-15 13:34:35] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 1 ms to minimize.
[2023-03-15 13:34:35] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2471 ms
[2023-03-15 13:34:36] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 0 ms to minimize.
[2023-03-15 13:34:36] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 1 ms to minimize.
[2023-03-15 13:34:36] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 1 ms to minimize.
[2023-03-15 13:34:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 670 ms
[2023-03-15 13:34:36] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 1 ms to minimize.
[2023-03-15 13:34:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2023-03-15 13:34:37] [INFO ] Deduced a trap composed of 12 places in 237 ms of which 0 ms to minimize.
[2023-03-15 13:34:37] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 1 ms to minimize.
[2023-03-15 13:34:37] [INFO ] Deduced a trap composed of 26 places in 234 ms of which 1 ms to minimize.
[2023-03-15 13:34:37] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 0 ms to minimize.
[2023-03-15 13:34:38] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 1 ms to minimize.
[2023-03-15 13:34:38] [INFO ] Deduced a trap composed of 13 places in 242 ms of which 1 ms to minimize.
[2023-03-15 13:34:38] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 1 ms to minimize.
[2023-03-15 13:34:38] [INFO ] Deduced a trap composed of 55 places in 204 ms of which 1 ms to minimize.
[2023-03-15 13:34:39] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 1 ms to minimize.
[2023-03-15 13:34:39] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 1 ms to minimize.
[2023-03-15 13:34:39] [INFO ] Deduced a trap composed of 55 places in 207 ms of which 1 ms to minimize.
[2023-03-15 13:34:39] [INFO ] Deduced a trap composed of 53 places in 217 ms of which 0 ms to minimize.
[2023-03-15 13:34:40] [INFO ] Deduced a trap composed of 51 places in 215 ms of which 1 ms to minimize.
[2023-03-15 13:34:40] [INFO ] Deduced a trap composed of 26 places in 209 ms of which 1 ms to minimize.
[2023-03-15 13:34:40] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 1 ms to minimize.
[2023-03-15 13:34:40] [INFO ] Deduced a trap composed of 54 places in 206 ms of which 0 ms to minimize.
[2023-03-15 13:34:41] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 1 ms to minimize.
[2023-03-15 13:34:41] [INFO ] Deduced a trap composed of 52 places in 211 ms of which 1 ms to minimize.
[2023-03-15 13:34:41] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 1 ms to minimize.
[2023-03-15 13:34:41] [INFO ] Deduced a trap composed of 19 places in 231 ms of which 1 ms to minimize.
[2023-03-15 13:34:42] [INFO ] Deduced a trap composed of 55 places in 212 ms of which 1 ms to minimize.
[2023-03-15 13:34:42] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 1 ms to minimize.
[2023-03-15 13:34:42] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 1 ms to minimize.
[2023-03-15 13:34:42] [INFO ] Deduced a trap composed of 65 places in 166 ms of which 0 ms to minimize.
[2023-03-15 13:34:42] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 1 ms to minimize.
[2023-03-15 13:34:43] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 0 ms to minimize.
[2023-03-15 13:34:43] [INFO ] Deduced a trap composed of 33 places in 193 ms of which 1 ms to minimize.
[2023-03-15 13:34:43] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 1 ms to minimize.
[2023-03-15 13:34:43] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 0 ms to minimize.
[2023-03-15 13:34:44] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 1 ms to minimize.
[2023-03-15 13:34:44] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 1 ms to minimize.
[2023-03-15 13:34:44] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 7466 ms
[2023-03-15 13:34:44] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 0 ms to minimize.
[2023-03-15 13:34:44] [INFO ] Deduced a trap composed of 20 places in 213 ms of which 0 ms to minimize.
[2023-03-15 13:34:45] [INFO ] Deduced a trap composed of 38 places in 273 ms of which 1 ms to minimize.
[2023-03-15 13:34:45] [INFO ] Deduced a trap composed of 20 places in 268 ms of which 1 ms to minimize.
[2023-03-15 13:34:45] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 0 ms to minimize.
[2023-03-15 13:34:45] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 0 ms to minimize.
[2023-03-15 13:34:45] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 0 ms to minimize.
[2023-03-15 13:34:46] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 1 ms to minimize.
[2023-03-15 13:34:46] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 0 ms to minimize.
[2023-03-15 13:34:46] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 1 ms to minimize.
[2023-03-15 13:34:46] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 0 ms to minimize.
[2023-03-15 13:34:46] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 1 ms to minimize.
[2023-03-15 13:34:46] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 0 ms to minimize.
[2023-03-15 13:34:47] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 1 ms to minimize.
[2023-03-15 13:34:47] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 1 ms to minimize.
[2023-03-15 13:34:47] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 1 ms to minimize.
[2023-03-15 13:34:47] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3234 ms
[2023-03-15 13:34:47] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 1 ms to minimize.
[2023-03-15 13:34:48] [INFO ] Deduced a trap composed of 34 places in 196 ms of which 1 ms to minimize.
[2023-03-15 13:34:48] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 1 ms to minimize.
[2023-03-15 13:34:48] [INFO ] Deduced a trap composed of 34 places in 192 ms of which 1 ms to minimize.
[2023-03-15 13:34:48] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 0 ms to minimize.
[2023-03-15 13:34:49] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 1 ms to minimize.
[2023-03-15 13:34:49] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 1 ms to minimize.
[2023-03-15 13:34:49] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 0 ms to minimize.
[2023-03-15 13:34:49] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 1 ms to minimize.
[2023-03-15 13:34:50] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 1 ms to minimize.
[2023-03-15 13:34:50] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 1 ms to minimize.
[2023-03-15 13:34:50] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 1 ms to minimize.
[2023-03-15 13:34:50] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 0 ms to minimize.
[2023-03-15 13:34:50] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 1 ms to minimize.
[2023-03-15 13:34:50] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 1 ms to minimize.
[2023-03-15 13:34:51] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 1 ms to minimize.
[2023-03-15 13:34:51] [INFO ] Deduced a trap composed of 52 places in 174 ms of which 1 ms to minimize.
[2023-03-15 13:34:51] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 1 ms to minimize.
[2023-03-15 13:34:51] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 0 ms to minimize.
[2023-03-15 13:34:52] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 1 ms to minimize.
[2023-03-15 13:34:52] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 0 ms to minimize.
[2023-03-15 13:34:52] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 1 ms to minimize.
[2023-03-15 13:34:52] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 0 ms to minimize.
[2023-03-15 13:34:52] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 0 ms to minimize.
[2023-03-15 13:34:52] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5286 ms
[2023-03-15 13:34:53] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 1 ms to minimize.
[2023-03-15 13:34:53] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 1 ms to minimize.
[2023-03-15 13:34:53] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 1 ms to minimize.
[2023-03-15 13:34:53] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 0 ms to minimize.
[2023-03-15 13:34:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 634 ms
[2023-03-15 13:34:53] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 0 ms to minimize.
[2023-03-15 13:34:53] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2023-03-15 13:34:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 283 ms
[2023-03-15 13:34:54] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 0 ms to minimize.
[2023-03-15 13:34:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-15 13:34:54] [INFO ] Deduced a trap composed of 24 places in 211 ms of which 1 ms to minimize.
[2023-03-15 13:34:55] [INFO ] Deduced a trap composed of 22 places in 238 ms of which 1 ms to minimize.
[2023-03-15 13:34:55] [INFO ] Deduced a trap composed of 52 places in 194 ms of which 0 ms to minimize.
[2023-03-15 13:34:55] [INFO ] Deduced a trap composed of 45 places in 199 ms of which 0 ms to minimize.
[2023-03-15 13:34:55] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 1 ms to minimize.
[2023-03-15 13:34:55] [INFO ] Deduced a trap composed of 34 places in 199 ms of which 1 ms to minimize.
[2023-03-15 13:34:56] [INFO ] Deduced a trap composed of 30 places in 198 ms of which 1 ms to minimize.
[2023-03-15 13:34:56] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 1 ms to minimize.
[2023-03-15 13:34:56] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1990 ms
[2023-03-15 13:34:56] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 0 ms to minimize.
[2023-03-15 13:34:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2023-03-15 13:34:57] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 1 ms to minimize.
[2023-03-15 13:34:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2023-03-15 13:34:57] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 1 ms to minimize.
[2023-03-15 13:34:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2023-03-15 13:34:57] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 1 ms to minimize.
[2023-03-15 13:34:58] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 0 ms to minimize.
[2023-03-15 13:34:58] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 1 ms to minimize.
[2023-03-15 13:34:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 536 ms
[2023-03-15 13:34:58] [INFO ] Deduced a trap composed of 16 places in 235 ms of which 1 ms to minimize.
[2023-03-15 13:34:58] [INFO ] Deduced a trap composed of 16 places in 238 ms of which 0 ms to minimize.
[2023-03-15 13:34:59] [INFO ] Deduced a trap composed of 16 places in 242 ms of which 1 ms to minimize.
[2023-03-15 13:34:59] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 0 ms to minimize.
[2023-03-15 13:34:59] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 0 ms to minimize.
[2023-03-15 13:34:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1281 ms
[2023-03-15 13:34:59] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 0 ms to minimize.
[2023-03-15 13:34:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-03-15 13:35:00] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 0 ms to minimize.
[2023-03-15 13:35:00] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 0 ms to minimize.
[2023-03-15 13:35:00] [INFO ] Deduced a trap composed of 44 places in 189 ms of which 1 ms to minimize.
[2023-03-15 13:35:00] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 1 ms to minimize.
[2023-03-15 13:35:01] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 0 ms to minimize.
[2023-03-15 13:35:01] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 0 ms to minimize.
[2023-03-15 13:35:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1470 ms
[2023-03-15 13:35:01] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 0 ms to minimize.
[2023-03-15 13:35:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-15 13:35:01] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 0 ms to minimize.
[2023-03-15 13:35:02] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 1 ms to minimize.
[2023-03-15 13:35:02] [INFO ] Deduced a trap composed of 28 places in 224 ms of which 1 ms to minimize.
[2023-03-15 13:35:02] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 1 ms to minimize.
[2023-03-15 13:35:02] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 0 ms to minimize.
[2023-03-15 13:35:03] [INFO ] Deduced a trap composed of 24 places in 221 ms of which 1 ms to minimize.
[2023-03-15 13:35:03] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 1 ms to minimize.
[2023-03-15 13:35:03] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 0 ms to minimize.
[2023-03-15 13:35:03] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 0 ms to minimize.
[2023-03-15 13:35:04] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 0 ms to minimize.
[2023-03-15 13:35:04] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 1 ms to minimize.
[2023-03-15 13:35:04] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 0 ms to minimize.
[2023-03-15 13:35:04] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 0 ms to minimize.
[2023-03-15 13:35:04] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3063 ms
[2023-03-15 13:35:05] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 1 ms to minimize.
[2023-03-15 13:35:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2023-03-15 13:35:05] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 1 ms to minimize.
[2023-03-15 13:35:05] [INFO ] Deduced a trap composed of 17 places in 210 ms of which 1 ms to minimize.
[2023-03-15 13:35:05] [INFO ] Deduced a trap composed of 22 places in 214 ms of which 1 ms to minimize.
[2023-03-15 13:35:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 713 ms
[2023-03-15 13:35:06] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 1 ms to minimize.
[2023-03-15 13:35:06] [INFO ] Deduced a trap composed of 35 places in 198 ms of which 0 ms to minimize.
[2023-03-15 13:35:06] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 1 ms to minimize.
[2023-03-15 13:35:07] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 1 ms to minimize.
[2023-03-15 13:35:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 852 ms
[2023-03-15 13:35:07] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 1 ms to minimize.
[2023-03-15 13:35:07] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 1 ms to minimize.
[2023-03-15 13:35:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 448 ms
[2023-03-15 13:35:07] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 1 ms to minimize.
[2023-03-15 13:35:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2023-03-15 13:35:08] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 0 ms to minimize.
[2023-03-15 13:35:08] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 1 ms to minimize.
[2023-03-15 13:35:08] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 1 ms to minimize.
[2023-03-15 13:35:09] [INFO ] Deduced a trap composed of 39 places in 232 ms of which 1 ms to minimize.
[2023-03-15 13:35:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1050 ms
[2023-03-15 13:35:09] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 0 ms to minimize.
[2023-03-15 13:35:09] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 1 ms to minimize.
[2023-03-15 13:35:09] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 1 ms to minimize.
[2023-03-15 13:35:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 704 ms
[2023-03-15 13:35:10] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 1 ms to minimize.
[2023-03-15 13:35:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2023-03-15 13:35:10] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 1 ms to minimize.
[2023-03-15 13:35:11] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 1 ms to minimize.
[2023-03-15 13:35:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 464 ms
[2023-03-15 13:35:11] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 1 ms to minimize.
[2023-03-15 13:35:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2023-03-15 13:35:12] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 0 ms to minimize.
[2023-03-15 13:35:12] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 0 ms to minimize.
[2023-03-15 13:35:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 376 ms
[2023-03-15 13:35:12] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 1 ms to minimize.
[2023-03-15 13:35:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 588 ms
[2023-03-15 13:35:13] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 0 ms to minimize.
[2023-03-15 13:35:13] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 1 ms to minimize.
[2023-03-15 13:35:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 433 ms
[2023-03-15 13:35:13] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 1 ms to minimize.
[2023-03-15 13:35:14] [INFO ] Deduced a trap composed of 76 places in 172 ms of which 1 ms to minimize.
[2023-03-15 13:35:14] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 0 ms to minimize.
[2023-03-15 13:35:14] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 1 ms to minimize.
[2023-03-15 13:35:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 852 ms
[2023-03-15 13:35:15] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 1 ms to minimize.
[2023-03-15 13:35:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-15 13:35:15] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 1 ms to minimize.
[2023-03-15 13:35:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2023-03-15 13:35:16] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 0 ms to minimize.
[2023-03-15 13:35:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2023-03-15 13:35:16] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 0 ms to minimize.
[2023-03-15 13:35:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2023-03-15 13:35:16] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 1 ms to minimize.
[2023-03-15 13:35:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-03-15 13:35:17] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 0 ms to minimize.
[2023-03-15 13:35:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-15 13:35:17] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 0 ms to minimize.
[2023-03-15 13:35:17] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 0 ms to minimize.
[2023-03-15 13:35:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 523 ms
[2023-03-15 13:35:18] [INFO ] Deduced a trap composed of 9 places in 234 ms of which 0 ms to minimize.
[2023-03-15 13:35:18] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2023-03-15 13:35:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 401 ms
[2023-03-15 13:35:18] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 1 ms to minimize.
[2023-03-15 13:35:19] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 1 ms to minimize.
[2023-03-15 13:35:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 677 ms
[2023-03-15 13:35:19] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 1 ms to minimize.
[2023-03-15 13:35:19] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 1 ms to minimize.
[2023-03-15 13:35:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 507 ms
[2023-03-15 13:35:20] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 0 ms to minimize.
[2023-03-15 13:35:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2023-03-15 13:35:20] [INFO ] Deduced a trap composed of 54 places in 208 ms of which 1 ms to minimize.
[2023-03-15 13:35:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2023-03-15 13:35:20] [INFO ] After 49857ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :86
Attempting to minimize the solution found.
Minimization took 3195 ms.
[2023-03-15 13:35:24] [INFO ] After 53788ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :86
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 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
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 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
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 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
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 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 442362 steps, run visited all 1 properties in 1660 ms. (steps per millisecond=266 )
Probabilistic random walk after 442362 steps, saw 65796 distinct states, run finished after 1664 ms. (steps per millisecond=265 ) properties seen :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 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 131808 steps, run visited all 1 properties in 383 ms. (steps per millisecond=344 )
Probabilistic random walk after 131808 steps, saw 21267 distinct states, run finished after 384 ms. (steps per millisecond=343 ) properties seen :1
Finished random walk after 3980 steps, including 1 resets, run visited all 1 properties in 10 ms. (steps per millisecond=398 )
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 17777 steps, run visited all 1 properties in 58 ms. (steps per millisecond=306 )
Probabilistic random walk after 17777 steps, saw 4286 distinct states, run finished after 58 ms. (steps per millisecond=306 ) 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
Finished Best-First random walk after 9830 steps, including 2 resets, run visited all 1 properties in 8 ms. (steps per millisecond=1228 )
Finished random walk after 7732 steps, including 2 resets, run visited all 1 properties in 18 ms. (steps per millisecond=429 )
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 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1000405 steps, run timeout after 3001 ms. (steps per millisecond=333 ) properties seen :{}
Probabilistic random walk after 1000405 steps, saw 145571 distinct states, run finished after 3004 ms. (steps per millisecond=333 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:35:29] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:35:29] [INFO ] Invariant cache hit.
[2023-03-15 13:35:29] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:35:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:35:29] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:35:29] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:35:29] [INFO ] After 49ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:35:29] [INFO ] After 80ms 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 13:35:29] [INFO ] After 352ms 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 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 995687 steps, run timeout after 3001 ms. (steps per millisecond=331 ) properties seen :{}
Probabilistic random walk after 995687 steps, saw 144297 distinct states, run finished after 3001 ms. (steps per millisecond=331 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:35:32] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:35:32] [INFO ] Invariant cache hit.
[2023-03-15 13:35:32] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:35:33] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:35:33] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:35:33] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:35:33] [INFO ] After 46ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:35:33] [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 13:35:33] [INFO ] After 348ms 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.
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 13:35:33] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:35:33] [INFO ] Invariant cache hit.
[2023-03-15 13:35:33] [INFO ] Implicit Places using invariants in 391 ms returned []
[2023-03-15 13:35:33] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:35:33] [INFO ] Invariant cache hit.
[2023-03-15 13:35:34] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:35:35] [INFO ] Implicit Places using invariants and state equation in 1592 ms returned []
Implicit Place search using SMT with State Equation took 1985 ms to find 0 implicit places.
[2023-03-15 13:35:35] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 13:35:35] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:35:35] [INFO ] Invariant cache hit.
[2023-03-15 13:35:36] [INFO ] Dead Transitions using invariants and state equation in 738 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2759 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 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.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 66 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 13:35:36] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-15 13:35:36] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:35:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:35:36] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:35:36] [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 13:35:36] [INFO ] After 35ms 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 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) 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 965664 steps, run timeout after 3001 ms. (steps per millisecond=321 ) properties seen :{}
Probabilistic random walk after 965664 steps, saw 141247 distinct states, run finished after 3004 ms. (steps per millisecond=321 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:35:39] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:35:39] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-15 13:35:39] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:35:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:35:39] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:35:39] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:35:39] [INFO ] After 46ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:35:39] [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 22 ms.
[2023-03-15 13:35:39] [INFO ] After 376ms 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 15 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 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 931735 steps, run timeout after 3001 ms. (steps per millisecond=310 ) properties seen :{}
Probabilistic random walk after 931735 steps, saw 136488 distinct states, run finished after 3001 ms. (steps per millisecond=310 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:35:42] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:35:42] [INFO ] Invariant cache hit.
[2023-03-15 13:35:42] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:35:42] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:35:43] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:35:43] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:35:43] [INFO ] After 42ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:35:43] [INFO ] After 74ms 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 13:35:43] [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 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 14 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 13:35:43] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:35:43] [INFO ] Invariant cache hit.
[2023-03-15 13:35:43] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-15 13:35:43] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:35:43] [INFO ] Invariant cache hit.
[2023-03-15 13:35:43] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:35:44] [INFO ] Implicit Places using invariants and state equation in 1153 ms returned []
Implicit Place search using SMT with State Equation took 1471 ms to find 0 implicit places.
[2023-03-15 13:35:44] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-15 13:35:44] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:35:44] [INFO ] Invariant cache hit.
[2023-03-15 13:35:45] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2239 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 28 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 13:35:45] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:35:45] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:35:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 13:35:45] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:35:45] [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 13:35:45] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 209 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=104 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) 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 916832 steps, run timeout after 3001 ms. (steps per millisecond=305 ) properties seen :{}
Probabilistic random walk after 916832 steps, saw 133619 distinct states, run finished after 3001 ms. (steps per millisecond=305 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:35:48] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:35:48] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 13:35:48] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:35:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:35:48] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:35:48] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:35:48] [INFO ] After 46ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:35:48] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-15 13:35:49] [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 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.
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 1015805 steps, run timeout after 3001 ms. (steps per millisecond=338 ) properties seen :{}
Probabilistic random walk after 1015805 steps, saw 148541 distinct states, run finished after 3001 ms. (steps per millisecond=338 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:35:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:35:52] [INFO ] Invariant cache hit.
[2023-03-15 13:35:52] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:35:52] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:35:52] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:35:52] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:35:52] [INFO ] After 40ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:35:52] [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 26 ms.
[2023-03-15 13:35:52] [INFO ] After 356ms 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 16 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.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 16 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 13:35:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:35:52] [INFO ] Invariant cache hit.
[2023-03-15 13:35:52] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-03-15 13:35:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:35:52] [INFO ] Invariant cache hit.
[2023-03-15 13:35:53] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:35:54] [INFO ] Implicit Places using invariants and state equation in 1124 ms returned []
Implicit Place search using SMT with State Equation took 1598 ms to find 0 implicit places.
[2023-03-15 13:35:54] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-15 13:35:54] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:35:54] [INFO ] Invariant cache hit.
[2023-03-15 13:35:54] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2142 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 20 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 13:35:54] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:35:54] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:35:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 13:35:54] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:35:54] [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 1 ms.
[2023-03-15 13:35:54] [INFO ] After 36ms 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 966910 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :{}
Probabilistic random walk after 966910 steps, saw 141467 distinct states, run finished after 3001 ms. (steps per millisecond=322 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:35:57] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:35:57] [INFO ] Computed 17 place invariants in 5 ms
[2023-03-15 13:35:57] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:35:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:35:58] [INFO ] After 230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:35:58] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:35:58] [INFO ] After 82ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:35:58] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-15 13:35:58] [INFO ] After 508ms 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 14 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 958874 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :{}
Probabilistic random walk after 958874 steps, saw 139771 distinct states, run finished after 3001 ms. (steps per millisecond=319 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:36:01] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:36:01] [INFO ] Invariant cache hit.
[2023-03-15 13:36:01] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:36:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 13:36:01] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:01] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:36:01] [INFO ] After 60ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:01] [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 31 ms.
[2023-03-15 13:36:01] [INFO ] After 546ms 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 14 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 13:36:02] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:36:02] [INFO ] Invariant cache hit.
[2023-03-15 13:36:02] [INFO ] Implicit Places using invariants in 429 ms returned []
[2023-03-15 13:36:02] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:36:02] [INFO ] Invariant cache hit.
[2023-03-15 13:36:02] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:36:03] [INFO ] Implicit Places using invariants and state equation in 1253 ms returned []
Implicit Place search using SMT with State Equation took 1702 ms to find 0 implicit places.
[2023-03-15 13:36:03] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 13:36:03] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:36:03] [INFO ] Invariant cache hit.
[2023-03-15 13:36:04] [INFO ] Dead Transitions using invariants and state equation in 499 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2226 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 14 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 13:36:04] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:36:04] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:36:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 13:36:04] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:04] [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 2 ms.
[2023-03-15 13:36:04] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 3827 steps, including 1 resets, run visited all 1 properties in 10 ms. (steps per millisecond=382 )
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 973651 steps, run timeout after 3001 ms. (steps per millisecond=324 ) properties seen :{}
Probabilistic random walk after 973651 steps, saw 142447 distinct states, run finished after 3001 ms. (steps per millisecond=324 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:36:07] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:36:07] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 13:36:07] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:36:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2023-03-15 13:36:07] [INFO ] After 279ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:07] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:36:07] [INFO ] After 65ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:07] [INFO ] After 120ms 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 13:36:08] [INFO ] After 569ms 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 14 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 888468 steps, run timeout after 3001 ms. (steps per millisecond=296 ) properties seen :{}
Probabilistic random walk after 888468 steps, saw 130298 distinct states, run finished after 3001 ms. (steps per millisecond=296 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:36:11] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:36:11] [INFO ] Invariant cache hit.
[2023-03-15 13:36:11] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:36:11] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:36:11] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:11] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:36:11] [INFO ] After 41ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:11] [INFO ] After 84ms 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 13:36:11] [INFO ] After 377ms 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 12 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 13:36:11] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:36:11] [INFO ] Invariant cache hit.
[2023-03-15 13:36:12] [INFO ] Implicit Places using invariants in 551 ms returned []
[2023-03-15 13:36:12] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:36:12] [INFO ] Invariant cache hit.
[2023-03-15 13:36:12] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:36:13] [INFO ] Implicit Places using invariants and state equation in 1354 ms returned []
Implicit Place search using SMT with State Equation took 1908 ms to find 0 implicit places.
[2023-03-15 13:36:13] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 13:36:13] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:36:13] [INFO ] Invariant cache hit.
[2023-03-15 13:36:14] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2548 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 14 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 13:36:14] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-15 13:36:14] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:36:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:36:14] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:14] [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 13:36:14] [INFO ] After 34ms 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 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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 968121 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :{}
Probabilistic random walk after 968121 steps, saw 141605 distinct states, run finished after 3002 ms. (steps per millisecond=322 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:36:17] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:36:17] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-15 13:36:17] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:36:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:36:17] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:17] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:36:17] [INFO ] After 70ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:17] [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 31 ms.
[2023-03-15 13:36:17] [INFO ] After 464ms 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.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 864185 steps, run timeout after 3001 ms. (steps per millisecond=287 ) properties seen :{}
Probabilistic random walk after 864185 steps, saw 126668 distinct states, run finished after 3001 ms. (steps per millisecond=287 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:36:20] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:36:20] [INFO ] Invariant cache hit.
[2023-03-15 13:36:20] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:36:21] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 13:36:21] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:36:21] [INFO ] After 72ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:21] [INFO ] After 127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-15 13:36:21] [INFO ] After 564ms 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 13:36:21] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:36:21] [INFO ] Invariant cache hit.
[2023-03-15 13:36:21] [INFO ] Implicit Places using invariants in 488 ms returned []
[2023-03-15 13:36:21] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:36:21] [INFO ] Invariant cache hit.
[2023-03-15 13:36:22] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:36:23] [INFO ] Implicit Places using invariants and state equation in 1495 ms returned []
Implicit Place search using SMT with State Equation took 1984 ms to find 0 implicit places.
[2023-03-15 13:36:23] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 13:36:23] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:36:23] [INFO ] Invariant cache hit.
[2023-03-15 13:36:24] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2753 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 4 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 13:36:24] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:36:24] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:36:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:36:24] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:24] [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 1 ms.
[2023-03-15 13:36:24] [INFO ] After 31ms 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 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 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 131093 steps, run visited all 1 properties in 523 ms. (steps per millisecond=250 )
Probabilistic random walk after 131093 steps, saw 20848 distinct states, run finished after 524 ms. (steps per millisecond=250 ) properties seen :1
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
Finished probabilistic random walk after 2609 steps, run visited all 1 properties in 15 ms. (steps per millisecond=173 )
Probabilistic random walk after 2609 steps, saw 1587 distinct states, run finished after 15 ms. (steps per millisecond=173 ) properties seen :1
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 1026123 steps, run timeout after 3001 ms. (steps per millisecond=341 ) properties seen :{}
Probabilistic random walk after 1026123 steps, saw 149503 distinct states, run finished after 3002 ms. (steps per millisecond=341 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:36:27] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:36:27] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 13:36:28] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:36:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 13:36:28] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:28] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:36:28] [INFO ] After 64ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:28] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-15 13:36:28] [INFO ] After 535ms 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.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 914473 steps, run timeout after 3001 ms. (steps per millisecond=304 ) properties seen :{}
Probabilistic random walk after 914473 steps, saw 133580 distinct states, run finished after 3005 ms. (steps per millisecond=304 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:36:31] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:36:31] [INFO ] Invariant cache hit.
[2023-03-15 13:36:31] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:36:31] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-15 13:36:32] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:32] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:36:32] [INFO ] After 52ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:32] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-15 13:36:32] [INFO ] After 463ms 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 13:36:32] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:36:32] [INFO ] Invariant cache hit.
[2023-03-15 13:36:32] [INFO ] Implicit Places using invariants in 509 ms returned []
[2023-03-15 13:36:32] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:36:32] [INFO ] Invariant cache hit.
[2023-03-15 13:36:33] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:36:34] [INFO ] Implicit Places using invariants and state equation in 1458 ms returned []
Implicit Place search using SMT with State Equation took 1968 ms to find 0 implicit places.
[2023-03-15 13:36:34] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 13:36:34] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:36:34] [INFO ] Invariant cache hit.
[2023-03-15 13:36:35] [INFO ] Dead Transitions using invariants and state equation in 950 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2953 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 1 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 25 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 13:36:35] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:36:35] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:36:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 13:36:35] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:35] [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 13:36:35] [INFO ] After 36ms 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 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 922215 steps, run timeout after 3001 ms. (steps per millisecond=307 ) properties seen :{}
Probabilistic random walk after 922215 steps, saw 133816 distinct states, run finished after 3001 ms. (steps per millisecond=307 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:36:38] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:36:38] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 13:36:38] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:36:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2023-03-15 13:36:38] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:38] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:36:38] [INFO ] After 66ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:38] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-15 13:36:38] [INFO ] After 556ms 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.
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
Interrupted probabilistic random walk after 927640 steps, run timeout after 3001 ms. (steps per millisecond=309 ) properties seen :{}
Probabilistic random walk after 927640 steps, saw 136073 distinct states, run finished after 3001 ms. (steps per millisecond=309 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:36:42] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:36:42] [INFO ] Invariant cache hit.
[2023-03-15 13:36:42] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:36:42] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-15 13:36:42] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:42] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:36:42] [INFO ] After 40ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:42] [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 29 ms.
[2023-03-15 13:36:42] [INFO ] After 362ms 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 15 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 13:36:42] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:36:42] [INFO ] Invariant cache hit.
[2023-03-15 13:36:43] [INFO ] Implicit Places using invariants in 517 ms returned []
[2023-03-15 13:36:43] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:36:43] [INFO ] Invariant cache hit.
[2023-03-15 13:36:43] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:36:44] [INFO ] Implicit Places using invariants and state equation in 1564 ms returned []
Implicit Place search using SMT with State Equation took 2082 ms to find 0 implicit places.
[2023-03-15 13:36:44] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-15 13:36:44] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:36:44] [INFO ] Invariant cache hit.
[2023-03-15 13:36:45] [INFO ] Dead Transitions using invariants and state equation in 811 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2930 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 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 13:36:45] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:36:45] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:36:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 13:36:45] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:45] [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 13:36:45] [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 31 ms. (steps per millisecond=322 ) 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 1011 ms. (steps per millisecond=218 )
Probabilistic random walk after 221272 steps, saw 35224 distinct states, run finished after 1012 ms. (steps per millisecond=218 ) properties seen :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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 989380 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :{}
Probabilistic random walk after 989380 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 13:36:49] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:36:49] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-15 13:36:49] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:36:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 13:36:50] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:50] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:36:50] [INFO ] After 52ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:50] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-15 13:36:50] [INFO ] After 481ms 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 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
Interrupted probabilistic random walk after 969640 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :{}
Probabilistic random walk after 969640 steps, saw 141853 distinct states, run finished after 3001 ms. (steps per millisecond=323 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:36:53] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:36:53] [INFO ] Invariant cache hit.
[2023-03-15 13:36:53] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:36:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 13:36:53] [INFO ] After 245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:53] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:36:53] [INFO ] After 55ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:53] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-15 13:36:53] [INFO ] After 487ms 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.
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 13:36:53] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:36:53] [INFO ] Invariant cache hit.
[2023-03-15 13:36:54] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-03-15 13:36:54] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:36:54] [INFO ] Invariant cache hit.
[2023-03-15 13:36:54] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:36:55] [INFO ] Implicit Places using invariants and state equation in 1539 ms returned []
Implicit Place search using SMT with State Equation took 1990 ms to find 0 implicit places.
[2023-03-15 13:36:55] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-15 13:36:55] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:36:55] [INFO ] Invariant cache hit.
[2023-03-15 13:36:56] [INFO ] Dead Transitions using invariants and state equation in 824 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2839 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 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 13:36:56] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:36:56] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:36:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 13:36:56] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:36:56] [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 13:36:56] [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 36 ms. (steps per millisecond=277 ) 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 902881 steps, run timeout after 3001 ms. (steps per millisecond=300 ) properties seen :{}
Probabilistic random walk after 902881 steps, saw 132034 distinct states, run finished after 3001 ms. (steps per millisecond=300 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:36:59] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:36:59] [INFO ] Computed 17 place invariants in 10 ms
[2023-03-15 13:36:59] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:36:59] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 13:37:00] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:00] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:37:00] [INFO ] After 53ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:00] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-15 13:37:00] [INFO ] After 493ms 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 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 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 844732 steps, run timeout after 3001 ms. (steps per millisecond=281 ) properties seen :{}
Probabilistic random walk after 844732 steps, saw 122943 distinct states, run finished after 3004 ms. (steps per millisecond=281 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:37:03] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:37:03] [INFO ] Invariant cache hit.
[2023-03-15 13:37:03] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:37:03] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:37:03] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:03] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:37:03] [INFO ] After 37ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:03] [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 19 ms.
[2023-03-15 13:37:03] [INFO ] After 337ms 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 13:37:03] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:37:03] [INFO ] Invariant cache hit.
[2023-03-15 13:37:04] [INFO ] Implicit Places using invariants in 498 ms returned []
[2023-03-15 13:37:04] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:37:04] [INFO ] Invariant cache hit.
[2023-03-15 13:37:04] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:37:05] [INFO ] Implicit Places using invariants and state equation in 1530 ms returned []
Implicit Place search using SMT with State Equation took 2032 ms to find 0 implicit places.
[2023-03-15 13:37:05] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 13:37:05] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:37:05] [INFO ] Invariant cache hit.
[2023-03-15 13:37:06] [INFO ] Dead Transitions using invariants and state equation in 779 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2841 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 14 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 13:37:06] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:37:06] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:37:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:37:06] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:06] [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 2 ms.
[2023-03-15 13:37:06] [INFO ] After 34ms 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 36 ms. (steps per millisecond=277 ) 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 942711 steps, run timeout after 3001 ms. (steps per millisecond=314 ) properties seen :{}
Probabilistic random walk after 942711 steps, saw 138030 distinct states, run finished after 3002 ms. (steps per millisecond=314 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:37:09] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:37:09] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 13:37:09] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:37:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:37:10] [INFO ] After 256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:10] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:37:10] [INFO ] After 60ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:10] [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 31 ms.
[2023-03-15 13:37:10] [INFO ] After 489ms 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.
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 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 969633 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :{}
Probabilistic random walk after 969633 steps, saw 141852 distinct states, run finished after 3002 ms. (steps per millisecond=322 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:37:13] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:37:13] [INFO ] Invariant cache hit.
[2023-03-15 13:37:13] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:37:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 13:37:13] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:13] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:37:13] [INFO ] After 72ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:13] [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 13:37:13] [INFO ] After 534ms 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.
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 13:37:14] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:37:14] [INFO ] Invariant cache hit.
[2023-03-15 13:37:14] [INFO ] Implicit Places using invariants in 514 ms returned []
[2023-03-15 13:37:14] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:37:14] [INFO ] Invariant cache hit.
[2023-03-15 13:37:14] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:37:16] [INFO ] Implicit Places using invariants and state equation in 1508 ms returned []
Implicit Place search using SMT with State Equation took 2024 ms to find 0 implicit places.
[2023-03-15 13:37:16] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-15 13:37:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:37:16] [INFO ] Invariant cache hit.
[2023-03-15 13:37:16] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2812 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 14 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 13:37:16] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:37:16] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:37:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:37:16] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:16] [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 13:37:16] [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 36 ms. (steps per millisecond=277 ) 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 916475 steps, run timeout after 3001 ms. (steps per millisecond=305 ) properties seen :{}
Probabilistic random walk after 916475 steps, saw 133619 distinct states, run finished after 3001 ms. (steps per millisecond=305 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:37:19] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:37:19] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 13:37:20] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:37:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2023-03-15 13:37:20] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:20] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:37:20] [INFO ] After 62ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:20] [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 13:37:20] [INFO ] After 560ms 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.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 922306 steps, run timeout after 3001 ms. (steps per millisecond=307 ) properties seen :{}
Probabilistic random walk after 922306 steps, saw 133844 distinct states, run finished after 3001 ms. (steps per millisecond=307 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:37:23] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:37:23] [INFO ] Invariant cache hit.
[2023-03-15 13:37:23] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:37:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:37:24] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:24] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:37:24] [INFO ] After 60ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:24] [INFO ] After 113ms 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 13:37:24] [INFO ] After 437ms 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 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 13:37:24] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:37:24] [INFO ] Invariant cache hit.
[2023-03-15 13:37:24] [INFO ] Implicit Places using invariants in 536 ms returned []
[2023-03-15 13:37:24] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:37:24] [INFO ] Invariant cache hit.
[2023-03-15 13:37:25] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:37:26] [INFO ] Implicit Places using invariants and state equation in 1541 ms returned []
Implicit Place search using SMT with State Equation took 2079 ms to find 0 implicit places.
[2023-03-15 13:37:26] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-15 13:37:26] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:37:26] [INFO ] Invariant cache hit.
[2023-03-15 13:37:27] [INFO ] Dead Transitions using invariants and state equation in 822 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2935 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 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 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 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 13:37:27] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:37:27] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:37:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:37:27] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:27] [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 13:37:27] [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 34 ms. (steps per millisecond=294 ) 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 442412 steps, run visited all 1 properties in 1751 ms. (steps per millisecond=252 )
Probabilistic random walk after 442412 steps, saw 65835 distinct states, run finished after 1751 ms. (steps per millisecond=252 ) 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
Finished probabilistic random walk after 131857 steps, run visited all 1 properties in 386 ms. (steps per millisecond=341 )
Probabilistic random walk after 131857 steps, saw 21305 distinct states, run finished after 387 ms. (steps per millisecond=340 ) 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 1041047 steps, run timeout after 3001 ms. (steps per millisecond=346 ) properties seen :{}
Probabilistic random walk after 1041047 steps, saw 152104 distinct states, run finished after 3001 ms. (steps per millisecond=346 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:37:32] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:37:32] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 13:37:32] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:37:32] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-15 13:37:32] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:32] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:37:32] [INFO ] After 45ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:32] [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 23 ms.
[2023-03-15 13:37:32] [INFO ] After 359ms 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 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.
Finished random walk after 3838 steps, including 1 resets, run visited all 1 properties in 9 ms. (steps per millisecond=426 )
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
Finished probabilistic random walk after 502 steps, run visited all 1 properties in 6 ms. (steps per millisecond=83 )
Probabilistic random walk after 502 steps, saw 380 distinct states, run finished after 6 ms. (steps per millisecond=83 ) 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 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 131807 steps, run visited all 1 properties in 582 ms. (steps per millisecond=226 )
Probabilistic random walk after 131807 steps, saw 21266 distinct states, run finished after 582 ms. (steps per millisecond=226 ) properties seen :1
Finished random walk after 5737 steps, including 1 resets, run visited all 1 properties in 13 ms. (steps per millisecond=441 )
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 1044862 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :{}
Probabilistic random walk after 1044862 steps, saw 152664 distinct states, run finished after 3001 ms. (steps per millisecond=348 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:37:36] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:37:36] [INFO ] Invariant cache hit.
[2023-03-15 13:37:36] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:37:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:37:36] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:36] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:37:36] [INFO ] After 40ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:37] [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 13:37:37] [INFO ] After 377ms 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 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 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 911190 steps, run timeout after 3001 ms. (steps per millisecond=303 ) properties seen :{}
Probabilistic random walk after 911190 steps, saw 133313 distinct states, run finished after 3001 ms. (steps per millisecond=303 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:37:40] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:37:40] [INFO ] Invariant cache hit.
[2023-03-15 13:37:40] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:37:40] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 13:37:40] [INFO ] After 236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:40] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:37:40] [INFO ] After 64ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:40] [INFO ] After 116ms 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 13:37:40] [INFO ] After 495ms 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 13:37:40] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:37:40] [INFO ] Invariant cache hit.
[2023-03-15 13:37:41] [INFO ] Implicit Places using invariants in 467 ms returned []
[2023-03-15 13:37:41] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:37:41] [INFO ] Invariant cache hit.
[2023-03-15 13:37:41] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:37:42] [INFO ] Implicit Places using invariants and state equation in 1360 ms returned []
Implicit Place search using SMT with State Equation took 1829 ms to find 0 implicit places.
[2023-03-15 13:37:42] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-15 13:37:42] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:37:42] [INFO ] Invariant cache hit.
[2023-03-15 13:37:43] [INFO ] Dead Transitions using invariants and state equation in 693 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2549 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 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 109 transition count 196
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 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 0 with 18 rules applied. Total rules applied 77 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 0 with 12 rules applied. Total rules applied 89 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 0 with 6 rules applied. Total rules applied 95 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 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 8 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 13:37:43] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:37:43] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:37:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:37:43] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:43] [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 2 ms.
[2023-03-15 13:37:43] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) 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 968912 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :{}
Probabilistic random walk after 968912 steps, saw 141779 distinct states, run finished after 3001 ms. (steps per millisecond=322 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:37:46] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:37:46] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 13:37:46] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:37:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 13:37:46] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:46] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:37:46] [INFO ] After 50ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:46] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-15 13:37:46] [INFO ] After 466ms 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.
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 976864 steps, run timeout after 3001 ms. (steps per millisecond=325 ) properties seen :{}
Probabilistic random walk after 976864 steps, saw 142702 distinct states, run finished after 3002 ms. (steps per millisecond=325 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:37:49] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:37:49] [INFO ] Invariant cache hit.
[2023-03-15 13:37:49] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:37:50] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 13:37:50] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:50] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:37:50] [INFO ] After 58ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:50] [INFO ] After 110ms 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 13:37:50] [INFO ] After 537ms 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.
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 13:37:50] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:37:50] [INFO ] Invariant cache hit.
[2023-03-15 13:37:51] [INFO ] Implicit Places using invariants in 512 ms returned []
[2023-03-15 13:37:51] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:37:51] [INFO ] Invariant cache hit.
[2023-03-15 13:37:51] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:37:52] [INFO ] Implicit Places using invariants and state equation in 1571 ms returned []
Implicit Place search using SMT with State Equation took 2085 ms to find 0 implicit places.
[2023-03-15 13:37:52] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-15 13:37:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:37:52] [INFO ] Invariant cache hit.
[2023-03-15 13:37:53] [INFO ] Dead Transitions using invariants and state equation in 727 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2840 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 13:37:53] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:37:53] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:37:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:37:53] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:53] [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 4 ms.
[2023-03-15 13:37:53] [INFO ] After 35ms 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 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 768082 steps, run timeout after 3001 ms. (steps per millisecond=255 ) properties seen :{}
Probabilistic random walk after 768082 steps, saw 112652 distinct states, run finished after 3001 ms. (steps per millisecond=255 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:37:56] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:37:56] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-15 13:37:56] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:37:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 13:37:56] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:56] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:37:56] [INFO ] After 52ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:37:57] [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 31 ms.
[2023-03-15 13:37:57] [INFO ] After 433ms 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 13 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 765093 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :{}
Probabilistic random walk after 765093 steps, saw 112470 distinct states, run finished after 3001 ms. (steps per millisecond=254 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:38:00] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:00] [INFO ] Invariant cache hit.
[2023-03-15 13:38:00] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:38:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:38:00] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:00] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:38:00] [INFO ] After 55ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:00] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-15 13:38:00] [INFO ] After 392ms 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.
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 13:38:00] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:00] [INFO ] Invariant cache hit.
[2023-03-15 13:38:01] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-15 13:38:01] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:01] [INFO ] Invariant cache hit.
[2023-03-15 13:38:01] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:38:02] [INFO ] Implicit Places using invariants and state equation in 1437 ms returned []
Implicit Place search using SMT with State Equation took 1851 ms to find 0 implicit places.
[2023-03-15 13:38:02] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 13:38:02] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:02] [INFO ] Invariant cache hit.
[2023-03-15 13:38:03] [INFO ] Dead Transitions using invariants and state equation in 746 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2622 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 1 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.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 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 14 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 13:38:03] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:38:03] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:38:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:38:03] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:03] [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 13:38:03] [INFO ] After 30ms 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 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 964215 steps, run timeout after 3001 ms. (steps per millisecond=321 ) properties seen :{}
Probabilistic random walk after 964215 steps, saw 141076 distinct states, run finished after 3001 ms. (steps per millisecond=321 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:38:06] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:38:06] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 13:38:06] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:38:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 13:38:06] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:38:06] [INFO ] After 56ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:06] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-15 13:38:06] [INFO ] After 478ms 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.
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 991760 steps, run timeout after 3001 ms. (steps per millisecond=330 ) properties seen :{}
Probabilistic random walk after 991760 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 13:38:09] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:09] [INFO ] Invariant cache hit.
[2023-03-15 13:38:10] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:38:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:38:10] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:10] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:38:10] [INFO ] After 42ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:10] [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 20 ms.
[2023-03-15 13:38:10] [INFO ] After 348ms 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 13:38:10] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:10] [INFO ] Invariant cache hit.
[2023-03-15 13:38:10] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-03-15 13:38:10] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:10] [INFO ] Invariant cache hit.
[2023-03-15 13:38:11] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:38:12] [INFO ] Implicit Places using invariants and state equation in 1301 ms returned []
Implicit Place search using SMT with State Equation took 1712 ms to find 0 implicit places.
[2023-03-15 13:38:12] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 13:38:12] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:12] [INFO ] Invariant cache hit.
[2023-03-15 13:38:12] [INFO ] Dead Transitions using invariants and state equation in 460 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2189 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 17 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 13:38:12] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:38:12] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:38:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:38:12] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:12] [INFO ] After 8ms 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 13:38:12] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 940912 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :{}
Probabilistic random walk after 940912 steps, saw 137791 distinct states, run finished after 3001 ms. (steps per millisecond=313 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:38:15] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:38:15] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 13:38:15] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:38:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:38:15] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:15] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:38:16] [INFO ] After 36ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:16] [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 13:38:16] [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 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 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 991004 steps, run timeout after 3001 ms. (steps per millisecond=330 ) properties seen :{}
Probabilistic random walk after 991004 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 13:38:19] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:19] [INFO ] Invariant cache hit.
[2023-03-15 13:38:19] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:38:19] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:38:19] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:19] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:38:19] [INFO ] After 36ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:19] [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 29 ms.
[2023-03-15 13:38:19] [INFO ] After 351ms 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.
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 13:38:19] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:19] [INFO ] Invariant cache hit.
[2023-03-15 13:38:19] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-15 13:38:19] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:19] [INFO ] Invariant cache hit.
[2023-03-15 13:38:20] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:38:21] [INFO ] Implicit Places using invariants and state equation in 1250 ms returned []
Implicit Place search using SMT with State Equation took 1678 ms to find 0 implicit places.
[2023-03-15 13:38:21] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 13:38:21] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:21] [INFO ] Invariant cache hit.
[2023-03-15 13:38:21] [INFO ] Dead Transitions using invariants and state equation in 581 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2280 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.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 17 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 13:38:21] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:38:21] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:38:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 13:38:21] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:21] [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 13:38:21] [INFO ] After 46ms 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 36 ms. (steps per millisecond=277 ) 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 997850 steps, run timeout after 3001 ms. (steps per millisecond=332 ) properties seen :{}
Probabilistic random walk after 997850 steps, saw 144607 distinct states, run finished after 3003 ms. (steps per millisecond=332 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:38:24] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:38:24] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 13:38:25] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:38:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:38:25] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:25] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:38:25] [INFO ] After 39ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:25] [INFO ] After 71ms 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 13:38:25] [INFO ] After 336ms 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.
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 1008455 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :{}
Probabilistic random walk after 1008455 steps, saw 147414 distinct states, run finished after 3001 ms. (steps per millisecond=336 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:38:28] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:28] [INFO ] Invariant cache hit.
[2023-03-15 13:38:28] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:38:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:38:28] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:28] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:38:28] [INFO ] After 44ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:28] [INFO ] After 75ms 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 13:38:28] [INFO ] After 360ms 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 13:38:28] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:28] [INFO ] Invariant cache hit.
[2023-03-15 13:38:29] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-15 13:38:29] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:29] [INFO ] Invariant cache hit.
[2023-03-15 13:38:29] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:38:30] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1282 ms to find 0 implicit places.
[2023-03-15 13:38:30] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 13:38:30] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:30] [INFO ] Invariant cache hit.
[2023-03-15 13:38:30] [INFO ] Dead Transitions using invariants and state equation in 473 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1773 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.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 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 13:38:30] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:38:30] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:38:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 13:38:30] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:30] [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 2 ms.
[2023-03-15 13:38:30] [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 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 1069173 steps, run timeout after 3001 ms. (steps per millisecond=356 ) properties seen :{}
Probabilistic random walk after 1069173 steps, saw 154813 distinct states, run finished after 3004 ms. (steps per millisecond=355 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:38:33] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:38:33] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 13:38:33] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:38:33] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:38:34] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:34] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:38:34] [INFO ] After 46ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:34] [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 13:38:34] [INFO ] After 347ms 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.
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 1058526 steps, run timeout after 3001 ms. (steps per millisecond=352 ) properties seen :{}
Probabilistic random walk after 1058526 steps, saw 154248 distinct states, run finished after 3004 ms. (steps per millisecond=352 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:38:37] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:37] [INFO ] Invariant cache hit.
[2023-03-15 13:38:37] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:38:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:38:37] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:37] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:38:37] [INFO ] After 49ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:37] [INFO ] After 80ms 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 13:38: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 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 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 13:38:37] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:37] [INFO ] Invariant cache hit.
[2023-03-15 13:38:37] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-15 13:38:37] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:37] [INFO ] Invariant cache hit.
[2023-03-15 13:38:38] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:38:38] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1257 ms to find 0 implicit places.
[2023-03-15 13:38:38] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 13:38:38] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:38] [INFO ] Invariant cache hit.
[2023-03-15 13:38:39] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1760 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 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 13:38:39] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:38:39] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:38:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 13:38:39] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:39] [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 2 ms.
[2023-03-15 13:38:39] [INFO ] After 25ms 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 1032885 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :{}
Probabilistic random walk after 1032885 steps, saw 149787 distinct states, run finished after 3001 ms. (steps per millisecond=344 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:38:42] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:38:42] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-15 13:38:42] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:38:42] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:38:42] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:42] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:38:42] [INFO ] After 43ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:42] [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 20 ms.
[2023-03-15 13:38:42] [INFO ] After 370ms 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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1002771 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :{}
Probabilistic random walk after 1002771 steps, saw 146676 distinct states, run finished after 3001 ms. (steps per millisecond=334 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:38:45] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:45] [INFO ] Invariant cache hit.
[2023-03-15 13:38:45] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:38:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:38:46] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:46] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:38:46] [INFO ] After 45ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:46] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-15 13:38:46] [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 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 13:38:46] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:46] [INFO ] Invariant cache hit.
[2023-03-15 13:38:46] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-15 13:38:46] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:46] [INFO ] Invariant cache hit.
[2023-03-15 13:38:46] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:38:47] [INFO ] Implicit Places using invariants and state equation in 1165 ms returned []
Implicit Place search using SMT with State Equation took 1521 ms to find 0 implicit places.
[2023-03-15 13:38:47] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 13:38:47] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:47] [INFO ] Invariant cache hit.
[2023-03-15 13:38:48] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2087 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 1 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 14 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 13:38:48] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:38:48] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:38:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 13:38:48] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:48] [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 13:38:48] [INFO ] After 38ms 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 26 ms. (steps per millisecond=384 ) 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 998879 steps, run timeout after 3001 ms. (steps per millisecond=332 ) properties seen :{}
Probabilistic random walk after 998879 steps, saw 144757 distinct states, run finished after 3001 ms. (steps per millisecond=332 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:38:51] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:38:51] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 13:38:51] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:38:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:38:51] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:51] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:38:51] [INFO ] After 42ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:52] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2023-03-15 13:38:52] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2023-03-15 13:38:52] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 0 ms to minimize.
[2023-03-15 13:38:52] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 1 ms to minimize.
[2023-03-15 13:38:52] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 0 ms to minimize.
[2023-03-15 13:38:52] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 0 ms to minimize.
[2023-03-15 13:38:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 865 ms
[2023-03-15 13:38:52] [INFO ] After 928ms 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 13:38:52] [INFO ] After 1213ms 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 8 ms. Remains : 258/258 places, 672/672 transitions.
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
Interrupted probabilistic random walk after 978166 steps, run timeout after 3001 ms. (steps per millisecond=325 ) properties seen :{}
Probabilistic random walk after 978166 steps, saw 142846 distinct states, run finished after 3001 ms. (steps per millisecond=325 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:38:55] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:55] [INFO ] Invariant cache hit.
[2023-03-15 13:38:55] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:38:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:38:56] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:56] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:38:56] [INFO ] After 47ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:38:56] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2023-03-15 13:38:56] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 1 ms to minimize.
[2023-03-15 13:38:56] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 0 ms to minimize.
[2023-03-15 13:38:56] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 1 ms to minimize.
[2023-03-15 13:38:57] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 1 ms to minimize.
[2023-03-15 13:38:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 799 ms
[2023-03-15 13:38:57] [INFO ] After 871ms 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 13:38:57] [INFO ] After 1161ms 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 13:38:57] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:57] [INFO ] Invariant cache hit.
[2023-03-15 13:38:57] [INFO ] Implicit Places using invariants in 424 ms returned []
[2023-03-15 13:38:57] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:57] [INFO ] Invariant cache hit.
[2023-03-15 13:38:57] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:38:58] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1444 ms to find 0 implicit places.
[2023-03-15 13:38:58] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 13:38:58] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:38:58] [INFO ] Invariant cache hit.
[2023-03-15 13:38:58] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1857 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 8 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 13:38:59] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:38:59] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:38:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 13:38:59] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:38: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 13:38:59] [INFO ] After 39ms 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 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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1004535 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :{}
Probabilistic random walk after 1004535 steps, saw 146927 distinct states, run finished after 3001 ms. (steps per millisecond=334 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:39:02] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:39:02] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 13:39:02] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:39:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:39:02] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:02] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:39:02] [INFO ] After 55ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:02] [INFO ] After 110ms 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 13:39:02] [INFO ] After 419ms 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.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 907165 steps, run timeout after 3001 ms. (steps per millisecond=302 ) properties seen :{}
Probabilistic random walk after 907165 steps, saw 132741 distinct states, run finished after 3001 ms. (steps per millisecond=302 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:39:05] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:39:05] [INFO ] Invariant cache hit.
[2023-03-15 13:39:05] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:39:05] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:39:05] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:05] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:39:06] [INFO ] After 43ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:06] [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 19 ms.
[2023-03-15 13:39:06] [INFO ] After 360ms 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 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 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 13:39:06] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:39:06] [INFO ] Invariant cache hit.
[2023-03-15 13:39:06] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-15 13:39:06] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:39:06] [INFO ] Invariant cache hit.
[2023-03-15 13:39:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:39:07] [INFO ] Implicit Places using invariants and state equation in 1515 ms returned []
Implicit Place search using SMT with State Equation took 1861 ms to find 0 implicit places.
[2023-03-15 13:39:07] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 13:39:07] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:39:07] [INFO ] Invariant cache hit.
[2023-03-15 13:39:08] [INFO ] Dead Transitions using invariants and state equation in 802 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2686 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 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 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 13:39:08] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-15 13:39:08] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:39:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:39:08] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:08] [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 13:39:08] [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 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 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 958398 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :{}
Probabilistic random walk after 958398 steps, saw 139513 distinct states, run finished after 3001 ms. (steps per millisecond=319 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:39:11] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:39:11] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 13:39:11] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:39:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 13:39:12] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:12] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:39:12] [INFO ] After 72ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:12] [INFO ] After 128ms 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 13:39:12] [INFO ] After 561ms 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.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 906745 steps, run timeout after 3001 ms. (steps per millisecond=302 ) properties seen :{}
Probabilistic random walk after 906745 steps, saw 132615 distinct states, run finished after 3001 ms. (steps per millisecond=302 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:39:15] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:39:15] [INFO ] Invariant cache hit.
[2023-03-15 13:39:15] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:39:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:39:15] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:15] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:39:15] [INFO ] After 78ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:16] [INFO ] After 137ms 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 13:39:16] [INFO ] After 436ms 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 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 13:39:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:39:16] [INFO ] Invariant cache hit.
[2023-03-15 13:39:16] [INFO ] Implicit Places using invariants in 507 ms returned []
[2023-03-15 13:39:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:39:16] [INFO ] Invariant cache hit.
[2023-03-15 13:39:16] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:39:18] [INFO ] Implicit Places using invariants and state equation in 1574 ms returned []
Implicit Place search using SMT with State Equation took 2083 ms to find 0 implicit places.
[2023-03-15 13:39:18] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-15 13:39:18] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:39:18] [INFO ] Invariant cache hit.
[2023-03-15 13:39:19] [INFO ] Dead Transitions using invariants and state equation in 830 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2941 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 1 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 14 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 13:39:19] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:39:19] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:39:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:39:19] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:19] [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 13:39:19] [INFO ] After 37ms 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 36 ms. (steps per millisecond=277 ) 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 920192 steps, run timeout after 3001 ms. (steps per millisecond=306 ) properties seen :{}
Probabilistic random walk after 920192 steps, saw 133620 distinct states, run finished after 3001 ms. (steps per millisecond=306 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:39:22] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:39:22] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 13:39:22] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:39:22] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:39:22] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:22] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:39:22] [INFO ] After 62ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:22] [INFO ] After 117ms 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 13:39:22] [INFO ] After 434ms 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.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 919856 steps, run timeout after 3001 ms. (steps per millisecond=306 ) properties seen :{}
Probabilistic random walk after 919856 steps, saw 133620 distinct states, run finished after 3001 ms. (steps per millisecond=306 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:39:25] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:39:25] [INFO ] Invariant cache hit.
[2023-03-15 13:39:25] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:39:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:39:26] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:39:26] [INFO ] After 63ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:26] [INFO ] After 117ms 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 13:39:26] [INFO ] After 461ms 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 13:39:26] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:39:26] [INFO ] Invariant cache hit.
[2023-03-15 13:39:26] [INFO ] Implicit Places using invariants in 505 ms returned []
[2023-03-15 13:39:26] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:39:26] [INFO ] Invariant cache hit.
[2023-03-15 13:39:27] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:39:28] [INFO ] Implicit Places using invariants and state equation in 1482 ms returned []
Implicit Place search using SMT with State Equation took 1989 ms to find 0 implicit places.
[2023-03-15 13:39:28] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 13:39:28] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:39:28] [INFO ] Invariant cache hit.
[2023-03-15 13:39:29] [INFO ] Dead Transitions using invariants and state equation in 748 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2762 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 7 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 13:39:29] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:39:29] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:39:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 13:39:29] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:29] [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 2 ms.
[2023-03-15 13:39:29] [INFO ] After 25ms 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 1013236 steps, run timeout after 3001 ms. (steps per millisecond=337 ) properties seen :{}
Probabilistic random walk after 1013236 steps, saw 148143 distinct states, run finished after 3001 ms. (steps per millisecond=337 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:39:32] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:39:32] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 13:39:32] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:39:32] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:39:32] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:32] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:39:32] [INFO ] After 60ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:32] [INFO ] After 110ms 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 13:39:32] [INFO ] After 406ms 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 33 ms. (steps per millisecond=303 ) 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 916209 steps, run timeout after 3001 ms. (steps per millisecond=305 ) properties seen :{}
Probabilistic random walk after 916209 steps, saw 133618 distinct states, run finished after 3004 ms. (steps per millisecond=304 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:39:35] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:39:35] [INFO ] Invariant cache hit.
[2023-03-15 13:39:35] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:39:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:39:35] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:35] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:39:36] [INFO ] After 50ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:36] [INFO ] After 88ms 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 13:39:36] [INFO ] After 376ms 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 8 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 13:39:36] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:39:36] [INFO ] Invariant cache hit.
[2023-03-15 13:39:36] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-15 13:39:36] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:39:36] [INFO ] Invariant cache hit.
[2023-03-15 13:39:36] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:39:37] [INFO ] Implicit Places using invariants and state equation in 1087 ms returned []
Implicit Place search using SMT with State Equation took 1444 ms to find 0 implicit places.
[2023-03-15 13:39:37] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 13:39:37] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:39:37] [INFO ] Invariant cache hit.
[2023-03-15 13:39:38] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2098 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 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 13:39:38] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:39:38] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:39:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:39:38] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:38] [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 13:39:38] [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 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 867104 steps, run timeout after 3001 ms. (steps per millisecond=288 ) properties seen :{}
Probabilistic random walk after 867104 steps, saw 127123 distinct states, run finished after 3001 ms. (steps per millisecond=288 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:39:41] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:39:41] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 13:39:41] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:39:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 13:39:41] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:41] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:39:41] [INFO ] After 66ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:42] [INFO ] Deduced a trap composed of 18 places in 241 ms of which 1 ms to minimize.
[2023-03-15 13:39:42] [INFO ] Deduced a trap composed of 24 places in 230 ms of which 0 ms to minimize.
[2023-03-15 13:39:42] [INFO ] Deduced a trap composed of 22 places in 212 ms of which 1 ms to minimize.
[2023-03-15 13:39:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 804 ms
[2023-03-15 13:39:42] [INFO ] After 900ms 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 13:39:42] [INFO ] After 1320ms 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 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.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 884303 steps, run timeout after 3001 ms. (steps per millisecond=294 ) properties seen :{}
Probabilistic random walk after 884303 steps, saw 128496 distinct states, run finished after 3001 ms. (steps per millisecond=294 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:39:45] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:39:45] [INFO ] Invariant cache hit.
[2023-03-15 13:39:45] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:39:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 13:39:46] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:46] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:39:46] [INFO ] After 66ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:46] [INFO ] Deduced a trap composed of 29 places in 229 ms of which 0 ms to minimize.
[2023-03-15 13:39:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2023-03-15 13:39:46] [INFO ] After 386ms 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 13:39:46] [INFO ] After 816ms 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 13:39:46] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:39:46] [INFO ] Invariant cache hit.
[2023-03-15 13:39:47] [INFO ] Implicit Places using invariants in 492 ms returned []
[2023-03-15 13:39:47] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:39:47] [INFO ] Invariant cache hit.
[2023-03-15 13:39:47] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:39:48] [INFO ] Implicit Places using invariants and state equation in 1498 ms returned []
Implicit Place search using SMT with State Equation took 1991 ms to find 0 implicit places.
[2023-03-15 13:39:48] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 13:39:48] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:39:48] [INFO ] Invariant cache hit.
[2023-03-15 13:39:49] [INFO ] Dead Transitions using invariants and state equation in 769 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2785 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 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 13:39:49] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:39:49] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:39:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 13:39:49] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:49] [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 13:39:49] [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 951328 steps, run timeout after 3001 ms. (steps per millisecond=317 ) properties seen :{}
Probabilistic random walk after 951328 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 13:39:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:39:52] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 13:39:52] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:39:52] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:39:52] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:52] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:39:53] [INFO ] After 63ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:53] [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 30 ms.
[2023-03-15 13:39:53] [INFO ] After 417ms 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.
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 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 847742 steps, run timeout after 3001 ms. (steps per millisecond=282 ) properties seen :{}
Probabilistic random walk after 847742 steps, saw 123190 distinct states, run finished after 3001 ms. (steps per millisecond=282 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:39:56] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:39:56] [INFO ] Invariant cache hit.
[2023-03-15 13:39:56] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:39:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:39:56] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:56] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:39:56] [INFO ] After 48ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:56] [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 25 ms.
[2023-03-15 13:39:56] [INFO ] After 393ms 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 13 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 13:39:56] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:39:56] [INFO ] Invariant cache hit.
[2023-03-15 13:39:57] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-15 13:39:57] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:39:57] [INFO ] Invariant cache hit.
[2023-03-15 13:39:57] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:39:58] [INFO ] Implicit Places using invariants and state equation in 1392 ms returned []
Implicit Place search using SMT with State Equation took 1826 ms to find 0 implicit places.
[2023-03-15 13:39:58] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-15 13:39:58] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:39:58] [INFO ] Invariant cache hit.
[2023-03-15 13:39:59] [INFO ] Dead Transitions using invariants and state equation in 757 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2610 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 9 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 13:39:59] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:39:59] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:39:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:39:59] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:39:59] [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 13:39:59] [INFO ] After 30ms 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 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 940009 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :{}
Probabilistic random walk after 940009 steps, saw 137601 distinct states, run finished after 3001 ms. (steps per millisecond=313 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:40:02] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:40:02] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 13:40:02] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:40:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:40:02] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:40:02] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:40:02] [INFO ] After 41ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:40:02] [INFO ] After 75ms 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 13:40:02] [INFO ] After 354ms 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.
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 944006 steps, run timeout after 3001 ms. (steps per millisecond=314 ) properties seen :{}
Probabilistic random walk after 944006 steps, saw 138224 distinct states, run finished after 3001 ms. (steps per millisecond=314 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:40:05] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:40:05] [INFO ] Invariant cache hit.
[2023-03-15 13:40:05] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:40:05] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 13:40:06] [INFO ] After 275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:40:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:40:06] [INFO ] After 63ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:40:06] [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 13:40:06] [INFO ] After 519ms 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 13:40:06] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:40:06] [INFO ] Invariant cache hit.
[2023-03-15 13:40:06] [INFO ] Implicit Places using invariants in 486 ms returned []
[2023-03-15 13:40:06] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:40:06] [INFO ] Invariant cache hit.
[2023-03-15 13:40:07] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:40:08] [INFO ] Implicit Places using invariants and state equation in 1446 ms returned []
Implicit Place search using SMT with State Equation took 1934 ms to find 0 implicit places.
[2023-03-15 13:40:08] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-15 13:40:08] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:40:08] [INFO ] Invariant cache hit.
[2023-03-15 13:40:09] [INFO ] Dead Transitions using invariants and state equation in 677 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2637 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 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 13:40:09] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-15 13:40:09] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:40:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:40:09] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:40: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 2 ms.
[2023-03-15 13:40:09] [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 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
Interrupted probabilistic random walk after 911841 steps, run timeout after 3001 ms. (steps per millisecond=303 ) properties seen :{}
Probabilistic random walk after 911841 steps, saw 133375 distinct states, run finished after 3004 ms. (steps per millisecond=303 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:40:12] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:40:12] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-15 13:40:12] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:40:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:40:12] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:40:12] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:40:12] [INFO ] After 60ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:40:12] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-15 13:40:12] [INFO ] After 451ms 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.
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 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 901600 steps, run timeout after 3001 ms. (steps per millisecond=300 ) properties seen :{}
Probabilistic random walk after 901600 steps, saw 131873 distinct states, run finished after 3001 ms. (steps per millisecond=300 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:40:15] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:40:15] [INFO ] Invariant cache hit.
[2023-03-15 13:40:15] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:40:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-15 13:40:16] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:40:16] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:40:16] [INFO ] After 55ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:40:16] [INFO ] After 105ms 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 13:40:16] [INFO ] After 502ms 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 13:40:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:40:16] [INFO ] Invariant cache hit.
[2023-03-15 13:40:16] [INFO ] Implicit Places using invariants in 484 ms returned []
[2023-03-15 13:40:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:40:16] [INFO ] Invariant cache hit.
[2023-03-15 13:40:17] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:40:18] [INFO ] Implicit Places using invariants and state equation in 1358 ms returned []
Implicit Place search using SMT with State Equation took 1844 ms to find 0 implicit places.
[2023-03-15 13:40:18] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 13:40:18] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:40:18] [INFO ] Invariant cache hit.
[2023-03-15 13:40:18] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2544 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 1 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 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 13:40:18] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:40:18] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:40:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:40:18] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:40:18] [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 2 ms.
[2023-03-15 13:40:18] [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 36 ms. (steps per millisecond=277 ) 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 904260 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :{}
Probabilistic random walk after 904260 steps, saw 132303 distinct states, run finished after 3003 ms. (steps per millisecond=301 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:40:22] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:40:22] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-15 13:40:22] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:40:22] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:40:22] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:40:22] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:40:22] [INFO ] After 45ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:40:22] [INFO ] After 80ms 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 13:40:22] [INFO ] After 366ms 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.
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
Interrupted probabilistic random walk after 838418 steps, run timeout after 3001 ms. (steps per millisecond=279 ) properties seen :{}
Probabilistic random walk after 838418 steps, saw 122777 distinct states, run finished after 3001 ms. (steps per millisecond=279 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:40:25] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:40:25] [INFO ] Invariant cache hit.
[2023-03-15 13:40:25] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:40:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:40:25] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:40:25] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:40:25] [INFO ] After 40ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:40:25] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-15 13:40:25] [INFO ] After 364ms 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.
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 13:40:25] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:40:25] [INFO ] Invariant cache hit.
[2023-03-15 13:40:26] [INFO ] Implicit Places using invariants in 447 ms returned []
[2023-03-15 13:40:26] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:40:26] [INFO ] Invariant cache hit.
[2023-03-15 13:40:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:40:27] [INFO ] Implicit Places using invariants and state equation in 1483 ms returned []
Implicit Place search using SMT with State Equation took 1931 ms to find 0 implicit places.
[2023-03-15 13:40:27] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-15 13:40:27] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:40:27] [INFO ] Invariant cache hit.
[2023-03-15 13:40:28] [INFO ] Dead Transitions using invariants and state equation in 804 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 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 1 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 9 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 13:40:28] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-15 13:40:28] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:40:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:40:28] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:40:28] [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 13:40:28] [INFO ] After 34ms 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 33 ms. (steps per millisecond=303 ) 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 939113 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :{}
Probabilistic random walk after 939113 steps, saw 137479 distinct states, run finished after 3001 ms. (steps per millisecond=312 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:40:31] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:40:31] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 13:40:31] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:40:32] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 13:40:32] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:40:32] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:40:32] [INFO ] After 70ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:40:32] [INFO ] After 124ms 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 13:40:32] [INFO ] After 549ms 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.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 903091 steps, run timeout after 3001 ms. (steps per millisecond=300 ) properties seen :{}
Probabilistic random walk after 903091 steps, saw 132059 distinct states, run finished after 3001 ms. (steps per millisecond=300 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:40:35] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:40:35] [INFO ] Invariant cache hit.
[2023-03-15 13:40:35] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:40:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:40:35] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:40:35] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:40:35] [INFO ] After 39ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:40:36] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2023-03-15 13:40:36] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 1 ms to minimize.
[2023-03-15 13:40:36] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 1 ms to minimize.
[2023-03-15 13:40:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 740 ms
[2023-03-15 13:40:36] [INFO ] After 806ms 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 13:40:36] [INFO ] After 1082ms 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 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 13:40:36] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:40:36] [INFO ] Invariant cache hit.
[2023-03-15 13:40:37] [INFO ] Implicit Places using invariants in 506 ms returned []
[2023-03-15 13:40:37] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:40:37] [INFO ] Invariant cache hit.
[2023-03-15 13:40:37] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:40:38] [INFO ] Implicit Places using invariants and state equation in 1450 ms returned []
Implicit Place search using SMT with State Equation took 1958 ms to find 0 implicit places.
[2023-03-15 13:40:38] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 13:40:38] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:40:38] [INFO ] Invariant cache hit.
[2023-03-15 13:40:39] [INFO ] Dead Transitions using invariants and state equation in 802 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2787 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.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 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 13:40:39] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:40:39] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:40:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:40:39] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:40:39] [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 2 ms.
[2023-03-15 13:40:39] [INFO ] After 26ms 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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1014167 steps, run timeout after 3001 ms. (steps per millisecond=337 ) properties seen :{}
Probabilistic random walk after 1014167 steps, saw 148277 distinct states, run finished after 3001 ms. (steps per millisecond=337 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:40:42] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:40:42] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 13:40:42] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:40:42] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-15 13:40:42] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:40:42] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:40:42] [INFO ] After 39ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:40:43] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 0 ms to minimize.
[2023-03-15 13:40:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2023-03-15 13:40:43] [INFO ] After 306ms 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 13:40:43] [INFO ] After 592ms 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 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 36 ms. (steps per millisecond=277 ) 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 904162 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :{}
Probabilistic random walk after 904162 steps, saw 132263 distinct states, run finished after 3001 ms. (steps per millisecond=301 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:40:46] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:40:46] [INFO ] Invariant cache hit.
[2023-03-15 13:40:46] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:40:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 13:40:46] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:40:46] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:40:46] [INFO ] After 59ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:40:47] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 1 ms to minimize.
[2023-03-15 13:40:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2023-03-15 13:40:47] [INFO ] After 339ms 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 13:40:47] [INFO ] After 771ms 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.
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 13:40:47] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:40:47] [INFO ] Invariant cache hit.
[2023-03-15 13:40:47] [INFO ] Implicit Places using invariants in 495 ms returned []
[2023-03-15 13:40:47] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:40:47] [INFO ] Invariant cache hit.
[2023-03-15 13:40:48] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:40:49] [INFO ] Implicit Places using invariants and state equation in 1449 ms returned []
Implicit Place search using SMT with State Equation took 1946 ms to find 0 implicit places.
[2023-03-15 13:40:49] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-15 13:40:49] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:40:49] [INFO ] Invariant cache hit.
[2023-03-15 13:40:49] [INFO ] Dead Transitions using invariants and state equation in 776 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2748 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 17 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 13:40:49] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:40:49] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:40:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:40:50] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:40:50] [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 13:40:50] [INFO ] After 29ms 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 34 ms. (steps per millisecond=294 ) 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 930412 steps, run timeout after 3001 ms. (steps per millisecond=310 ) properties seen :{}
Probabilistic random walk after 930412 steps, saw 136328 distinct states, run finished after 3001 ms. (steps per millisecond=310 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:40:53] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:40:53] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-15 13:40:53] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:40:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:40:53] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:40:53] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:40:53] [INFO ] After 38ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:40:53] [INFO ] After 71ms 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 13:40:53] [INFO ] After 356ms 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 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.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 923594 steps, run timeout after 3001 ms. (steps per millisecond=307 ) properties seen :{}
Probabilistic random walk after 923594 steps, saw 134629 distinct states, run finished after 3001 ms. (steps per millisecond=307 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:40:56] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:40:56] [INFO ] Invariant cache hit.
[2023-03-15 13:40:56] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393232 kB
MemFree: 14885732 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16121820 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="lolaxred"
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 lolaxred"
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 r277-smll-167863548900394"
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 ;