About the Execution of ITS-Tools for Peterson-PT-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1280.991 | 1800000.00 | 2491154.00 | 6085.30 | [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/mcc2022-input.r175-tall-165277023900049.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r175-tall-165277023900049
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 135K Apr 30 09:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 571K Apr 30 09:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 82K Apr 30 09:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 372K Apr 30 09:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 68K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 200K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 41K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 140K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 34K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 535K May 10 09:34 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 1652804787155
Running Version 202205111006
[2022-05-17 16:26:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-17 16:26:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 16:26:28] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2022-05-17 16:26:28] [INFO ] Transformed 834 places.
[2022-05-17 16:26:28] [INFO ] Transformed 1242 transitions.
[2022-05-17 16:26:28] [INFO ] Found NUPN structural information;
[2022-05-17 16:26:28] [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]
[2022-05-17 16:26:28] [INFO ] Parsed PT model containing 834 places and 1242 transitions in 239 ms.
Built sparse matrix representations for Structural reductions in 15 ms.11040KB memory used
Starting structural reductions in DEADLOCKS 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 57 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 834/834 places, 1242/1242 transitions.
Starting structural reductions in DEADLOCKS 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 37 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 16:26:28] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 16:26:29] [INFO ] Computed 23 place invariants in 46 ms
[2022-05-17 16:26:29] [INFO ] Implicit Places using invariants in 802 ms returned []
[2022-05-17 16:26:29] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 16:26:29] [INFO ] Computed 23 place invariants in 12 ms
[2022-05-17 16:26:30] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:26:30] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 1365 ms to find 0 implicit places.
[2022-05-17 16:26:30] [INFO ] Redundant transitions in 80 ms returned []
[2022-05-17 16:26:30] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 16:26:30] [INFO ] Computed 23 place invariants in 12 ms
[2022-05-17 16:26:30] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 834/834 places, 1242/1242 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1978 ms (no deadlock found). (steps per millisecond=631 )
Random directed walk for 1250005 steps, including 0 resets, run took 2495 ms (no deadlock found). (steps per millisecond=501 )
[2022-05-17 16:26:35] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 16:26:35] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-17 16:26:35] [INFO ] [Real]Absence check using 17 positive place invariants in 21 ms returned sat
[2022-05-17 16:26:35] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 26 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 85 ms. Remains 264 /834 variables (removed 570) and now considering 672/1242 (removed 570) transitions.
[2022-05-17 16:26:35] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 264 cols
[2022-05-17 16:26:35] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 16:26:36] [INFO ] Implicit Places using invariants in 181 ms returned [228, 240, 241, 242, 243, 244]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 185 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 13 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 2 iterations. 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 809 ms. (steps per millisecond=12 ) properties (out of 666) seen :296
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 370) 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 370) 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 370) 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 369) 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 367) 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 367) 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 366) seen :2
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 364) 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 364) 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 364) 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 363) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 363) 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 363) seen :2
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 361) 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 361) 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 361) 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 361) 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 361) 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 361) 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 361) 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 361) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 361) seen :2
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 359) 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 359) 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 359) 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 359) 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 359) 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 359) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 359) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 359) 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 359) 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 359) 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 359) 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 359) 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 359) 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 359) 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 359) 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 359) 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 359) 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 359) 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 358) 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 358) 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 358) 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 358) 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 358) 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 358) 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 358) 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 358) 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 357) 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 357) 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 357) 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 357) 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 357) 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 356) 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 356) 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 356) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 355) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 355) 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 355) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) 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 354) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=8 ) properties (out of 354) 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 354) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 354) 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 354) 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 354) 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 354) seen :0
Running SMT prover for 354 properties.
[2022-05-17 16:26:37] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:26:37] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:26:38] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2022-05-17 16:26:47] [INFO ] After 10094ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:354
[2022-05-17 16:26:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:26:55] [INFO ] After 5475ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :354
[2022-05-17 16:26:55] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:27:01] [INFO ] After 6278ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :354
[2022-05-17 16:27:02] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 4 ms to minimize.
[2022-05-17 16:27:02] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:27:02] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:27:02] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:27:02] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:27:02] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:27:02] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:27:02] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:27:02] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:27:02] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:27:03] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:27:03] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1211 ms
[2022-05-17 16:27:03] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:27:03] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:27:03] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:27:03] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:27:03] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:27:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 562 ms
[2022-05-17 16:27:03] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:27:03] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:27:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 232 ms
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:27:05] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:27:05] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:27:05] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2022-05-17 16:27:05] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2022-05-17 16:27:05] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2022-05-17 16:27:05] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:27:05] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:27:05] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:27:05] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:27:05] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:27:05] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 2598 ms
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:27:07] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:27:07] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2022-05-17 16:27:07] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:27:07] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:27:07] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2022-05-17 16:27:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 769 ms
[2022-05-17 16:27:07] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:27:07] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:27:07] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 2 ms to minimize.
[2022-05-17 16:27:07] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:27:07] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 854 ms
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 2 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 3 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1228 ms
[2022-05-17 16:27:09] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:27:10] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:27:10] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2022-05-17 16:27:10] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:27:10] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2022-05-17 16:27:10] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:27:10] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2022-05-17 16:27:10] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2022-05-17 16:27:10] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 0 ms to minimize.
[2022-05-17 16:27:10] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:27:10] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:27:10] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1171 ms
[2022-05-17 16:27:11] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:27:11] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:27:11] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:27:11] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:27:11] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2022-05-17 16:27:11] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 0 ms to minimize.
[2022-05-17 16:27:11] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2022-05-17 16:27:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 647 ms
[2022-05-17 16:27:11] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:27:11] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2022-05-17 16:27:11] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:27:12] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 0 ms to minimize.
[2022-05-17 16:27:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 346 ms
[2022-05-17 16:27:12] [INFO ] Deduced a trap composed of 2 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:27:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 16:27:12] [INFO ] After 25115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:354
Fused 354 Parikh solutions to 348 different solutions.
Parikh walk visited 15 properties in 5583 ms.
Support contains 216 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 681254 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=22 ) properties seen 50
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 289) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 281) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 264) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 252) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 240) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 238) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 233) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 232) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 232) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 232) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 232) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 231) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 231) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 231) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 227) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 227) 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 227) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 226) 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 226) 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 226) 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 226) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 225) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 225) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 225) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 225) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 225) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 225) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 225) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 225) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 223) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 223) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 223) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 223) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 222) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 222) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 220) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 220) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 220) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 220) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 219) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 219) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 219) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 219) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 219) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 216) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 216) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 216) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 214) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 213) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 211) 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 211) 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 211) 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 210) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 210) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 210) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 210) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 209) 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 209) 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 209) 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 209) 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 209) 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 209) 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 209) 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 209) 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 209) 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 209) 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 209) 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 209) 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 209) 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 209) 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 209) 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 209) 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 209) 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 209) 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 209) 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 209) 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 209) 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 209) 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 209) 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 209) 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 209) 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 209) 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 209) 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 209) 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 209) 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 209) 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 207) 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 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 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 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 54 ms. (steps per millisecond=185 ) 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 54 ms. (steps per millisecond=185 ) properties (out of 207) 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 207) 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 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 53 ms. (steps per millisecond=188 ) 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 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 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 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 55 ms. (steps per millisecond=181 ) properties (out of 207) 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 207) 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 207) 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 207) 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 207) 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 207) 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 207) 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 207) 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 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 54 ms. (steps per millisecond=185 ) properties (out of 207) 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 207) 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 207) 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 207) 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 207) 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 207) 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 207) 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 207) 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 207) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 206) 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 206) 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 206) 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 206) 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 206) 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 206) 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 206) seen :0
Running SMT prover for 206 properties.
[2022-05-17 16:27:57] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:27:57] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:27:58] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 16:28:02] [INFO ] After 3552ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9 real:197
[2022-05-17 16:28:02] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:28:03] [INFO ] After 213ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:206
[2022-05-17 16:28:03] [INFO ] After 5504ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:206
[2022-05-17 16:28:04] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:28:07] [INFO ] After 3054ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :206
[2022-05-17 16:28:11] [INFO ] After 3447ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :206
[2022-05-17 16:28:11] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:28:11] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:28:11] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:28:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 309 ms
[2022-05-17 16:28:11] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:28:12] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:28:12] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:28:12] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:28:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 429 ms
[2022-05-17 16:28:12] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:28:12] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:28:12] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:28:12] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:28:12] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:28:12] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:28:12] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:28:13] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:28:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 791 ms
[2022-05-17 16:28:13] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:28:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2022-05-17 16:28:13] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:28:13] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:28:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2022-05-17 16:28:13] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:28:13] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:28:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 194 ms
[2022-05-17 16:28:13] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:28:13] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:28:13] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:28:14] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:28:14] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:28:14] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:28:14] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:28:14] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:28:14] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:28:14] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:28:14] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:28:14] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1038 ms
[2022-05-17 16:28:14] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:28:14] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:28:15] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:28:15] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:28:15] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:28:15] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:28:15] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:28:15] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:28:15] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:28:15] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:28:15] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:28:15] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:28:16] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:28:16] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:28:16] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:28:16] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:28:16] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:28:16] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2022-05-17 16:28:16] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:28:16] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:28:16] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1857 ms
[2022-05-17 16:28:16] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:28:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-17 16:28:16] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:28:17] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:28:17] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:28:17] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:28:17] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:28:17] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:28:17] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:28:17] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 0 ms to minimize.
[2022-05-17 16:28:17] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2022-05-17 16:28:17] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:28:17] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:28:17] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:28:18] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:28:18] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:28:18] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:28:18] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:28:18] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:28:18] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:28:18] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:28:18] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:28:18] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:28:18] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2112 ms
[2022-05-17 16:28:19] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:28:19] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:28:19] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:28:19] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2022-05-17 16:28:19] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:28:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 413 ms
[2022-05-17 16:28:19] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:28:19] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:28:19] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:28:19] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:28:19] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:28:19] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:28:20] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:28:20] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2022-05-17 16:28:20] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2022-05-17 16:28:20] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 0 ms to minimize.
[2022-05-17 16:28:20] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2022-05-17 16:28:20] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:28:20] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:28:20] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:28:20] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:28:20] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:28:20] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:28:21] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:28:21] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 0 ms to minimize.
[2022-05-17 16:28:21] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:28:21] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:28:21] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1929 ms
[2022-05-17 16:28:21] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:28:21] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:28:21] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:28:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 314 ms
[2022-05-17 16:28:21] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:28:21] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2022-05-17 16:28:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2022-05-17 16:28:22] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:28:22] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:28:22] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2022-05-17 16:28:22] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2022-05-17 16:28:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 385 ms
[2022-05-17 16:28:22] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:28:22] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:28:22] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:28:22] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:28:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 408 ms
[2022-05-17 16:28:22] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2022-05-17 16:28:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2022-05-17 16:28:23] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:28:23] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:28:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 197 ms
[2022-05-17 16:28:23] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:28:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2022-05-17 16:28:23] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:28:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2022-05-17 16:28:23] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:28:24] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:28:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 217 ms
[2022-05-17 16:28:24] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:28:24] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:28:24] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:28:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 338 ms
[2022-05-17 16:28:24] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2022-05-17 16:28:24] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:28:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2022-05-17 16:28:25] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:28:25] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:28:25] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:28:25] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:28:25] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:28:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 499 ms
[2022-05-17 16:28:25] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:28:25] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:28:25] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:28:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 292 ms
[2022-05-17 16:28:26] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:28:26] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:28:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 223 ms
[2022-05-17 16:28:26] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:28:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2022-05-17 16:28:26] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:28:26] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:28:26] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:28:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 344 ms
[2022-05-17 16:28:26] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:28:26] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:28:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 232 ms
[2022-05-17 16:28:27] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:28:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-17 16:28:27] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2022-05-17 16:28:27] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:28:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 241 ms
[2022-05-17 16:28:27] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2022-05-17 16:28:27] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:28:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2022-05-17 16:28:27] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:28:27] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:28:28] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:28:28] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 0 ms to minimize.
[2022-05-17 16:28:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 333 ms
[2022-05-17 16:28:28] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:28:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2022-05-17 16:28:28] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2022-05-17 16:28:28] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:28:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 304 ms
[2022-05-17 16:28:28] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:28:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-17 16:28:29] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:28:29] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 0 ms to minimize.
[2022-05-17 16:28:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 169 ms
[2022-05-17 16:28:29] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:28:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2022-05-17 16:28:30] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:28:30] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:28:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 211 ms
[2022-05-17 16:28:30] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:28:30] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:28:30] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:28:30] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:28:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 436 ms
[2022-05-17 16:28:30] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:28:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2022-05-17 16:28:31] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:28:31] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2022-05-17 16:28:31] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:28:31] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2022-05-17 16:28:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 319 ms
[2022-05-17 16:28:31] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:28:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2022-05-17 16:28:31] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:28:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2022-05-17 16:28:32] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:28:32] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:28:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 228 ms
[2022-05-17 16:28:32] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:28:32] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:28:32] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:28:33] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:28:33] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:28:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 490 ms
[2022-05-17 16:28:33] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:28:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-05-17 16:28:33] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:28:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-05-17 16:28:33] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:28:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2022-05-17 16:28:34] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:28:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2022-05-17 16:28:34] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:28:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2022-05-17 16:28:34] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:28:35] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:28:35] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:28:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 335 ms
[2022-05-17 16:28:35] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:28:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-05-17 16:28:35] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:28:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-05-17 16:28:36] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:28:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2022-05-17 16:28:37] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:28:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2022-05-17 16:28:37] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:28:37] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:28:37] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:28:37] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:28:37] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:28:38] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:28:38] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:28:38] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 734 ms
[2022-05-17 16:28:38] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:28:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2022-05-17 16:28:38] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:28:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-05-17 16:28:38] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:28:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2022-05-17 16:28:39] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:28:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-05-17 16:28:39] [INFO ] After 31755ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :206
Attempting to minimize the solution found.
Minimization took 8991 ms.
[2022-05-17 16:28:48] [INFO ] After 45479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :206
Parikh walk visited 2 properties in 990 ms.
Support contains 164 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 773310 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=25 ) properties 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 204) 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 204) 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 204) 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 204) 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 204) 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 204) 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 204) 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 204) 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 204) 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 204) 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 204) 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 204) 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 204) seen :1
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 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 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 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 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 :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 202) 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 202) 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 202) 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 202) 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 202) 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 202) 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 202) 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 202) 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 202) 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 202) 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 202) 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 202) 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 202) 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 202) 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 202) seen :1
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 59 ms. (steps per millisecond=169 ) properties (out of 201) 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 201) 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 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 201) 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 201) 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 201) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 199) 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 199) 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 199) 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 199) 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 199) 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 199) 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 199) 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 199) 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 199) 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 199) 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 199) 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 199) 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 199) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 199) 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 199) 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 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 57 ms. (steps per millisecond=175 ) properties (out of 199) 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 199) 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 199) 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 199) 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 199) 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 199) 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 199) 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 199) 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 199) 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 199) 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 199) 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 199) 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 199) 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 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 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 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 61 ms. (steps per millisecond=163 ) properties (out of 199) 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 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 61 ms. (steps per millisecond=163 ) properties (out of 199) 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 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 60 ms. (steps per millisecond=166 ) properties (out of 199) 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 199) 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 199) 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 199) 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 199) 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 199) 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 199) 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 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
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 75240 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 199 properties.
[2022-05-17 16:30:40] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:30:40] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:30:41] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2022-05-17 16:30:45] [INFO ] After 3394ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9 real:190
[2022-05-17 16:30:45] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:30:45] [INFO ] After 197ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:199
[2022-05-17 16:30:45] [INFO ] After 5281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:199
[2022-05-17 16:30:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 16:30:50] [INFO ] After 2919ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :199
[2022-05-17 16:30:53] [INFO ] After 3318ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :199
[2022-05-17 16:30:53] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:30:53] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:30:53] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:30:53] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:30:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 408 ms
[2022-05-17 16:30:54] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:30:54] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:30:54] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:30:54] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:30:54] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:30:54] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:30:54] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:30:54] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:30:55] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:30:55] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:30:55] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:30:55] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:30:55] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:30:55] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:30:55] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:30:55] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:30:55] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:30:55] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:30:55] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:30:56] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:30:56] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:30:56] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:30:56] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:30:56] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:30:56] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:30:56] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:30:56] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:30:56] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:30:56] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:30:57] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:30:57] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 2892 ms
[2022-05-17 16:30:57] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:30:57] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:30:57] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:30:57] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:30:57] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:30:57] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:30:57] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:30:57] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:30:57] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 697 ms
[2022-05-17 16:30:57] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:30:58] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:30:58] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:30:58] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:30:58] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:30:58] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:30:58] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:30:58] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:30:58] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:30:58] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:30:58] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:30:58] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1099 ms
[2022-05-17 16:30:59] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:30:59] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:30:59] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:30:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 284 ms
[2022-05-17 16:30:59] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:30:59] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:30:59] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:30:59] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:30:59] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:30:59] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:30:59] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:31:00] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:31:00] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:31:00] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:31:00] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:31:00] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:31:00] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1105 ms
[2022-05-17 16:31:00] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:31:00] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 0 ms to minimize.
[2022-05-17 16:31:00] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:31:00] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:31:00] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:31:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 529 ms
[2022-05-17 16:31:01] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:31:01] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:31:01] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:31:01] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2022-05-17 16:31:01] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2022-05-17 16:31:01] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2022-05-17 16:31:01] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:31:01] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2022-05-17 16:31:01] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:31:01] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:31:01] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:31:01] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:31:02] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:31:02] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2022-05-17 16:31:02] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:31:02] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1256 ms
[2022-05-17 16:31:02] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:31:02] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:31:02] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:31:02] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:31:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 439 ms
[2022-05-17 16:31:02] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:31:02] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:31:02] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:31:03] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:31:03] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:31:03] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2022-05-17 16:31:03] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2022-05-17 16:31:03] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:31:03] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:31:03] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:31:03] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:31:03] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2022-05-17 16:31:03] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:31:03] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:31:03] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2022-05-17 16:31:04] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:31:04] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:31:04] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:31:04] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2022-05-17 16:31:04] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1623 ms
[2022-05-17 16:31:04] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:31:04] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:31:04] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:31:04] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:31:04] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:31:04] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 0 ms to minimize.
[2022-05-17 16:31:04] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:31:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 610 ms
[2022-05-17 16:31:05] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2022-05-17 16:31:05] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2022-05-17 16:31:05] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2022-05-17 16:31:05] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2022-05-17 16:31:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 366 ms
[2022-05-17 16:31:05] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:31:05] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2022-05-17 16:31:05] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2022-05-17 16:31:05] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2022-05-17 16:31:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 348 ms
[2022-05-17 16:31:05] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2022-05-17 16:31:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2022-05-17 16:31:06] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:31:06] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:31:06] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:31:06] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:31:06] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:31:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 538 ms
[2022-05-17 16:31:06] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2022-05-17 16:31:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2022-05-17 16:31:06] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:31:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2022-05-17 16:31:06] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:31:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2022-05-17 16:31:07] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:31:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2022-05-17 16:31:07] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 0 ms to minimize.
[2022-05-17 16:31:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2022-05-17 16:31:07] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:31:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2022-05-17 16:31:07] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:31:07] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:31:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2022-05-17 16:31:08] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:31:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2022-05-17 16:31:08] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:31:08] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:31:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 185 ms
[2022-05-17 16:31:08] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:31:08] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:31:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2022-05-17 16:31:08] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:31:08] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:31:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 189 ms
[2022-05-17 16:31:09] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:31:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-17 16:31:09] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:31:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2022-05-17 16:31:09] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:31:09] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:31:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2022-05-17 16:31:09] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:31:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2022-05-17 16:31:09] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:31:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2022-05-17 16:31:09] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:31:10] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:31:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2022-05-17 16:31:10] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:31:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2022-05-17 16:31:10] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:31:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2022-05-17 16:31:11] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:31:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2022-05-17 16:31:11] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:31:11] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:31:11] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:31:11] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 0 ms to minimize.
[2022-05-17 16:31:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 371 ms
[2022-05-17 16:31:12] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:31:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2022-05-17 16:31:12] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:31:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2022-05-17 16:31:12] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2022-05-17 16:31:13] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:31:13] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:31:13] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:31:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 407 ms
[2022-05-17 16:31:13] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:31:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2022-05-17 16:31:14] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:31:14] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:31:14] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:31:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 319 ms
[2022-05-17 16:31:14] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:31:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-05-17 16:31:15] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:31:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2022-05-17 16:31:15] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:31:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-17 16:31:16] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:31:16] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2022-05-17 16:31:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 171 ms
[2022-05-17 16:31:16] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2022-05-17 16:31:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2022-05-17 16:31:16] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:31:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2022-05-17 16:31:17] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:31:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-17 16:31:18] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:31:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2022-05-17 16:31:18] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:31:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2022-05-17 16:31:19] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:31:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-05-17 16:31:19] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:31:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2022-05-17 16:31:19] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:31:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2022-05-17 16:31:19] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:31:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2022-05-17 16:31:19] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:31:20] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:31:20] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:31:20] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:31:20] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:31:20] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:31:20] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:31:20] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:31:20] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:31:20] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:31:20] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 1 ms to minimize.
[2022-05-17 16:31:21] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:31:21] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:31:21] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:31:21] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:31:21] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1550 ms
[2022-05-17 16:31:21] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:31:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2022-05-17 16:31:21] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:31:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2022-05-17 16:31:22] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:31:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2022-05-17 16:31:22] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:31:22] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:31:22] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:31:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 288 ms
[2022-05-17 16:31:23] [INFO ] After 33411ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :199
Attempting to minimize the solution found.
Minimization took 9189 ms.
[2022-05-17 16:31:32] [INFO ] After 47092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :199
Parikh walk visited 0 properties in 2111 ms.
Support contains 161 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 788462 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=26 ) properties 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 199) 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 199) 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 199) 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 199) 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 199) 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 199) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 198) 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 198) 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 198) 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 198) 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 198) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 196) 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 196) 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 196) 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 196) 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 196) 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 196) 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 196) 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 196) 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 196) 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 196) 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 196) 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 196) 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 196) 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 196) 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 196) 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 196) 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 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 196) 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 196) 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 196) 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 196) 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 196) 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 196) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 195) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) 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 195) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 72935 ms. (steps per millisecond=137 ) properties seen :0
Running SMT prover for 195 properties.
[2022-05-17 16:33:22] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:33:22] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:33:23] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 16:33:27] [INFO ] After 3575ms SMT Verify possible using state equation in real domain returned unsat :0 sat :14 real:181
[2022-05-17 16:33:27] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:33:28] [INFO ] After 346ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:195
[2022-05-17 16:33:28] [INFO ] After 5597ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:195
[2022-05-17 16:33:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:33:32] [INFO ] After 3046ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :195
[2022-05-17 16:33:36] [INFO ] After 3628ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :195
[2022-05-17 16:33:36] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:33:36] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:33:36] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2022-05-17 16:33:37] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:33:37] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:33:37] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:33:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 679 ms
[2022-05-17 16:33:37] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:33:37] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:33:37] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:33:37] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:33:37] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:33:38] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:33:38] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:33:38] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:33:38] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:33:38] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:33:38] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:33:38] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:33:38] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:33:38] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:33:38] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:33:39] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:33:39] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:33:39] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:33:39] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:33:39] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2016 ms
[2022-05-17 16:33:39] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:33:39] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:33:39] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:33:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 293 ms
[2022-05-17 16:33:39] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:33:39] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:33:40] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:33:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 308 ms
[2022-05-17 16:33:40] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:33:40] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2022-05-17 16:33:40] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:33:40] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:33:40] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:33:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 444 ms
[2022-05-17 16:33:40] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:33:40] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:33:40] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:33:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 311 ms
[2022-05-17 16:33:41] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:33:41] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:33:41] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:33:41] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:33:41] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:33:41] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:33:41] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:33:41] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:33:41] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:33:42] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:33:42] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:33:42] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:33:42] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:33:42] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:33:42] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:33:42] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:33:42] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1654 ms
[2022-05-17 16:33:42] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:33:42] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:33:42] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:33:42] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2022-05-17 16:33:43] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 0 ms to minimize.
[2022-05-17 16:33:43] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 0 ms to minimize.
[2022-05-17 16:33:43] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 0 ms to minimize.
[2022-05-17 16:33:43] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 614 ms
[2022-05-17 16:33:43] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:33:43] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:33:43] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:33:43] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:33:43] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:33:43] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:33:43] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2022-05-17 16:33:43] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:33:44] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:33:44] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:33:44] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:33:44] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 975 ms
[2022-05-17 16:33:44] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:33:44] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:33:44] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:33:44] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2022-05-17 16:33:44] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
[2022-05-17 16:33:44] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:33:44] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:33:45] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2022-05-17 16:33:45] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 773 ms
[2022-05-17 16:33:45] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:33:45] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:33:45] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:33:45] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:33:45] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:33:45] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:33:45] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:33:45] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:33:46] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:33:46] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:33:46] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:33:46] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:33:46] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:33:46] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:33:46] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1452 ms
[2022-05-17 16:33:46] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2022-05-17 16:33:46] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:33:46] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:33:46] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:33:47] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:33:47] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:33:47] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:33:47] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:33:47] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:33:47] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 899 ms
[2022-05-17 16:33:47] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:33:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2022-05-17 16:33:47] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2022-05-17 16:33:47] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 0 ms to minimize.
[2022-05-17 16:33:47] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 0 ms to minimize.
[2022-05-17 16:33:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 240 ms
[2022-05-17 16:33:47] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:33:48] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:33:48] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:33:48] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:33:48] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:33:48] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:33:48] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:33:48] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:33:48] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:33:48] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:33:49] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:33:49] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1156 ms
[2022-05-17 16:33:49] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:33:49] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:33:49] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:33:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 350 ms
[2022-05-17 16:33:49] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:33:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2022-05-17 16:33:49] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:33:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2022-05-17 16:33:50] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:33:50] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:33:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2022-05-17 16:33:50] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:33:50] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:33:50] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:33:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 325 ms
[2022-05-17 16:33:50] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:33:51] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:33:51] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2022-05-17 16:33:51] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2022-05-17 16:33:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 308 ms
[2022-05-17 16:33:51] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:33:51] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:33:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 221 ms
[2022-05-17 16:33:51] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:33:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2022-05-17 16:33:51] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:33:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-05-17 16:33:52] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:33:52] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:33:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 224 ms
[2022-05-17 16:33:52] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:33:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2022-05-17 16:33:52] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:33:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2022-05-17 16:33:52] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:33:52] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:33:52] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:33:53] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:33:53] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:33:53] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:33:53] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:33:53] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:33:53] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:33:53] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2022-05-17 16:33:53] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 958 ms
[2022-05-17 16:33:53] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:33:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2022-05-17 16:33:53] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:33:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2022-05-17 16:33:54] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:33:54] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:33:54] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:33:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 291 ms
[2022-05-17 16:33:54] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:33:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2022-05-17 16:33:54] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:33:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2022-05-17 16:33:55] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:33:55] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:33:55] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:33:56] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:33:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 426 ms
[2022-05-17 16:33:56] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2022-05-17 16:33:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2022-05-17 16:33:56] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2022-05-17 16:33:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2022-05-17 16:33:57] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:33:57] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:33:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 211 ms
[2022-05-17 16:33:58] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:33:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2022-05-17 16:33:59] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:33:59] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:33:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 223 ms
[2022-05-17 16:33:59] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:34:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2022-05-17 16:34:00] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:34:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2022-05-17 16:34:00] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:34:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2022-05-17 16:34:00] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:34:00] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:34:00] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:34:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 325 ms
[2022-05-17 16:34:00] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:34:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2022-05-17 16:34:01] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:34:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2022-05-17 16:34:01] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:34:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-05-17 16:34:01] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:34:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2022-05-17 16:34:02] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:34:02] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:34:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 221 ms
[2022-05-17 16:34:02] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:34:02] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:34:03] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:34:03] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:34:03] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:34:03] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:34:03] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:34:03] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:34:03] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:34:03] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:34:03] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:34:03] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:34:03] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1257 ms
[2022-05-17 16:34:04] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:34:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2022-05-17 16:34:04] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:34:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2022-05-17 16:34:04] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:34:05] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:34:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
[2022-05-17 16:34:05] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2022-05-17 16:34:05] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 0 ms to minimize.
[2022-05-17 16:34:05] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:34:05] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:34:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 339 ms
[2022-05-17 16:34:06] [INFO ] After 33069ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :195
Attempting to minimize the solution found.
Minimization took 8427 ms.
[2022-05-17 16:34:14] [INFO ] After 46140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :195
Fused 195 Parikh solutions to 191 different solutions.
Parikh walk visited 1 properties in 1879 ms.
Support contains 158 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 802340 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=26 ) properties 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) 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 194) seen :1
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 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 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 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 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 58 ms. (steps per millisecond=172 ) 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 58 ms. (steps per millisecond=172 ) properties (out of 193) 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 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 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 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 57 ms. (steps per millisecond=175 ) properties (out of 193) 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 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 57 ms. (steps per millisecond=175 ) properties (out of 193) 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 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 81 ms. (steps per millisecond=123 ) properties (out of 193) 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 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 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 58 ms. (steps per millisecond=172 ) properties (out of 193) 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 193) 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 193) 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 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 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 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 57 ms. (steps per millisecond=175 ) properties (out of 193) 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 193) 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 193) 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 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 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 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 58 ms. (steps per millisecond=172 ) properties (out of 193) 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 59 ms. (steps per millisecond=169 ) properties (out of 193) 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 193) 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 193) 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 193) 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 193) 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 193) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 75898 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 193 properties.
[2022-05-17 16:36:07] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:36:07] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:36:07] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 16:36:12] [INFO ] After 3561ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:189
[2022-05-17 16:36:12] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:36:12] [INFO ] After 110ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:193
[2022-05-17 16:36:12] [INFO ] After 5317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:193
[2022-05-17 16:36:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:36:16] [INFO ] After 2966ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :193
[2022-05-17 16:36:20] [INFO ] After 3335ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :193
[2022-05-17 16:36:20] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:36:20] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:36:20] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:36:20] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:36:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 413 ms
[2022-05-17 16:36:20] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:36:21] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:36:21] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:36:21] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:36:21] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:36:21] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:36:21] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:36:21] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:36:21] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:36:21] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:36:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 903 ms
[2022-05-17 16:36:21] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:36:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-17 16:36:22] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:36:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2022-05-17 16:36:22] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:36:22] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:36:22] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:36:22] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:36:22] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:36:22] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:36:22] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:36:22] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:36:22] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:36:22] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:36:23] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:36:23] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:36:23] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:36:23] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2022-05-17 16:36:23] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:36:23] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:36:23] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1432 ms
[2022-05-17 16:36:23] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:36:23] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:36:23] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:36:23] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:36:23] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:36:24] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:36:24] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:36:24] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:36:24] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:36:24] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:36:24] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:36:24] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:36:24] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:36:24] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:36:24] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:36:25] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:36:25] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:36:25] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:36:25] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:36:25] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:36:25] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:36:25] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:36:25] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:36:25] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2200 ms
[2022-05-17 16:36:25] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2022-05-17 16:36:25] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:36:26] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:36:26] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:36:26] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:36:26] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:36:26] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:36:26] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:36:26] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:36:26] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:36:26] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 914 ms
[2022-05-17 16:36:26] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:36:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2022-05-17 16:36:26] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:36:27] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:36:27] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:36:27] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:36:27] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:36:27] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:36:27] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2022-05-17 16:36:27] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:36:27] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:36:27] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:36:28] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:36:28] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2022-05-17 16:36:28] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1272 ms
[2022-05-17 16:36:28] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:36:28] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:36:28] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:36:28] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:36:28] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:36:28] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:36:28] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:36:28] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:36:28] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:36:29] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:36:29] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:36:29] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1080 ms
[2022-05-17 16:36:29] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:36:29] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:36:29] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:36:29] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:36:29] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:36:29] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:36:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 502 ms
[2022-05-17 16:36:29] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:36:29] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:36:30] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:36:30] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:36:30] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:36:30] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:36:30] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:36:30] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:36:30] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2022-05-17 16:36:30] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:36:30] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 928 ms
[2022-05-17 16:36:30] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 0 ms to minimize.
[2022-05-17 16:36:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2022-05-17 16:36:30] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:36:31] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:36:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 202 ms
[2022-05-17 16:36:31] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:36:31] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:36:31] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:36:31] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:36:31] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:36:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 510 ms
[2022-05-17 16:36:31] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 0 ms to minimize.
[2022-05-17 16:36:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2022-05-17 16:36:31] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:36:32] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:36:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 212 ms
[2022-05-17 16:36:32] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:36:32] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:36:32] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:36:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 308 ms
[2022-05-17 16:36:32] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:36:32] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:36:32] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:36:32] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:36:33] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:36:33] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:36:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 594 ms
[2022-05-17 16:36:33] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:36:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-05-17 16:36:33] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2022-05-17 16:36:33] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2022-05-17 16:36:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 145 ms
[2022-05-17 16:36:33] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:36:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2022-05-17 16:36:33] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:36:33] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:36:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 230 ms
[2022-05-17 16:36:34] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:36:34] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:36:34] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:36:34] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:36:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 386 ms
[2022-05-17 16:36:34] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:36:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2022-05-17 16:36:34] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:36:34] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2022-05-17 16:36:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 166 ms
[2022-05-17 16:36:35] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:36:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2022-05-17 16:36:35] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:36:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2022-05-17 16:36:35] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:36:35] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:36:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 208 ms
[2022-05-17 16:36:35] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:36:36] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:36:36] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:36:36] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:36:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 407 ms
[2022-05-17 16:36:36] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:36:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2022-05-17 16:36:36] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:36:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-05-17 16:36:36] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:36:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-05-17 16:36:37] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:36:37] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:36:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 196 ms
[2022-05-17 16:36:37] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:36:37] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:36:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 193 ms
[2022-05-17 16:36:37] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:36:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2022-05-17 16:36:38] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:36:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2022-05-17 16:36:38] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:36:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2022-05-17 16:36:39] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:36:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2022-05-17 16:36:39] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:36:39] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:36:39] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:36:39] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:36:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 384 ms
[2022-05-17 16:36:39] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:36:39] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:36:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 199 ms
[2022-05-17 16:36:40] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2022-05-17 16:36:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2022-05-17 16:36:40] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:36:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2022-05-17 16:36:41] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:36:41] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:36:41] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:36:41] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:36:41] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:36:41] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:36:41] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:36:41] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:36:41] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:36:41] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 869 ms
[2022-05-17 16:36:42] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:36:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2022-05-17 16:36:42] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:36:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2022-05-17 16:36:43] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:36:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2022-05-17 16:36:43] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 3 ms to minimize.
[2022-05-17 16:36:43] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:36:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 213 ms
[2022-05-17 16:36:44] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:36:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2022-05-17 16:36:44] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:36:44] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:36:44] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:36:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 326 ms
[2022-05-17 16:36:45] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:36:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2022-05-17 16:36:45] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:36:45] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:36:45] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:36:45] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:36:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 360 ms
[2022-05-17 16:36:45] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:36:45] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:36:45] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:36:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 283 ms
[2022-05-17 16:36:45] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:36:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-05-17 16:36:46] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:36:46] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:36:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 228 ms
[2022-05-17 16:36:47] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:36:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2022-05-17 16:36:47] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:36:47] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:36:47] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:36:47] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:36:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 351 ms
[2022-05-17 16:36:48] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:36:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-17 16:36:48] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2022-05-17 16:36:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2022-05-17 16:36:49] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2022-05-17 16:36:49] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:36:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2022-05-17 16:36:49] [INFO ] After 32501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :193
Attempting to minimize the solution found.
Minimization took 9765 ms.
[2022-05-17 16:36:59] [INFO ] After 46819ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :193
Parikh walk visited 1 properties in 1532 ms.
Support contains 156 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 802147 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=26 ) properties 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 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 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 56 ms. (steps per millisecond=178 ) properties (out of 192) 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 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 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 56 ms. (steps per millisecond=178 ) properties (out of 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 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 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 57 ms. (steps per millisecond=175 ) properties (out of 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) 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 192) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 190) 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 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 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 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 56 ms. (steps per millisecond=178 ) 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 56 ms. (steps per millisecond=178 ) properties (out of 190) 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 190) 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 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 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 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 56 ms. (steps per millisecond=178 ) properties (out of 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 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 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 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 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 56 ms. (steps per millisecond=178 ) properties (out of 190) 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 190) 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 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 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 56 ms. (steps per millisecond=178 ) 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 56 ms. (steps per millisecond=178 ) 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 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 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 45 ms. (steps per millisecond=222 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 190) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 71931 ms. (steps per millisecond=139 ) properties seen :0
Running SMT prover for 190 properties.
[2022-05-17 16:38:47] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:38:47] [INFO ] Computed 17 place invariants in 5 ms
[2022-05-17 16:38:48] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:38:52] [INFO ] After 4955ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:190
[2022-05-17 16:38:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2022-05-17 16:38:56] [INFO ] After 2801ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :190
[2022-05-17 16:38:56] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:39:00] [INFO ] After 3183ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :190
[2022-05-17 16:39:00] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:39:00] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:39:00] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:39:00] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:39:00] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:39:00] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:39:00] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:39:00] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:39:00] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 802 ms
[2022-05-17 16:39:01] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:39:01] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:39:01] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:39:01] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:39:01] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:39:01] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:39:01] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:39:01] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:39:01] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:39:01] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:39:01] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1001 ms
[2022-05-17 16:39:02] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:39:02] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:39:02] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:39:02] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:39:02] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:39:02] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:39:02] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:39:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 643 ms
[2022-05-17 16:39:02] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:39:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2022-05-17 16:39:02] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:39:02] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:39:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
[2022-05-17 16:39:03] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:39:03] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:39:03] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2022-05-17 16:39:03] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:39:03] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:39:03] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:39:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 519 ms
[2022-05-17 16:39:03] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:39:03] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:39:03] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:39:03] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:39:04] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:39:04] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:39:04] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:39:04] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:39:04] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:39:04] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:39:04] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:39:04] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:39:04] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:39:04] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:39:04] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2022-05-17 16:39:05] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:39:05] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:39:05] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
[2022-05-17 16:39:05] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 0 ms to minimize.
[2022-05-17 16:39:05] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 0 ms to minimize.
[2022-05-17 16:39:05] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 0 ms to minimize.
[2022-05-17 16:39:05] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1795 ms
[2022-05-17 16:39:05] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 0 ms to minimize.
[2022-05-17 16:39:05] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:39:05] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:39:05] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:39:05] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:39:06] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:39:06] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:39:06] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:39:06] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:39:06] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:39:06] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1013 ms
[2022-05-17 16:39:06] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:39:06] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:39:06] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:39:06] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:39:06] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:39:06] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:39:07] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:39:07] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:39:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 769 ms
[2022-05-17 16:39:07] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:39:07] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:39:07] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:39:07] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:39:07] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:39:07] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:39:07] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:39:07] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:39:08] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:39:08] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:39:08] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:39:08] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:39:08] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:39:08] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:39:08] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:39:08] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:39:08] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1430 ms
[2022-05-17 16:39:08] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:39:08] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:39:08] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:39:08] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:39:09] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:39:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 434 ms
[2022-05-17 16:39:09] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2022-05-17 16:39:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2022-05-17 16:39:09] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2022-05-17 16:39:09] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:39:09] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:39:09] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:39:09] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:39:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 572 ms
[2022-05-17 16:39:09] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:39:09] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:39:10] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 0 ms to minimize.
[2022-05-17 16:39:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 236 ms
[2022-05-17 16:39:10] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2022-05-17 16:39:10] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:39:10] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:39:10] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:39:10] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:39:10] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:39:10] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2022-05-17 16:39:10] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 760 ms
[2022-05-17 16:39:10] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:39:11] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:39:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 228 ms
[2022-05-17 16:39:11] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:39:11] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2022-05-17 16:39:11] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:39:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 271 ms
[2022-05-17 16:39:11] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:39:11] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:39:11] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:39:11] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:39:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 368 ms
[2022-05-17 16:39:12] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:39:12] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:39:12] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:39:12] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2022-05-17 16:39:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 338 ms
[2022-05-17 16:39:12] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:39:12] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:39:12] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:39:12] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:39:12] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:39:12] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:39:13] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:39:13] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:39:13] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:39:13] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:39:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 981 ms
[2022-05-17 16:39:13] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:39:13] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:39:13] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:39:13] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:39:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 376 ms
[2022-05-17 16:39:13] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:39:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2022-05-17 16:39:14] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:39:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-17 16:39:14] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2022-05-17 16:39:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2022-05-17 16:39:14] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:39:14] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:39:14] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2022-05-17 16:39:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 268 ms
[2022-05-17 16:39:15] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:39:15] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:39:15] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:39:15] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:39:15] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:39:15] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:39:15] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:39:15] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:39:16] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:39:16] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 845 ms
[2022-05-17 16:39:16] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:39:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-05-17 16:39:16] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:39:16] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:39:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 190 ms
[2022-05-17 16:39:16] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 0 ms to minimize.
[2022-05-17 16:39:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2022-05-17 16:39:16] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2022-05-17 16:39:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2022-05-17 16:39:17] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:39:17] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:39:17] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:39:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 277 ms
[2022-05-17 16:39:17] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:39:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-05-17 16:39:18] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:39:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2022-05-17 16:39:18] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:39:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2022-05-17 16:39:19] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:39:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2022-05-17 16:39:19] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2022-05-17 16:39:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2022-05-17 16:39:19] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:39:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-17 16:39:19] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:39:19] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:39:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2022-05-17 16:39:19] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:39:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2022-05-17 16:39:20] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:39:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2022-05-17 16:39:21] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:39:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2022-05-17 16:39:21] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 0 ms to minimize.
[2022-05-17 16:39:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2022-05-17 16:39:22] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:39:22] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:39:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2022-05-17 16:39:22] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:39:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-17 16:39:23] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:39:23] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:39:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 212 ms
[2022-05-17 16:39:23] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:39:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-05-17 16:39:24] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:39:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2022-05-17 16:39:24] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:39:24] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:39:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2022-05-17 16:39:24] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:39:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2022-05-17 16:39:24] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:39:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2022-05-17 16:39:25] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:39:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2022-05-17 16:39:25] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:39:25] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:39:25] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:39:25] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:39:25] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:39:25] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:39:26] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:39:26] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:39:26] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:39:26] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:39:26] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:39:26] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:39:26] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:39:26] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1251 ms
[2022-05-17 16:39:26] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:39:26] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:39:26] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:39:27] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:39:27] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:39:27] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:39:27] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:39:27] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:39:27] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:39:27] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:39:27] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:39:27] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:39:27] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:39:27] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1223 ms
[2022-05-17 16:39:28] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:39:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2022-05-17 16:39:28] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:39:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2022-05-17 16:39:28] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:39:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2022-05-17 16:39:29] [INFO ] After 32471ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :190
Attempting to minimize the solution found.
Minimization took 8112 ms.
[2022-05-17 16:39:37] [INFO ] After 44929ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :190
Parikh walk visited 0 properties in 1795 ms.
Support contains 155 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 865724 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 62 ms. (steps per millisecond=161 ) properties (out of 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 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 62 ms. (steps per millisecond=161 ) properties (out of 190) 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 190) 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 190) 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 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 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 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 61 ms. (steps per millisecond=163 ) properties (out of 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 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 61 ms. (steps per millisecond=163 ) 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 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 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 62 ms. (steps per millisecond=161 ) properties (out of 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 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 62 ms. (steps per millisecond=161 ) properties (out of 190) 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 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 62 ms. (steps per millisecond=161 ) 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 61 ms. (steps per millisecond=163 ) properties (out of 190) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 66942 ms. (steps per millisecond=149 ) properties seen :0
Running SMT prover for 190 properties.
[2022-05-17 16:41:19] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:41:19] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:41:20] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 16:41:24] [INFO ] After 4912ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:190
[2022-05-17 16:41:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:41:28] [INFO ] After 2946ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :190
[2022-05-17 16:41:28] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:41:32] [INFO ] After 3450ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :190
[2022-05-17 16:41:32] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:41:32] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:41:32] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:41:32] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:41:32] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:41:32] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:41:32] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:41:32] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:41:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 803 ms
[2022-05-17 16:41:33] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:41:33] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:41:33] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:41:33] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:41:33] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:41:33] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:41:33] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:41:33] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:41:33] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:41:34] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:41:34] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1010 ms
[2022-05-17 16:41:34] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:41:34] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:41:34] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:41:34] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:41:34] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:41:34] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:41:34] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:41:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 642 ms
[2022-05-17 16:41:34] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:41:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2022-05-17 16:41:35] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:41:35] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 0 ms to minimize.
[2022-05-17 16:41:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 194 ms
[2022-05-17 16:41:35] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:41:35] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:41:35] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:41:35] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:41:35] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2022-05-17 16:41:35] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:41:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 518 ms
[2022-05-17 16:41:35] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:41:35] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:41:36] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:41:36] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:41:36] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:41:36] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:41:36] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:41:36] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:41:36] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:41:36] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:41:36] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:41:36] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:41:36] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:41:37] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:41:37] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2022-05-17 16:41:37] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:41:37] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2022-05-17 16:41:37] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 0 ms to minimize.
[2022-05-17 16:41:37] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 0 ms to minimize.
[2022-05-17 16:41:37] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2022-05-17 16:41:37] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2022-05-17 16:41:37] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1872 ms
[2022-05-17 16:41:37] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 0 ms to minimize.
[2022-05-17 16:41:37] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:41:37] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:41:38] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:41:38] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:41:38] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:41:38] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:41:38] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2022-05-17 16:41:38] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:41:38] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:41:38] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 975 ms
[2022-05-17 16:41:38] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:41:38] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:41:38] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:41:39] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:41:39] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:41:39] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:41:39] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:41:39] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:41:39] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 807 ms
[2022-05-17 16:41:39] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:41:39] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:41:39] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:41:39] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:41:39] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:41:40] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:41:40] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:41:40] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:41:40] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:41:40] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:41:40] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:41:40] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:41:40] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:41:40] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:41:40] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:41:40] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:41:40] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1491 ms
[2022-05-17 16:41:41] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:41:41] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:41:41] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:41:41] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:41:41] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:41:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 474 ms
[2022-05-17 16:41:41] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2022-05-17 16:41:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2022-05-17 16:41:41] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:41:41] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:41:41] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:41:42] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:41:42] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:41:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 602 ms
[2022-05-17 16:41:42] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 0 ms to minimize.
[2022-05-17 16:41:42] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:41:42] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:41:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 227 ms
[2022-05-17 16:41:42] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:41:42] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:41:42] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:41:42] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:41:42] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:41:43] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:41:43] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:41:43] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 775 ms
[2022-05-17 16:41:43] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:41:43] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:41:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 248 ms
[2022-05-17 16:41:43] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:41:43] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:41:43] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:41:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 260 ms
[2022-05-17 16:41:44] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:41:44] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:41:44] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:41:44] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2022-05-17 16:41:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 359 ms
[2022-05-17 16:41:44] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:41:44] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:41:44] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:41:44] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:41:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 336 ms
[2022-05-17 16:41:44] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:41:44] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:41:45] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:41:45] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:41:45] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:41:45] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:41:45] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:41:45] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:41:45] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:41:45] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:41:45] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 983 ms
[2022-05-17 16:41:45] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:41:45] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:41:46] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:41:46] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:41:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 391 ms
[2022-05-17 16:41:46] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:41:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2022-05-17 16:41:46] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:41:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-17 16:41:46] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2022-05-17 16:41:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2022-05-17 16:41:46] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:41:47] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:41:47] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2022-05-17 16:41:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 263 ms
[2022-05-17 16:41:47] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:41:47] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:41:47] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:41:47] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:41:48] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:41:48] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:41:48] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:41:48] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:41:48] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:41:48] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 819 ms
[2022-05-17 16:41:48] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:41:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2022-05-17 16:41:48] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2022-05-17 16:41:48] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:41:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 188 ms
[2022-05-17 16:41:49] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:41:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2022-05-17 16:41:49] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:41:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2022-05-17 16:41:49] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:41:49] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:41:49] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:41:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 293 ms
[2022-05-17 16:41:50] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:41:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2022-05-17 16:41:50] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:41:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2022-05-17 16:41:50] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:41:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-17 16:41:51] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:41:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2022-05-17 16:41:51] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2022-05-17 16:41:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2022-05-17 16:41:51] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:41:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2022-05-17 16:41:52] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:41:52] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:41:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 196 ms
[2022-05-17 16:41:52] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:41:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2022-05-17 16:41:53] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:41:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-05-17 16:41:53] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:41:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-17 16:41:53] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:41:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2022-05-17 16:41:54] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:41:54] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:41:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 198 ms
[2022-05-17 16:41:54] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:41:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2022-05-17 16:41:55] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:41:55] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:41:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 194 ms
[2022-05-17 16:41:55] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:41:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-17 16:41:56] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:41:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2022-05-17 16:41:56] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:41:56] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:41:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2022-05-17 16:41:56] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:41:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2022-05-17 16:41:57] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:41:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-17 16:41:57] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:41:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-17 16:41:57] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:41:57] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:41:57] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:41:58] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:41:58] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:41:58] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:41:58] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:41:58] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:41:58] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:41:58] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:41:58] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:41:58] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:41:58] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:41:58] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1248 ms
[2022-05-17 16:41:59] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:41:59] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:41:59] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:41:59] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:41:59] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:41:59] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:41:59] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:41:59] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:41:59] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:41:59] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:41:59] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:42:00] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:42:00] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:42:00] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1221 ms
[2022-05-17 16:42:00] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:42:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2022-05-17 16:42:00] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:42:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2022-05-17 16:42:01] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:42:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2022-05-17 16:42:01] [INFO ] After 32902ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :190
Attempting to minimize the solution found.
Minimization took 8374 ms.
[2022-05-17 16:42:09] [INFO ] After 45801ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :190
Parikh walk visited 0 properties in 2185 ms.
Support contains 155 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:42:12] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:42:12] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:42:12] [INFO ] Implicit Places using invariants in 98 ms returned []
[2022-05-17 16:42:12] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:42:12] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:42:12] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:42:12] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2022-05-17 16:42:12] [INFO ] Redundant transitions in 54 ms returned []
[2022-05-17 16:42:12] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:42:12] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 16:42:12] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 3258 ms. (steps per millisecond=30 ) properties (out of 155) seen :67
Running SMT prover for 88 properties.
[2022-05-17 16:42:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:42:16] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:42:16] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 16:42:18] [INFO ] After 2304ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:88
[2022-05-17 16:42:18] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:42:20] [INFO ] After 1353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :88
[2022-05-17 16:42:20] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:42:22] [INFO ] After 1453ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :88
[2022-05-17 16:42:22] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:42:22] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:42:22] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:42:22] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:42:22] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:42:22] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:42:22] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:42:22] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:42:23] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:42:23] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:42:23] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:42:23] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:42:23] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:42:23] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:42:23] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1430 ms
[2022-05-17 16:42:23] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:42:23] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:42:23] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:42:24] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:42:24] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:42:24] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:42:24] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:42:24] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:42:24] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:42:24] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:42:24] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:42:24] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:42:24] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:42:24] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:42:24] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:42:25] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:42:25] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:42:25] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1559 ms
[2022-05-17 16:42:25] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2022-05-17 16:42:25] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:42:25] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2022-05-17 16:42:25] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2022-05-17 16:42:25] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2022-05-17 16:42:25] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2022-05-17 16:42:25] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2022-05-17 16:42:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 446 ms
[2022-05-17 16:42:25] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 0 ms to minimize.
[2022-05-17 16:42:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2022-05-17 16:42:25] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:42:25] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:42:26] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:42:26] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:42:26] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:42:26] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:42:26] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2022-05-17 16:42:26] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:42:26] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:42:26] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:42:26] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:42:26] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:42:26] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:42:26] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:42:27] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:42:27] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:42:27] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2022-05-17 16:42:27] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:42:27] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:42:27] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:42:27] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:42:27] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:42:27] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2022-05-17 16:42:27] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2021 ms
[2022-05-17 16:42:27] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:42:28] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:42:28] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:42:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 325 ms
[2022-05-17 16:42:28] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:42:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-17 16:42:28] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:42:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-17 16:42:28] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:42:28] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:42:28] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:42:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 315 ms
[2022-05-17 16:42:28] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:42:29] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:42:29] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:42:29] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:42:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 392 ms
[2022-05-17 16:42:29] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:42:29] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2022-05-17 16:42:29] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:42:29] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:42:29] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2022-05-17 16:42:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 482 ms
[2022-05-17 16:42:29] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:42:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-05-17 16:42:29] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:42:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2022-05-17 16:42:30] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:42:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-05-17 16:42:30] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2022-05-17 16:42:30] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:42:30] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 0 ms to minimize.
[2022-05-17 16:42:30] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2022-05-17 16:42:30] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:42:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 360 ms
[2022-05-17 16:42:30] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:42:30] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:42:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 221 ms
[2022-05-17 16:42:31] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:42:31] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:42:31] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:42:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 332 ms
[2022-05-17 16:42:31] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:42:31] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:42:31] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:42:31] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:42:31] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:42:31] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:42:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 520 ms
[2022-05-17 16:42:31] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:42:32] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:42:32] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:42:32] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:42:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 460 ms
[2022-05-17 16:42:32] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:42:32] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:42:32] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:42:32] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:42:32] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:42:32] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:42:33] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:42:33] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:42:33] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 787 ms
[2022-05-17 16:42:33] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:42:33] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:42:33] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:42:33] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:42:33] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2022-05-17 16:42:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 574 ms
[2022-05-17 16:42:33] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:42:33] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:42:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 193 ms
[2022-05-17 16:42:34] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:42:34] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:42:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 210 ms
[2022-05-17 16:42:34] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:42:34] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:42:34] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:42:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 298 ms
[2022-05-17 16:42:34] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:42:34] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:42:34] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:42:34] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2022-05-17 16:42:35] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:42:35] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:42:35] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:42:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 737 ms
[2022-05-17 16:42:35] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:42:35] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:42:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2022-05-17 16:42:35] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:42:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-05-17 16:42:35] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:42:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2022-05-17 16:42:36] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:42:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2022-05-17 16:42:36] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:42:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2022-05-17 16:42:36] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2022-05-17 16:42:36] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2022-05-17 16:42:36] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2022-05-17 16:42:36] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:42:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 297 ms
[2022-05-17 16:42:36] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:42:36] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:42:36] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:42:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 282 ms
[2022-05-17 16:42:37] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:42:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-05-17 16:42:37] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:42:37] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:42:37] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:42:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 299 ms
[2022-05-17 16:42:37] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:42:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-05-17 16:42:37] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:42:38] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:42:38] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:42:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 281 ms
[2022-05-17 16:42:38] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:42:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2022-05-17 16:42:38] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:42:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2022-05-17 16:42:38] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:42:38] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:42:38] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:42:38] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:42:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 410 ms
[2022-05-17 16:42:39] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:42:39] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:42:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 234 ms
[2022-05-17 16:42:39] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:42:39] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:42:39] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:42:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 340 ms
[2022-05-17 16:42:39] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:42:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2022-05-17 16:42:40] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:42:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-05-17 16:42:40] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:42:40] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:42:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 209 ms
[2022-05-17 16:42:40] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:42:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-17 16:42:40] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:42:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-05-17 16:42:40] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:42:40] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:42:41] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:42:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 329 ms
[2022-05-17 16:42:41] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:42:41] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:42:41] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:42:41] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:42:41] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:42:41] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:42:41] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:42:41] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:42:42] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:42:42] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 914 ms
[2022-05-17 16:42:42] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:42:42] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:42:42] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:42:42] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:42:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 445 ms
[2022-05-17 16:42:42] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:42:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2022-05-17 16:42:43] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:42:43] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:42:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2022-05-17 16:42:43] [INFO ] After 22984ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :88
Attempting to minimize the solution found.
Minimization took 3526 ms.
[2022-05-17 16:42:47] [INFO ] After 28624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :88
Interrupted random walk after 747210 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 62 ms. (steps per millisecond=161 ) properties (out of 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 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 62 ms. (steps per millisecond=161 ) properties (out of 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 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 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 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 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 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 59 ms. (steps per millisecond=169 ) properties (out of 190) 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 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 64 ms. (steps per millisecond=156 ) properties (out of 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 190) 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 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
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 70574 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 190 properties.
[2022-05-17 16:44:30] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:44:30] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:44:31] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:44:35] [INFO ] After 5057ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:190
[2022-05-17 16:44:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:44:40] [INFO ] After 2894ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :190
[2022-05-17 16:44:40] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:44:43] [INFO ] After 3315ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :190
[2022-05-17 16:44:43] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:44:43] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:44:44] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:44:44] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:44:44] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:44:44] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:44:44] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:44:44] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:44:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 860 ms
[2022-05-17 16:44:44] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:44:44] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:44:45] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:44:45] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:44:45] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:44:45] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:44:45] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:44:45] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:44:45] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:44:45] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:44:45] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 989 ms
[2022-05-17 16:44:45] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:44:45] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:44:45] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:44:46] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:44:46] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:44:46] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:44:46] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:44:46] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 633 ms
[2022-05-17 16:44:46] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:44:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2022-05-17 16:44:46] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:44:46] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:44:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 198 ms
[2022-05-17 16:44:46] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:44:46] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:44:47] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:44:47] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:44:47] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2022-05-17 16:44:47] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:44:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 506 ms
[2022-05-17 16:44:47] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:44:47] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:44:47] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:44:47] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:44:47] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:44:47] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:44:47] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:44:48] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:44:48] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:44:48] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:44:48] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:44:48] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:44:48] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:44:48] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:44:48] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2022-05-17 16:44:48] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:44:48] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2022-05-17 16:44:48] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 0 ms to minimize.
[2022-05-17 16:44:48] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2022-05-17 16:44:49] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:44:49] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
[2022-05-17 16:44:49] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1854 ms
[2022-05-17 16:44:49] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:44:49] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:44:49] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:44:49] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:44:49] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:44:49] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:44:49] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:44:49] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:44:50] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:44:50] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:44:50] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1029 ms
[2022-05-17 16:44:50] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 0 ms to minimize.
[2022-05-17 16:44:50] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:44:50] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:44:50] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:44:50] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:44:50] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:44:50] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:44:50] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:44:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 809 ms
[2022-05-17 16:44:51] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:44:51] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:44:51] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:44:51] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:44:51] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:44:51] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:44:51] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:44:51] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:44:51] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:44:52] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:44:52] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:44:52] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:44:52] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:44:52] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:44:52] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:44:52] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:44:52] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1502 ms
[2022-05-17 16:44:52] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:44:52] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:44:52] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:44:52] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:44:53] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:44:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 483 ms
[2022-05-17 16:44:53] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2022-05-17 16:44:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2022-05-17 16:44:53] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:44:53] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:44:53] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:44:53] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:44:53] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:44:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 570 ms
[2022-05-17 16:44:53] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:44:53] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2022-05-17 16:44:53] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 0 ms to minimize.
[2022-05-17 16:44:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 219 ms
[2022-05-17 16:44:54] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:44:54] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:44:54] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:44:54] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:44:54] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:44:54] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:44:54] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:44:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 777 ms
[2022-05-17 16:44:54] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:44:55] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:44:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2022-05-17 16:44:55] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:44:55] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:44:55] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:44:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 278 ms
[2022-05-17 16:44:55] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:44:55] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:44:55] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:44:55] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2022-05-17 16:44:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 370 ms
[2022-05-17 16:44:56] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:44:56] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:44:56] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:44:56] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:44:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 357 ms
[2022-05-17 16:44:56] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:44:56] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:44:56] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:44:56] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:44:56] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:44:56] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:44:57] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:44:57] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:44:57] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:44:57] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:44:57] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1038 ms
[2022-05-17 16:44:57] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:44:57] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:44:57] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:44:57] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:44:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 395 ms
[2022-05-17 16:44:57] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:44:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2022-05-17 16:44:58] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:44:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2022-05-17 16:44:58] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2022-05-17 16:44:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2022-05-17 16:44:58] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:44:58] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:44:58] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2022-05-17 16:44:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 276 ms
[2022-05-17 16:44:59] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:44:59] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:44:59] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:44:59] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:44:59] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:44:59] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:44:59] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:45:00] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:45:00] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:45:00] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 857 ms
[2022-05-17 16:45:00] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:45:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2022-05-17 16:45:00] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:45:00] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:45:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 194 ms
[2022-05-17 16:45:00] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2022-05-17 16:45:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2022-05-17 16:45:01] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:45:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2022-05-17 16:45:01] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:45:01] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:45:01] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:45:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 282 ms
[2022-05-17 16:45:01] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:45:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2022-05-17 16:45:02] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:45:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2022-05-17 16:45:02] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:45:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2022-05-17 16:45:03] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:45:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2022-05-17 16:45:03] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2022-05-17 16:45:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2022-05-17 16:45:03] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:45:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2022-05-17 16:45:03] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
[2022-05-17 16:45:03] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:45:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2022-05-17 16:45:04] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:45:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2022-05-17 16:45:04] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:45:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2022-05-17 16:45:05] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:45:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2022-05-17 16:45:05] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 0 ms to minimize.
[2022-05-17 16:45:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2022-05-17 16:45:06] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:45:06] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:45:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 202 ms
[2022-05-17 16:45:06] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:45:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2022-05-17 16:45:07] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:45:07] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:45:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 194 ms
[2022-05-17 16:45:07] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:45:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2022-05-17 16:45:08] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:45:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-17 16:45:08] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:45:08] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:45:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2022-05-17 16:45:08] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:45:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2022-05-17 16:45:08] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:45:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2022-05-17 16:45:09] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:45:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-17 16:45:09] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:45:09] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:45:09] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:45:09] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:45:09] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:45:09] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:45:10] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:45:10] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:45:10] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:45:10] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:45:10] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:45:10] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:45:10] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:45:10] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1237 ms
[2022-05-17 16:45:10] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:45:10] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:45:10] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:45:11] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:45:11] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:45:11] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:45:11] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:45:11] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:45:11] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:45:11] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:45:11] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:45:11] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:45:11] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:45:11] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1238 ms
[2022-05-17 16:45:12] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:45:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-17 16:45:12] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:45:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2022-05-17 16:45:13] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:45:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2022-05-17 16:45:13] [INFO ] After 33078ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :190
Attempting to minimize the solution found.
Minimization took 8428 ms.
[2022-05-17 16:45:21] [INFO ] After 45978ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :190
Parikh walk visited 4 properties in 1972 ms.
Support contains 153 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:45:23] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:45:23] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:45:23] [INFO ] Implicit Places using invariants in 98 ms returned []
[2022-05-17 16:45:23] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:45:24] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:45:24] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:45:24] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2022-05-17 16:45:24] [INFO ] Redundant transitions in 26 ms returned []
[2022-05-17 16:45:24] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:45:24] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:45:24] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 3243 ms. (steps per millisecond=30 ) properties (out of 153) seen :70
Running SMT prover for 83 properties.
[2022-05-17 16:45:27] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:45:27] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:45:28] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 16:45:30] [INFO ] After 2155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:83
[2022-05-17 16:45:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 16:45:32] [INFO ] After 1270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :83
[2022-05-17 16:45:32] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:45:33] [INFO ] After 1400ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :83
[2022-05-17 16:45:33] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:45:33] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:45:33] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:45:33] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:45:33] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:45:34] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:45:34] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:45:34] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:45:34] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:45:34] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:45:34] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:45:34] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:45:34] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:45:34] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:45:34] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:45:35] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2022-05-17 16:45:35] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:45:35] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:45:35] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:45:35] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:45:35] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2086 ms
[2022-05-17 16:45:35] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:45:35] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:45:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2022-05-17 16:45:35] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:45:35] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:45:36] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:45:36] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:45:36] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:45:36] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:45:36] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:45:36] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2022-05-17 16:45:36] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 805 ms
[2022-05-17 16:45:36] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:45:36] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:45:36] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:45:37] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:45:37] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:45:37] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:45:37] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:45:37] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:45:37] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:45:37] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:45:37] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:45:37] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:45:37] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:45:38] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:45:38] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:45:38] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:45:38] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:45:38] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:45:38] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:45:38] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:45:38] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:45:38] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:45:38] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:45:38] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:45:38] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:45:39] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2392 ms
[2022-05-17 16:45:39] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:45:39] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:45:39] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:45:39] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:45:39] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:45:39] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:45:39] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2022-05-17 16:45:39] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2022-05-17 16:45:39] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2022-05-17 16:45:39] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2022-05-17 16:45:39] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2022-05-17 16:45:40] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2022-05-17 16:45:40] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1002 ms
[2022-05-17 16:45:40] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:45:40] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:45:40] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:45:40] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2022-05-17 16:45:40] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:45:40] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:45:40] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:45:40] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:45:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 659 ms
[2022-05-17 16:45:40] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2022-05-17 16:45:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2022-05-17 16:45:40] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:45:41] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:45:41] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:45:41] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:45:41] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:45:41] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:45:41] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2022-05-17 16:45:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 711 ms
[2022-05-17 16:45:41] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:45:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2022-05-17 16:45:41] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:45:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-05-17 16:45:42] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:45:42] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:45:42] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2022-05-17 16:45:42] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 0 ms to minimize.
[2022-05-17 16:45:42] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:45:42] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 0 ms to minimize.
[2022-05-17 16:45:42] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 0 ms to minimize.
[2022-05-17 16:45:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 554 ms
[2022-05-17 16:45:42] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2022-05-17 16:45:42] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 0 ms to minimize.
[2022-05-17 16:45:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 172 ms
[2022-05-17 16:45:42] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:45:42] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:45:43] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:45:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 293 ms
[2022-05-17 16:45:43] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2022-05-17 16:45:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2022-05-17 16:45:43] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:45:43] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:45:43] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:45:43] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:45:43] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:45:43] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:45:43] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:45:44] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:45:44] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:45:44] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:45:44] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 912 ms
[2022-05-17 16:45:44] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:45:44] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:45:44] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2022-05-17 16:45:44] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:45:44] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2022-05-17 16:45:44] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:45:44] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2022-05-17 16:45:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 573 ms
[2022-05-17 16:45:44] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:45:44] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:45:45] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 0 ms to minimize.
[2022-05-17 16:45:45] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2022-05-17 16:45:45] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:45:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 366 ms
[2022-05-17 16:45:45] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:45:45] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:45:45] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:45:45] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:45:45] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:45:45] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:45:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 571 ms
[2022-05-17 16:45:46] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:45:46] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:45:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2022-05-17 16:45:46] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:45:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2022-05-17 16:45:46] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:45:46] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:45:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2022-05-17 16:45:46] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:45:46] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:45:46] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:45:46] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:45:46] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:45:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 412 ms
[2022-05-17 16:45:47] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:45:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2022-05-17 16:45:47] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:45:47] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:45:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 236 ms
[2022-05-17 16:45:47] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2022-05-17 16:45:47] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2022-05-17 16:45:47] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
[2022-05-17 16:45:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 221 ms
[2022-05-17 16:45:48] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:45:48] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:45:48] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:45:48] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:45:48] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:45:48] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:45:48] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:45:48] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:45:48] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:45:49] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:45:49] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1162 ms
[2022-05-17 16:45:49] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:45:49] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:45:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
[2022-05-17 16:45:49] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:45:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2022-05-17 16:45:49] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:45:50] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:45:50] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:45:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 311 ms
[2022-05-17 16:45:50] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:45:50] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:45:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 211 ms
[2022-05-17 16:45:50] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:45:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-05-17 16:45:51] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:45:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2022-05-17 16:45:51] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:45:51] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:45:51] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:45:51] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:45:51] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:45:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 587 ms
[2022-05-17 16:45:52] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:45:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2022-05-17 16:45:52] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2022-05-17 16:45:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2022-05-17 16:45:52] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:45:52] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:45:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2022-05-17 16:45:52] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:45:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2022-05-17 16:45:52] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:45:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2022-05-17 16:45:53] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:45:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2022-05-17 16:45:53] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:45:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-05-17 16:45:53] [INFO ] After 21282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :83
Attempting to minimize the solution found.
Minimization took 3441 ms.
[2022-05-17 16:45:56] [INFO ] After 26702ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :83
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 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
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 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
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 22 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Finished random walk after 3456 steps, including 1 resets, run visited all 1 properties in 9 ms. (steps per millisecond=384 )
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Finished random walk after 3919 steps, including 1 resets, run visited all 1 properties in 9 ms. (steps per millisecond=435 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) 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 7661 steps, run visited all 1 properties in 24 ms. (steps per millisecond=319 )
Probabilistic random walk after 7661 steps, saw 2336 distinct states, run finished after 24 ms. (steps per millisecond=319 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 17777 steps, run visited all 1 properties in 49 ms. (steps per millisecond=362 )
Probabilistic random walk after 17777 steps, saw 4286 distinct states, run finished after 49 ms. (steps per millisecond=362 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 54647 steps, run visited all 1 properties in 132 ms. (steps per millisecond=413 )
Probabilistic random walk after 54647 steps, saw 9438 distinct states, run finished after 132 ms. (steps per millisecond=413 ) properties seen :1
Finished random walk after 5492 steps, including 1 resets, run visited all 1 properties in 11 ms. (steps per millisecond=499 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 1333773 steps, run timeout after 3001 ms. (steps per millisecond=444 ) properties seen :{}
Probabilistic random walk after 1333773 steps, saw 192166 distinct states, run finished after 3002 ms. (steps per millisecond=444 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:46:00] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:00] [INFO ] Computed 17 place invariants in 5 ms
[2022-05-17 16:46:00] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:46:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:46:00] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:00] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:46:00] [INFO ] After 28ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:00] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-17 16:46:00] [INFO ] After 233ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1329020 steps, run timeout after 3001 ms. (steps per millisecond=442 ) properties seen :{}
Probabilistic random walk after 1329020 steps, saw 191663 distinct states, run finished after 3001 ms. (steps per millisecond=442 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:46:03] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:03] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 16:46:03] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:46:03] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:46:03] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:03] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:46:03] [INFO ] After 31ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:03] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-17 16:46:03] [INFO ] After 239ms 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 SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 20 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:46:03] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:03] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:46:03] [INFO ] Implicit Places using invariants in 152 ms returned []
[2022-05-17 16:46:03] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:03] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:46:04] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:46:04] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
[2022-05-17 16:46:04] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-17 16:46:04] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:04] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:46:04] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 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.4 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 26 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
[2022-05-17 16:46:04] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 16:46:04] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:46:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 16:46:05] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:05] [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.
[2022-05-17 16:46:05] [INFO ] After 18ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:05] [INFO ] Flatten gal took : 11 ms
[2022-05-17 16:46:05] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:46:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8153695813309689145.gal : 3 ms
[2022-05-17 16:46:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7066218449140227454.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8153695813309689145.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7066218449140227454.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality7066218449140227454.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.010578,3280,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.011128,3704,2,3,6,12,7,0,16,6,0
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
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 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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1321264 steps, run timeout after 3001 ms. (steps per millisecond=440 ) properties seen :{}
Probabilistic random walk after 1321264 steps, saw 190095 distinct states, run finished after 3001 ms. (steps per millisecond=440 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:46:08] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:08] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:46:08] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:46:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 16:46:08] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:08] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:46:08] [INFO ] After 51ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:08] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:46:08] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:46:08] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:46:08] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:46:09] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:46:09] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:46:09] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2022-05-17 16:46:09] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:46:09] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:46:09] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 891 ms
[2022-05-17 16:46:09] [INFO ] After 961ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-17 16:46:09] [INFO ] After 1192ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1328642 steps, run timeout after 3001 ms. (steps per millisecond=442 ) properties seen :{}
Probabilistic random walk after 1328642 steps, saw 191657 distinct states, run finished after 3001 ms. (steps per millisecond=442 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:46:12] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:12] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:46:12] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:46:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:46:12] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:12] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:46:12] [INFO ] After 33ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:12] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2022-05-17 16:46:12] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:46:13] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:46:13] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:46:13] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:46:13] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:46:13] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:46:13] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:46:13] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:46:13] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 885 ms
[2022-05-17 16:46:13] [INFO ] After 931ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-17 16:46:13] [INFO ] After 1110ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:46:13] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:13] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:46:13] [INFO ] Implicit Places using invariants in 171 ms returned []
[2022-05-17 16:46:13] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:13] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:46:14] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:46:14] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
[2022-05-17 16:46:14] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-17 16:46:14] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:14] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:46:14] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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
[2022-05-17 16:46:14] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:46:14] [INFO ] After 11ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:46:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:46:14] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:14] [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.
[2022-05-17 16:46:14] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:14] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:46:14] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:46:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11523945532311929442.gal : 1 ms
[2022-05-17 16:46:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15337868800600600101.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11523945532311929442.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15337868800600600101.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality15337868800600600101.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001266,3464,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001504,3904,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished Best-First random walk after 1883 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=941 )
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 1332002 steps, run timeout after 3001 ms. (steps per millisecond=443 ) properties seen :{}
Probabilistic random walk after 1332002 steps, saw 191994 distinct states, run finished after 3001 ms. (steps per millisecond=443 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:46:17] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:17] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 16:46:17] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:46:18] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:46:18] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:18] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:46:18] [INFO ] After 33ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:18] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-17 16:46:18] [INFO ] After 261ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1326304 steps, run timeout after 3001 ms. (steps per millisecond=441 ) properties seen :{}
Probabilistic random walk after 1326304 steps, saw 191382 distinct states, run finished after 3001 ms. (steps per millisecond=441 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:46:21] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:21] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:46:21] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:46:21] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:46:21] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:46:21] [INFO ] After 35ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:21] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 16:46:21] [INFO ] After 244ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:46:21] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:21] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:46:21] [INFO ] Implicit Places using invariants in 153 ms returned []
[2022-05-17 16:46:21] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:21] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:46:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:46:22] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
[2022-05-17 16:46:22] [INFO ] Redundant transitions in 73 ms returned []
[2022-05-17 16:46:22] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:22] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:46:22] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 11 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 16:46:22] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:46:22] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:46:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 16:46:22] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:22] [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.
[2022-05-17 16:46:22] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:22] [INFO ] Flatten gal took : 4 ms
[2022-05-17 16:46:22] [INFO ] Flatten gal took : 3 ms
[2022-05-17 16:46:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11410172854030491624.gal : 2 ms
[2022-05-17 16:46:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8531517339748452007.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11410172854030491624.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8531517339748452007.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality8531517339748452007.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001308,3460,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001561,3900,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1325457 steps, run timeout after 3001 ms. (steps per millisecond=441 ) properties seen :{}
Probabilistic random walk after 1325457 steps, saw 191281 distinct states, run finished after 3001 ms. (steps per millisecond=441 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:46:25] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:25] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:46:25] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:46:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:46:26] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:46:26] [INFO ] After 32ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:26] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-17 16:46:26] [INFO ] After 250ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 1332100 steps, run timeout after 3001 ms. (steps per millisecond=443 ) properties seen :{}
Probabilistic random walk after 1332100 steps, saw 192012 distinct states, run finished after 3001 ms. (steps per millisecond=443 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:46:29] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:29] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:46:29] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:46:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:46:29] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:29] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:46:29] [INFO ] After 34ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:29] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-17 16:46:29] [INFO ] After 241ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:46:29] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:29] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:46:29] [INFO ] Implicit Places using invariants in 157 ms returned []
[2022-05-17 16:46:29] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:29] [INFO ] Computed 17 place invariants in 17 ms
[2022-05-17 16:46:29] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:46:30] [INFO ] Implicit Places using invariants and state equation in 646 ms returned []
Implicit Place search using SMT with State Equation took 819 ms to find 0 implicit places.
[2022-05-17 16:46:30] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-17 16:46:30] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:30] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 16:46:30] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 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
[2022-05-17 16:46:30] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:46:30] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:46:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:46:30] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:30] [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.
[2022-05-17 16:46:30] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:30] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:46:30] [INFO ] Flatten gal took : 4 ms
[2022-05-17 16:46:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3228574744071060277.gal : 1 ms
[2022-05-17 16:46:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11475760803739127316.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3228574744071060277.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11475760803739127316.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality11475760803739127316.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001242,3464,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001499,3904,2,3,6,12,7,0,16,6,0
Finished random walk after 4104 steps, including 1 resets, run visited all 1 properties in 9 ms. (steps per millisecond=456 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1336048 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :{}
Probabilistic random walk after 1336048 steps, saw 192426 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:46:33] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:33] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:46:33] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:46:33] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:46:33] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:33] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:46:34] [INFO ] After 39ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:34] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-17 16:46:34] [INFO ] After 254ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1335950 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :{}
Probabilistic random walk after 1335950 steps, saw 192409 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:46:37] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:37] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:46:37] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:46:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 16:46:37] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:37] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:46:37] [INFO ] After 38ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:37] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-17 16:46:37] [INFO ] After 260ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:46:37] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:37] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:46:37] [INFO ] Implicit Places using invariants in 151 ms returned []
[2022-05-17 16:46:37] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:37] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:46:37] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:46:38] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
[2022-05-17 16:46:38] [INFO ] Redundant transitions in 9 ms returned []
[2022-05-17 16:46:38] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:38] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:46:38] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 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
[2022-05-17 16:46:38] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:46:38] [INFO ] After 12ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:46:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:46:38] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:38] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:46:38] [INFO ] After 17ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:38] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:46:38] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:46:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17192382043021653033.gal : 0 ms
[2022-05-17 16:46:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5738493837264796394.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17192382043021653033.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5738493837264796394.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality5738493837264796394.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.00126,3464,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001504,3904,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) 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 1324197 steps, run timeout after 3001 ms. (steps per millisecond=441 ) properties seen :{}
Probabilistic random walk after 1324197 steps, saw 191164 distinct states, run finished after 3004 ms. (steps per millisecond=440 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:46:41] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:41] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:46:41] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:46:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:46:41] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:41] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:46:41] [INFO ] After 38ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:41] [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 20 ms.
[2022-05-17 16:46:41] [INFO ] After 265ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1295266 steps, run timeout after 3001 ms. (steps per millisecond=431 ) properties seen :{}
Probabilistic random walk after 1295266 steps, saw 187319 distinct states, run finished after 3001 ms. (steps per millisecond=431 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:46:44] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:44] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:46:44] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:46:44] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:46:45] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:45] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:46:45] [INFO ] After 35ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:45] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-05-17 16:46:45] [INFO ] After 261ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:46:45] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:45] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:46:45] [INFO ] Implicit Places using invariants in 161 ms returned []
[2022-05-17 16:46:45] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:45] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:46:45] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:46:46] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
[2022-05-17 16:46:46] [INFO ] Redundant transitions in 9 ms returned []
[2022-05-17 16:46:46] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:46] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:46:46] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 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
[2022-05-17 16:46:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:46:46] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:46:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:46:46] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:46] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:46:46] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:46] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:46:46] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:46:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16185629527275556135.gal : 0 ms
[2022-05-17 16:46:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15748596778513479042.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16185629527275556135.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15748596778513479042.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality15748596778513479042.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.00137,3460,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001654,3900,2,3,6,12,7,0,16,6,0
Finished random walk after 2253 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=281 )
Finished random walk after 1291 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=322 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1312675 steps, run timeout after 3001 ms. (steps per millisecond=437 ) properties seen :{}
Probabilistic random walk after 1312675 steps, saw 188617 distinct states, run finished after 3001 ms. (steps per millisecond=437 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:46:49] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:49] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:46:49] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:46:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:46:49] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:49] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:46:49] [INFO ] After 34ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:49] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:46:49] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:46:49] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:46:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 313 ms
[2022-05-17 16:46:49] [INFO ] After 359ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-17 16:46:49] [INFO ] After 538ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1318492 steps, run timeout after 3001 ms. (steps per millisecond=439 ) properties seen :{}
Probabilistic random walk after 1318492 steps, saw 189411 distinct states, run finished after 3001 ms. (steps per millisecond=439 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:46:53] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:53] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:46:53] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:46:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:46:53] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:53] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:46:53] [INFO ] After 34ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:53] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:46:53] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:46:53] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:46:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 291 ms
[2022-05-17 16:46:53] [INFO ] After 337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 16:46:53] [INFO ] After 523ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:46:53] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:53] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:46:53] [INFO ] Implicit Places using invariants in 146 ms returned []
[2022-05-17 16:46:53] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:53] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:46:53] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:46:54] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
[2022-05-17 16:46:54] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-17 16:46:54] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:54] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:46:54] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 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
[2022-05-17 16:46:54] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:46:54] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:46:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 16:46:54] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:54] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:46:54] [INFO ] After 19ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:54] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:46:54] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:46:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6519242351787597269.gal : 0 ms
[2022-05-17 16:46:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11889624254690800054.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6519242351787597269.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11889624254690800054.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality11889624254690800054.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001413,3460,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001649,3900,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1327501 steps, run timeout after 3001 ms. (steps per millisecond=442 ) properties seen :{}
Probabilistic random walk after 1327501 steps, saw 191524 distinct states, run finished after 3001 ms. (steps per millisecond=442 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:46:57] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:46:57] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:46:57] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:46:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:46:57] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:57] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:46:57] [INFO ] After 31ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:46:57] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-17 16:46:57] [INFO ] After 240ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 1326500 steps, run timeout after 3001 ms. (steps per millisecond=442 ) properties seen :{}
Probabilistic random walk after 1326500 steps, saw 191401 distinct states, run finished after 3001 ms. (steps per millisecond=442 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:47:01] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:01] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:47:01] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:47:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:47:01] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:01] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:47:01] [INFO ] After 31ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:01] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 16:47:01] [INFO ] After 238ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:47:01] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:01] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:47:01] [INFO ] Implicit Places using invariants in 149 ms returned []
[2022-05-17 16:47:01] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:01] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:47:01] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:47:02] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
[2022-05-17 16:47:02] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-17 16:47:02] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:02] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:47:02] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 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 6 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
[2022-05-17 16:47:02] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:47:02] [INFO ] After 12ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:47:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 16:47:02] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:02] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:47:02] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:02] [INFO ] Flatten gal took : 2 ms
[2022-05-17 16:47:02] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:47:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality259299327273477398.gal : 1 ms
[2022-05-17 16:47:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14745839650278723914.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality259299327273477398.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14745839650278723914.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality14745839650278723914.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001897,3460,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.002269,3900,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) 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 221272 steps, run visited all 1 properties in 504 ms. (steps per millisecond=439 )
Probabilistic random walk after 221272 steps, saw 35224 distinct states, run finished after 504 ms. (steps per millisecond=439 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1314607 steps, run timeout after 3001 ms. (steps per millisecond=438 ) properties seen :{}
Probabilistic random walk after 1314607 steps, saw 188842 distinct states, run finished after 3001 ms. (steps per millisecond=438 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:47:05] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:05] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:47:06] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:47:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:47:06] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:47:06] [INFO ] After 36ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:06] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-17 16:47:06] [INFO ] After 250ms 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 SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 18 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 1322202 steps, run timeout after 3001 ms. (steps per millisecond=440 ) properties seen :{}
Probabilistic random walk after 1322202 steps, saw 190665 distinct states, run finished after 3001 ms. (steps per millisecond=440 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:47:09] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:09] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:47:09] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:47:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:47:09] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:09] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:47:09] [INFO ] After 34ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:09] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 16:47:09] [INFO ] After 242ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:47:09] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:09] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:47:09] [INFO ] Implicit Places using invariants in 150 ms returned []
[2022-05-17 16:47:09] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:09] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:47:09] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:47:10] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
[2022-05-17 16:47:10] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-17 16:47:10] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:10] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:47:10] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 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
[2022-05-17 16:47:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:47:10] [INFO ] After 13ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:47:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:47:10] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:10] [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.
[2022-05-17 16:47:10] [INFO ] After 18ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:10] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:47:10] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:47:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10112789266289892629.gal : 0 ms
[2022-05-17 16:47:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14859300937818521521.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10112789266289892629.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14859300937818521521.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality14859300937818521521.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.002652,3460,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.00324,3900,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 211559 steps, run visited all 1 properties in 482 ms. (steps per millisecond=438 )
Probabilistic random walk after 211559 steps, saw 32809 distinct states, run finished after 482 ms. (steps per millisecond=438 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1330861 steps, run timeout after 3001 ms. (steps per millisecond=443 ) properties seen :{}
Probabilistic random walk after 1330861 steps, saw 191885 distinct states, run finished after 3001 ms. (steps per millisecond=443 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:47:14] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:14] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:47:14] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:47:14] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:47:14] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:14] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:47:14] [INFO ] After 30ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:14] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:47:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-17 16:47:14] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-17 16:47:14] [INFO ] After 343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 1332835 steps, run timeout after 3001 ms. (steps per millisecond=444 ) properties seen :{}
Probabilistic random walk after 1332835 steps, saw 192069 distinct states, run finished after 3001 ms. (steps per millisecond=444 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:47:17] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:17] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:47:17] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:47:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:47:17] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:17] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:47:17] [INFO ] After 27ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:18] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:47:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2022-05-17 16:47:18] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-17 16:47:18] [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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:47:18] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:18] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:47:18] [INFO ] Implicit Places using invariants in 153 ms returned []
[2022-05-17 16:47:18] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:18] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:47:18] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:47:18] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
[2022-05-17 16:47:18] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-17 16:47:18] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:18] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:47:19] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 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 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
[2022-05-17 16:47:19] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:47:19] [INFO ] After 11ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:47:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 16:47:19] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:19] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:47:19] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:19] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:47:19] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:47:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3564466733275236235.gal : 0 ms
[2022-05-17 16:47:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2857740829161077187.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3564466733275236235.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2857740829161077187.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality2857740829161077187.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.002095,3460,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.002328,3900,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1338722 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :{}
Probabilistic random walk after 1338722 steps, saw 192736 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:47:22] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:22] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:47:22] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:47:22] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:47:22] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:22] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:47:22] [INFO ] After 26ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:22] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-17 16:47:22] [INFO ] After 228ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 1340003 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :{}
Probabilistic random walk after 1340003 steps, saw 192932 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:47:25] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:25] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:47:25] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:47:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:47:25] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:25] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:47:25] [INFO ] After 27ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:25] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 16:47:25] [INFO ] After 233ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:47:25] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:25] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:47:26] [INFO ] Implicit Places using invariants in 150 ms returned []
[2022-05-17 16:47:26] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:26] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:47:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:47:26] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
[2022-05-17 16:47:26] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-17 16:47:26] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:26] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:47:26] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 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
[2022-05-17 16:47:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:47:26] [INFO ] After 12ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:47:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:47:26] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:26] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 16:47:26] [INFO ] After 18ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:26] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:47:26] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:47:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4394206143491622146.gal : 0 ms
[2022-05-17 16:47:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9974051131575493191.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4394206143491622146.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9974051131575493191.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality9974051131575493191.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001205,3464,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.00145,3904,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 442412 steps, run visited all 1 properties in 1002 ms. (steps per millisecond=441 )
Probabilistic random walk after 442412 steps, saw 65835 distinct states, run finished after 1002 ms. (steps per millisecond=441 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 131857 steps, run visited all 1 properties in 299 ms. (steps per millisecond=440 )
Probabilistic random walk after 131857 steps, saw 21305 distinct states, run finished after 300 ms. (steps per millisecond=439 ) properties seen :1
Finished random walk after 5372 steps, including 1 resets, run visited all 1 properties in 11 ms. (steps per millisecond=488 )
Finished random walk after 2516 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=503 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 131807 steps, run visited all 1 properties in 299 ms. (steps per millisecond=440 )
Probabilistic random walk after 131807 steps, saw 21266 distinct states, run finished after 299 ms. (steps per millisecond=440 ) properties seen :1
Finished random walk after 7261 steps, including 2 resets, run visited all 1 properties in 14 ms. (steps per millisecond=518 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1343090 steps, run timeout after 3001 ms. (steps per millisecond=447 ) properties seen :{}
Probabilistic random walk after 1343090 steps, saw 193465 distinct states, run finished after 3001 ms. (steps per millisecond=447 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:47:31] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:31] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:47:31] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:47:31] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:47:31] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:31] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:47:31] [INFO ] After 27ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:32] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:47:32] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:47:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 208 ms
[2022-05-17 16:47:32] [INFO ] After 256ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-17 16:47:32] [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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1340990 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :{}
Probabilistic random walk after 1340990 steps, saw 193090 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:47:35] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:35] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:47:35] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:47:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:47:35] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:35] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:47:35] [INFO ] After 28ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:35] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:47:35] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:47:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 199 ms
[2022-05-17 16:47:35] [INFO ] After 254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-17 16:47:35] [INFO ] After 428ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:47:35] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:35] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 16:47:35] [INFO ] Implicit Places using invariants in 151 ms returned []
[2022-05-17 16:47:35] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:35] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:47:36] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:47:36] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
[2022-05-17 16:47:36] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-17 16:47:36] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:36] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:47:36] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 10 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 16:47:36] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:47:36] [INFO ] After 12ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:47:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 16:47:36] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:36] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 16:47:36] [INFO ] After 17ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:36] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:47:36] [INFO ] Flatten gal took : 4 ms
[2022-05-17 16:47:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14986017829200647527.gal : 0 ms
[2022-05-17 16:47:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12196037112275228162.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14986017829200647527.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12196037112275228162.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality12196037112275228162.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001826,3452,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.00226,3892,2,3,6,12,7,0,16,6,0
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1325702 steps, run timeout after 3001 ms. (steps per millisecond=441 ) properties seen :{}
Probabilistic random walk after 1325702 steps, saw 191319 distinct states, run finished after 3001 ms. (steps per millisecond=441 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:47:39] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:39] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:47:39] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:47:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:47:40] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:40] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:47:40] [INFO ] After 33ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:40] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-17 16:47:40] [INFO ] After 226ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 1340374 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :{}
Probabilistic random walk after 1340374 steps, saw 193025 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:47:43] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:43] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:47:43] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:47:43] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:47:43] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:43] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:47:43] [INFO ] After 32ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:43] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-05-17 16:47:43] [INFO ] After 244ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:47:43] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:43] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:47:43] [INFO ] Implicit Places using invariants in 154 ms returned []
[2022-05-17 16:47:43] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:43] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:47:43] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:47:44] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 814 ms to find 0 implicit places.
[2022-05-17 16:47:44] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-17 16:47:44] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:44] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:47:44] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 5 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
[2022-05-17 16:47:44] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:47:44] [INFO ] After 13ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:47:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:47:44] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:44] [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.
[2022-05-17 16:47:44] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:44] [INFO ] Flatten gal took : 2 ms
[2022-05-17 16:47:44] [INFO ] Flatten gal took : 2 ms
[2022-05-17 16:47:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9380824512559458192.gal : 3 ms
[2022-05-17 16:47:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6428959662227916147.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9380824512559458192.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6428959662227916147.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality6428959662227916147.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001218,3452,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001463,3892,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1335502 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :{}
Probabilistic random walk after 1335502 steps, saw 192352 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:47:47] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:47] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:47:47] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:47:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:47:47] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:47] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:47:47] [INFO ] After 28ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:47] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-17 16:47:47] [INFO ] After 243ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1339737 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :{}
Probabilistic random walk after 1339737 steps, saw 192913 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:47:50] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:50] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:47:51] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:47:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:47:51] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:51] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:47:51] [INFO ] After 29ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:51] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-17 16:47:51] [INFO ] After 241ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:47:51] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:51] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:47:51] [INFO ] Implicit Places using invariants in 148 ms returned []
[2022-05-17 16:47:51] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:51] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:47:51] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:47:52] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
[2022-05-17 16:47:52] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-17 16:47:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:52] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:47:52] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 5 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
[2022-05-17 16:47:52] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:47:52] [INFO ] After 11ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:47:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:47:52] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:52] [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.
[2022-05-17 16:47:52] [INFO ] After 21ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:52] [INFO ] Flatten gal took : 2 ms
[2022-05-17 16:47:52] [INFO ] Flatten gal took : 2 ms
[2022-05-17 16:47:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13277848203802063789.gal : 1 ms
[2022-05-17 16:47:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2578350199911650853.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13277848203802063789.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2578350199911650853.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality2578350199911650853.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001289,3460,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001521,3900,2,3,6,12,7,0,16,6,0
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 1345302 steps, run timeout after 3001 ms. (steps per millisecond=448 ) properties seen :{}
Probabilistic random walk after 1345302 steps, saw 193769 distinct states, run finished after 3001 ms. (steps per millisecond=448 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:47:55] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:55] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:47:55] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:47:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:47:55] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:55] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:47:55] [INFO ] After 27ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:55] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-17 16:47:55] [INFO ] After 235ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 1334753 steps, run timeout after 3001 ms. (steps per millisecond=444 ) properties seen :{}
Probabilistic random walk after 1334753 steps, saw 192274 distinct states, run finished after 3001 ms. (steps per millisecond=444 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:47:58] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:58] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:47:58] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:47:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:47:58] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:58] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:47:58] [INFO ] After 25ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:47:58] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-05-17 16:47:58] [INFO ] After 223ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:47:58] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:59] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:47:59] [INFO ] Implicit Places using invariants in 169 ms returned []
[2022-05-17 16:47:59] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:59] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:47:59] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:47:59] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
[2022-05-17 16:47:59] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-17 16:47:59] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:47:59] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:48:00] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 5 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
[2022-05-17 16:48:00] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:48:00] [INFO ] After 12ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:48:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:48:00] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:00] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:48:00] [INFO ] After 19ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:00] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:48:00] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:48:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13738380235786542828.gal : 1 ms
[2022-05-17 16:48:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8307258646545193808.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13738380235786542828.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8307258646545193808.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality8307258646545193808.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001237,3460,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001472,3900,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1336657 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :{}
Probabilistic random walk after 1336657 steps, saw 192458 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:48:03] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:03] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:48:03] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:48:03] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:48:03] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:03] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:48:03] [INFO ] After 28ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:03] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-17 16:48:03] [INFO ] After 235ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1341466 steps, run timeout after 3001 ms. (steps per millisecond=447 ) properties seen :{}
Probabilistic random walk after 1341466 steps, saw 193171 distinct states, run finished after 3001 ms. (steps per millisecond=447 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:48:06] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:06] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:48:06] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:48:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:48:06] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:48:06] [INFO ] After 27ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:06] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 16:48:06] [INFO ] After 230ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:48:06] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:06] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:48:06] [INFO ] Implicit Places using invariants in 165 ms returned []
[2022-05-17 16:48:06] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:06] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:48:07] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:48:07] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
[2022-05-17 16:48:07] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-17 16:48:07] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:07] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:48:07] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 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
[2022-05-17 16:48:07] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:48:07] [INFO ] After 13ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:48:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 16:48:07] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:07] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:48:07] [INFO ] After 21ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:07] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:48:07] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:48:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality976624506619800131.gal : 0 ms
[2022-05-17 16:48:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5750003649305150012.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality976624506619800131.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5750003649305150012.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality5750003649305150012.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.00145,3464,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001733,3904,2,3,6,12,7,0,16,6,0
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 1335467 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :{}
Probabilistic random walk after 1335467 steps, saw 192352 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:48:10] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:10] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:48:10] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:48:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:48:11] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:11] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:48:11] [INFO ] After 36ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:11] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-17 16:48:11] [INFO ] After 240ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1339198 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :{}
Probabilistic random walk after 1339198 steps, saw 192856 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:48:14] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:14] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:48:14] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:48:14] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:48:14] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:14] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:48:14] [INFO ] After 41ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:14] [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 15 ms.
[2022-05-17 16:48:14] [INFO ] After 252ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:48:14] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:14] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:48:14] [INFO ] Implicit Places using invariants in 152 ms returned []
[2022-05-17 16:48:14] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:14] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:48:14] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:48:15] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
[2022-05-17 16:48:15] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-17 16:48:15] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:15] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:48:15] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 13 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 16:48:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:48:15] [INFO ] After 12ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:48:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:48:15] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:15] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 16:48:15] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:15] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:48:15] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:48:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4095211130202639411.gal : 0 ms
[2022-05-17 16:48:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality744670452619228570.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4095211130202639411.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality744670452619228570.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality744670452619228570.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001185,3464,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001418,3904,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1339646 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :{}
Probabilistic random walk after 1339646 steps, saw 192907 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:48:18] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:18] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:48:18] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:48:18] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:48:18] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:18] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:48:18] [INFO ] After 29ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:18] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-17 16:48:18] [INFO ] After 233ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1337700 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :{}
Probabilistic random walk after 1337700 steps, saw 192625 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:48:21] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:21] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:48:21] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:48:22] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 16:48:22] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:22] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:48:22] [INFO ] After 32ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:22] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 16:48:22] [INFO ] After 247ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2022-05-17 16:48:22] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:22] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:48:22] [INFO ] Implicit Places using invariants in 140 ms returned []
[2022-05-17 16:48:22] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:22] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:48:22] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:48:23] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
[2022-05-17 16:48:23] [INFO ] Redundant transitions in 4 ms returned []
[2022-05-17 16:48:23] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:23] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:48:23] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 6 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
[2022-05-17 16:48:23] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 16:48:23] [INFO ] After 12ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:48:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:48:23] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:23] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 16:48:23] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:23] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:48:23] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:48:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7136387971602441851.gal : 0 ms
[2022-05-17 16:48:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16492827175423095504.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7136387971602441851.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16492827175423095504.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality16492827175423095504.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001414,3464,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001717,3904,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1334753 steps, run timeout after 3001 ms. (steps per millisecond=444 ) properties seen :{}
Probabilistic random walk after 1334753 steps, saw 192274 distinct states, run finished after 3001 ms. (steps per millisecond=444 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:48:26] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:26] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:48:26] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:48:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:48:26] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:48:26] [INFO ] After 32ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:26] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-17 16:48:26] [INFO ] After 240ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1337693 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :{}
Probabilistic random walk after 1337693 steps, saw 192625 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:48:29] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:29] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:48:29] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:48:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:48:29] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:29] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:48:29] [INFO ] After 33ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:29] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-17 16:48:29] [INFO ] After 246ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2022-05-17 16:48:29] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:29] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:48:30] [INFO ] Implicit Places using invariants in 147 ms returned []
[2022-05-17 16:48:30] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:30] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:48:30] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:48:30] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
[2022-05-17 16:48:30] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-17 16:48:30] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:30] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:48:31] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 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
[2022-05-17 16:48:31] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:48:31] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:48:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:48:31] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:31] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:48:31] [INFO ] After 16ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:31] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:48:31] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:48:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5164309769133206859.gal : 1 ms
[2022-05-17 16:48:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1119934174061343253.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5164309769133206859.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1119934174061343253.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality1119934174061343253.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001565,3460,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001896,3900,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1332723 steps, run timeout after 3001 ms. (steps per millisecond=444 ) properties seen :{}
Probabilistic random walk after 1332723 steps, saw 192069 distinct states, run finished after 3001 ms. (steps per millisecond=444 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:48:34] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:34] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:48:34] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:48:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:48:34] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:34] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:48:34] [INFO ] After 29ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:34] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 16:48:34] [INFO ] After 239ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1338050 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :{}
Probabilistic random walk after 1338050 steps, saw 192675 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:48:37] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:37] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:48:37] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:48:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:48:37] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:37] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:48:37] [INFO ] After 29ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:37] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-17 16:48:37] [INFO ] After 241ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2022-05-17 16:48:37] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:37] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:48:37] [INFO ] Implicit Places using invariants in 150 ms returned []
[2022-05-17 16:48:37] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:37] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:48:38] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:48:38] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
[2022-05-17 16:48:38] [INFO ] Redundant transitions in 4 ms returned []
[2022-05-17 16:48:38] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:38] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:48:38] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 24 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
[2022-05-17 16:48:38] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:48:38] [INFO ] After 12ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:48:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 16:48:38] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:38] [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.
[2022-05-17 16:48:38] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:38] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:48:38] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:48:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15767815795978151864.gal : 0 ms
[2022-05-17 16:48:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16607799494616191646.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15767815795978151864.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16607799494616191646.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality16607799494616191646.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001234,3464,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001498,3904,2,3,6,12,7,0,16,6,0
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 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1333626 steps, run timeout after 3001 ms. (steps per millisecond=444 ) properties seen :{}
Probabilistic random walk after 1333626 steps, saw 192147 distinct states, run finished after 3001 ms. (steps per millisecond=444 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:48:41] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:41] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:48:41] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:48:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:48:42] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:42] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:48:42] [INFO ] After 35ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:42] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 16:48:42] [INFO ] After 253ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1342894 steps, run timeout after 3001 ms. (steps per millisecond=447 ) properties seen :{}
Probabilistic random walk after 1342894 steps, saw 193446 distinct states, run finished after 3001 ms. (steps per millisecond=447 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:48:45] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:45] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:48:45] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:48:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:48:45] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:45] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:48:45] [INFO ] After 34ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:45] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-17 16:48:45] [INFO ] After 255ms 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 SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:48:45] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:45] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-17 16:48:45] [INFO ] Implicit Places using invariants in 151 ms returned []
[2022-05-17 16:48:45] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:45] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:48:45] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:48:46] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 782 ms to find 0 implicit places.
[2022-05-17 16:48:46] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-17 16:48:46] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:46] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:48:46] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 5 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
[2022-05-17 16:48:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:48:46] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:48:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 16:48:46] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:46] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:48:46] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:46] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:48:46] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:48:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality546385104921290919.gal : 1 ms
[2022-05-17 16:48:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15848138495412477577.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality546385104921290919.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15848138495412477577.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality15848138495412477577.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.002241,3460,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.002606,3900,2,3,6,12,7,0,16,6,0
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 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1340192 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :{}
Probabilistic random walk after 1340192 steps, saw 192957 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:48:49] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:49] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:48:49] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:48:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:48:49] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:49] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:48:49] [INFO ] After 29ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:49] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-17 16:48:49] [INFO ] After 230ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1338806 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :{}
Probabilistic random walk after 1338806 steps, saw 192739 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:48:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:52] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:48:52] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:48:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:48:53] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:53] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:48:53] [INFO ] After 26ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:53] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-17 16:48:53] [INFO ] After 228ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:48:53] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:53] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-17 16:48:53] [INFO ] Implicit Places using invariants in 138 ms returned []
[2022-05-17 16:48:53] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:53] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-17 16:48:53] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:48:53] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
[2022-05-17 16:48:54] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-17 16:48:54] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:54] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:48:54] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 5 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
[2022-05-17 16:48:54] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:48:54] [INFO ] After 10ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:48:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 16:48:54] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:54] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:48:54] [INFO ] After 20ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:54] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:48:54] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:48:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18445452696355160738.gal : 1 ms
[2022-05-17 16:48:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16405580193699761030.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18445452696355160738.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16405580193699761030.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality16405580193699761030.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001195,3460,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001443,3900,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1323770 steps, run timeout after 3001 ms. (steps per millisecond=441 ) properties seen :{}
Probabilistic random walk after 1323770 steps, saw 191127 distinct states, run finished after 3001 ms. (steps per millisecond=441 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:48:57] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:48:57] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:48:57] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:48:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:48:57] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:57] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:48:57] [INFO ] After 32ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:48:57] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 16:48:57] [INFO ] After 235ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1339870 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :{}
Probabilistic random walk after 1339870 steps, saw 192920 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:49:00] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:00] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:49:00] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:49:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:49:00] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:00] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:49:00] [INFO ] After 34ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:00] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-17 16:49:00] [INFO ] After 255ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:49:00] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:00] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:49:01] [INFO ] Implicit Places using invariants in 147 ms returned []
[2022-05-17 16:49:01] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:01] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:49:01] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:49:01] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
[2022-05-17 16:49:01] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-17 16:49:01] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:01] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:49:01] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 1 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
[2022-05-17 16:49:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:49:01] [INFO ] After 12ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:49:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:49:02] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:02] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:49:02] [INFO ] After 18ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:02] [INFO ] Flatten gal took : 3 ms
[2022-05-17 16:49:02] [INFO ] Flatten gal took : 3 ms
[2022-05-17 16:49:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17570740304120163502.gal : 0 ms
[2022-05-17 16:49:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10816554311693897326.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17570740304120163502.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10816554311693897326.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality10816554311693897326.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001254,3460,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001512,3900,2,3,6,12,7,0,16,6,0
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 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1295371 steps, run timeout after 3001 ms. (steps per millisecond=431 ) properties seen :{}
Probabilistic random walk after 1295371 steps, saw 187329 distinct states, run finished after 3001 ms. (steps per millisecond=431 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:49:05] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:05] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:49:05] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:49:05] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:49:05] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:05] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:49:05] [INFO ] After 32ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:05] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 16:49:05] [INFO ] After 243ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 1333451 steps, run timeout after 3001 ms. (steps per millisecond=444 ) properties seen :{}
Probabilistic random walk after 1333451 steps, saw 192145 distinct states, run finished after 3001 ms. (steps per millisecond=444 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:49:08] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:08] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:49:08] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:49:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:49:08] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:08] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:49:08] [INFO ] After 28ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:08] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 16:49:08] [INFO ] After 234ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:49:08] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:08] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:49:08] [INFO ] Implicit Places using invariants in 155 ms returned []
[2022-05-17 16:49:08] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:08] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:49:08] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:49:09] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
[2022-05-17 16:49:09] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-17 16:49:09] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:09] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:49:09] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 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 5 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
[2022-05-17 16:49:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:49:09] [INFO ] After 11ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:49:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:49:09] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:09] [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.
[2022-05-17 16:49:09] [INFO ] After 18ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:09] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:49:09] [INFO ] Flatten gal took : 2 ms
[2022-05-17 16:49:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2089962904862737159.gal : 1 ms
[2022-05-17 16:49:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18306417057165913857.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2089962904862737159.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18306417057165913857.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality18306417057165913857.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001674,3464,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.00205,3904,2,3,6,12,7,0,16,6,0
ITS tools runner thread asked to quit. Dying gracefully.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1342103 steps, run timeout after 3001 ms. (steps per millisecond=447 ) properties seen :{}
Probabilistic random walk after 1342103 steps, saw 193282 distinct states, run finished after 3001 ms. (steps per millisecond=447 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:49:12] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:12] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:49:12] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:49:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:49:13] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:13] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:49:13] [INFO ] After 29ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:13] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-17 16:49:13] [INFO ] After 239ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1337399 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :{}
Probabilistic random walk after 1337399 steps, saw 192606 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:49:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:16] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:49:16] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:49:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:49:16] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:16] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:49:16] [INFO ] After 26ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:16] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-17 16:49:16] [INFO ] After 243ms 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 SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:49:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:16] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:49:16] [INFO ] Implicit Places using invariants in 145 ms returned []
[2022-05-17 16:49:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:16] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:49:16] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:49:17] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
[2022-05-17 16:49:17] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-17 16:49:17] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:17] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:49:17] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 5 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
[2022-05-17 16:49:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:49:17] [INFO ] After 11ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:49:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:49:17] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:17] [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.
[2022-05-17 16:49:17] [INFO ] After 17ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:17] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:49:17] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:49:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7567224514708671505.gal : 1 ms
[2022-05-17 16:49:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6712817573801712347.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7567224514708671505.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6712817573801712347.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality6712817573801712347.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.0025,3456,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.002849,3896,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1333598 steps, run timeout after 3001 ms. (steps per millisecond=444 ) properties seen :{}
Probabilistic random walk after 1333598 steps, saw 192147 distinct states, run finished after 3001 ms. (steps per millisecond=444 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:49:20] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:20] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:49:20] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:49:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:49:20] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:20] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:49:20] [INFO ] After 28ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:20] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-17 16:49:20] [INFO ] After 242ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1304625 steps, run timeout after 3001 ms. (steps per millisecond=434 ) properties seen :{}
Probabilistic random walk after 1304625 steps, saw 187677 distinct states, run finished after 3001 ms. (steps per millisecond=434 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:49:23] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:23] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:49:23] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:49:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:49:24] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:24] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:49:24] [INFO ] After 27ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:24] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-17 16:49:24] [INFO ] After 242ms 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 SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:49:24] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:24] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:49:24] [INFO ] Implicit Places using invariants in 152 ms returned []
[2022-05-17 16:49:24] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:24] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:49:24] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:49:24] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
[2022-05-17 16:49:25] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-17 16:49:25] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:25] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:49:25] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 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
[2022-05-17 16:49:25] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:49:25] [INFO ] After 12ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:49:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:49:25] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:25] [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.
[2022-05-17 16:49:25] [INFO ] After 18ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:25] [INFO ] Flatten gal took : 3 ms
[2022-05-17 16:49:25] [INFO ] Flatten gal took : 2 ms
[2022-05-17 16:49:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10743313567201211492.gal : 1 ms
[2022-05-17 16:49:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14645429973099743568.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10743313567201211492.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14645429973099743568.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality14645429973099743568.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.00136,3456,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001612,3896,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1329265 steps, run timeout after 3001 ms. (steps per millisecond=442 ) properties seen :{}
Probabilistic random walk after 1329265 steps, saw 191701 distinct states, run finished after 3001 ms. (steps per millisecond=442 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:49:28] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:28] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-17 16:49:28] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:49:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 16:49:28] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:28] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:49:28] [INFO ] After 28ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:28] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-17 16:49:28] [INFO ] After 244ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1320032 steps, run timeout after 3001 ms. (steps per millisecond=439 ) properties seen :{}
Probabilistic random walk after 1320032 steps, saw 189666 distinct states, run finished after 3001 ms. (steps per millisecond=439 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:49:31] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:31] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:49:31] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:49:31] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:49:31] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:31] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:49:31] [INFO ] After 26ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:31] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-17 16:49:31] [INFO ] After 240ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:49:31] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:31] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:49:32] [INFO ] Implicit Places using invariants in 146 ms returned []
[2022-05-17 16:49:32] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:32] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:49:32] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:49:32] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
[2022-05-17 16:49:32] [INFO ] Redundant transitions in 9 ms returned []
[2022-05-17 16:49:32] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:32] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:49:32] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 5 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
[2022-05-17 16:49:32] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:49:32] [INFO ] After 12ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:49:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:49:33] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:33] [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.
[2022-05-17 16:49:33] [INFO ] After 17ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:33] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:49:33] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:49:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9272259533841113652.gal : 1 ms
[2022-05-17 16:49:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4824317203860866635.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9272259533841113652.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4824317203860866635.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality4824317203860866635.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001174,3460,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001412,3900,2,3,6,12,7,0,16,6,0
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 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1330749 steps, run timeout after 3001 ms. (steps per millisecond=443 ) properties seen :{}
Probabilistic random walk after 1330749 steps, saw 191855 distinct states, run finished after 3001 ms. (steps per millisecond=443 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:49:36] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:36] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:49:36] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:49:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:49:36] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:36] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:49:36] [INFO ] After 34ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:36] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-17 16:49:36] [INFO ] After 249ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1326185 steps, run timeout after 3001 ms. (steps per millisecond=441 ) properties seen :{}
Probabilistic random walk after 1326185 steps, saw 191378 distinct states, run finished after 3001 ms. (steps per millisecond=441 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:49:39] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:39] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:49:39] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:49:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:49:39] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:39] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:49:39] [INFO ] After 32ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:39] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 16:49:39] [INFO ] After 241ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:49:39] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:39] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:49:39] [INFO ] Implicit Places using invariants in 149 ms returned []
[2022-05-17 16:49:39] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:39] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:49:40] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:49:40] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
[2022-05-17 16:49:40] [INFO ] Redundant transitions in 4 ms returned []
[2022-05-17 16:49:40] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:40] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:49:40] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 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
[2022-05-17 16:49:40] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:49:40] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:49:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:49:40] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:40] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:49:40] [INFO ] After 21ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:40] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:49:40] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:49:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9441223143026002900.gal : 1 ms
[2022-05-17 16:49:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10690105969691855549.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9441223143026002900.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10690105969691855549.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality10690105969691855549.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.002165,3456,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.002623,3896,2,3,6,12,7,0,16,6,0
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 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1314348 steps, run timeout after 3001 ms. (steps per millisecond=437 ) properties seen :{}
Probabilistic random walk after 1314348 steps, saw 188812 distinct states, run finished after 3001 ms. (steps per millisecond=437 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:49:43] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:43] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:49:43] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:49:43] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:49:44] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:44] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:49:44] [INFO ] After 39ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:44] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-17 16:49:44] [INFO ] After 247ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1329489 steps, run timeout after 3001 ms. (steps per millisecond=443 ) properties seen :{}
Probabilistic random walk after 1329489 steps, saw 191737 distinct states, run finished after 3001 ms. (steps per millisecond=443 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:49:47] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:47] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:49:47] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:49:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:49:47] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:47] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:49:47] [INFO ] After 38ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:47] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-17 16:49:47] [INFO ] After 255ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2022-05-17 16:49:47] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:47] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:49:47] [INFO ] Implicit Places using invariants in 140 ms returned []
[2022-05-17 16:49:47] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:47] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:49:47] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:49:48] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
[2022-05-17 16:49:48] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-17 16:49:48] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:48] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:49:48] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 5 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
[2022-05-17 16:49:48] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:49:48] [INFO ] After 12ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:49:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:49:48] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:48] [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 0 ms.
[2022-05-17 16:49:48] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:48] [INFO ] Flatten gal took : 4 ms
[2022-05-17 16:49:48] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:49:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12697959213965551126.gal : 0 ms
[2022-05-17 16:49:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3877365624870328851.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12697959213965551126.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3877365624870328851.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality3877365624870328851.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001567,3460,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001907,3900,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1336923 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :{}
Probabilistic random walk after 1336923 steps, saw 192502 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:49:51] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:51] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:49:51] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:49:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:49:51] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:51] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:49:51] [INFO ] After 26ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:51] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-17 16:49:51] [INFO ] After 244ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1340416 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :{}
Probabilistic random walk after 1340416 steps, saw 193025 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:49:54] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:54] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:49:55] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:49:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:49:55] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:55] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:49:55] [INFO ] After 25ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:55] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-17 16:49:55] [INFO ] After 244ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:49:55] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:55] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:49:55] [INFO ] Implicit Places using invariants in 174 ms returned []
[2022-05-17 16:49:55] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:55] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:49:55] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:49:56] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
[2022-05-17 16:49:56] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-17 16:49:56] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:56] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:49:56] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 1 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
[2022-05-17 16:49:56] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:49:56] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:49:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:49:56] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:56] [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.
[2022-05-17 16:49:56] [INFO ] After 18ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:56] [INFO ] Flatten gal took : 2 ms
[2022-05-17 16:49:56] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:49:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17348087634565498498.gal : 0 ms
[2022-05-17 16:49:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12994360559981709723.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17348087634565498498.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12994360559981709723.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality12994360559981709723.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.002569,3456,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.003109,3896,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1330049 steps, run timeout after 3001 ms. (steps per millisecond=443 ) properties seen :{}
Probabilistic random walk after 1330049 steps, saw 191820 distinct states, run finished after 3001 ms. (steps per millisecond=443 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:49:59] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:49:59] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:49:59] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:49:59] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:49:59] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:59] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:49:59] [INFO ] After 29ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:49:59] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-05-17 16:49:59] [INFO ] After 244ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 1336580 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :{}
Probabilistic random walk after 1336580 steps, saw 192458 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:50:02] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:02] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:50:02] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:50:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:50:02] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:02] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:50:02] [INFO ] After 27ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:02] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-05-17 16:50:03] [INFO ] After 228ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:50:03] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:03] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:50:03] [INFO ] Implicit Places using invariants in 143 ms returned []
[2022-05-17 16:50:03] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:03] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:50:03] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:50:03] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
[2022-05-17 16:50:03] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-17 16:50:03] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:03] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:50:04] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 6 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
[2022-05-17 16:50:04] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:50:04] [INFO ] After 13ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:50:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:50:04] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:04] [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.
[2022-05-17 16:50:04] [INFO ] After 18ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:04] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:50:04] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:50:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17769159431725931728.gal : 0 ms
[2022-05-17 16:50:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15315816949654945210.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17769159431725931728.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15315816949654945210.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality15315816949654945210.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001212,3460,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001462,3900,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 1318275 steps, run timeout after 3001 ms. (steps per millisecond=439 ) properties seen :{}
Probabilistic random walk after 1318275 steps, saw 189386 distinct states, run finished after 3001 ms. (steps per millisecond=439 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:50:07] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:07] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:50:07] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:50:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:50:07] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:07] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:50:07] [INFO ] After 36ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:07] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 16:50:07] [INFO ] After 248ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1335642 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :{}
Probabilistic random walk after 1335642 steps, saw 192387 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:50:10] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:10] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:50:10] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:50:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:50:10] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:10] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:50:10] [INFO ] After 34ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:10] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-17 16:50:10] [INFO ] After 263ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2022-05-17 16:50:10] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:10] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-17 16:50:10] [INFO ] Implicit Places using invariants in 151 ms returned []
[2022-05-17 16:50:10] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:10] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:50:11] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:50:11] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
[2022-05-17 16:50:11] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-17 16:50:11] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:11] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:50:11] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 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.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 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
[2022-05-17 16:50:11] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:50:11] [INFO ] After 12ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:50:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:50:11] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:11] [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.
[2022-05-17 16:50:11] [INFO ] After 20ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:11] [INFO ] Flatten gal took : 5 ms
[2022-05-17 16:50:11] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:50:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11843623259119699460.gal : 4 ms
[2022-05-17 16:50:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2565676688368585393.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11843623259119699460.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2565676688368585393.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality2565676688368585393.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001473,3456,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001764,3896,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1333297 steps, run timeout after 3001 ms. (steps per millisecond=444 ) properties seen :{}
Probabilistic random walk after 1333297 steps, saw 192120 distinct states, run finished after 3001 ms. (steps per millisecond=444 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:50:14] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:14] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:50:14] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:50:14] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:50:15] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:15] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:50:15] [INFO ] After 27ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:15] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:50:15] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2022-05-17 16:50:15] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2022-05-17 16:50:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 209 ms
[2022-05-17 16:50:15] [INFO ] After 259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 16:50:15] [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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1338337 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :{}
Probabilistic random walk after 1338337 steps, saw 192694 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:50:18] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:18] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:50:18] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:50:18] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 16:50:18] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:18] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:50:18] [INFO ] After 31ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:18] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:50:18] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2022-05-17 16:50:18] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2022-05-17 16:50:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 218 ms
[2022-05-17 16:50:18] [INFO ] After 266ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-17 16:50:18] [INFO ] After 446ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:50:18] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:18] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:50:19] [INFO ] Implicit Places using invariants in 148 ms returned []
[2022-05-17 16:50:19] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:19] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:50:19] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:50:19] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
[2022-05-17 16:50:19] [INFO ] Redundant transitions in 9 ms returned []
[2022-05-17 16:50:19] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:19] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:50:19] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 0 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 4 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
[2022-05-17 16:50:19] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:50:19] [INFO ] After 12ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:50:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:50:19] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:19] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:50:19] [INFO ] After 18ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:19] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:50:19] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:50:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17058460262270446432.gal : 1 ms
[2022-05-17 16:50:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1206597636259888754.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17058460262270446432.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1206597636259888754.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality1206597636259888754.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001362,3456,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001608,3896,2,3,6,12,7,0,16,6,0
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 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1336713 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :{}
Probabilistic random walk after 1336713 steps, saw 192458 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:50:23] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:23] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:50:23] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:50:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:50:23] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:23] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:50:23] [INFO ] After 33ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:23] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 16:50:23] [INFO ] After 241ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1340255 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :{}
Probabilistic random walk after 1340255 steps, saw 192987 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:50:26] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:26] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:50:26] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:50:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:50:26] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:50:26] [INFO ] After 36ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:26] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-17 16:50:26] [INFO ] After 251ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:50:26] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:26] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:50:26] [INFO ] Implicit Places using invariants in 146 ms returned []
[2022-05-17 16:50:26] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:26] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:50:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:50:27] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
[2022-05-17 16:50:27] [INFO ] Redundant transitions in 9 ms returned []
[2022-05-17 16:50:27] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:27] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:50:27] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 0 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 4 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
[2022-05-17 16:50:27] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:50:27] [INFO ] After 12ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:50:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:50:27] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:27] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:50:27] [INFO ] After 17ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:27] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:50:27] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:50:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15752788664591089949.gal : 1 ms
[2022-05-17 16:50:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality463097734014377899.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15752788664591089949.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality463097734014377899.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality463097734014377899.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001175,3456,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001409,3896,2,3,6,12,7,0,16,6,0
ITS tools runner thread asked to quit. Dying gracefully.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1336377 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :{}
Probabilistic random walk after 1336377 steps, saw 192443 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:50:30] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:30] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:50:30] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:50:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:50:30] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:30] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:50:30] [INFO ] After 30ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:31] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:50:31] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:50:31] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:50:31] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:50:31] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:50:31] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:50:31] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:50:31] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:50:31] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 788 ms
[2022-05-17 16:50:31] [INFO ] After 832ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 16:50:31] [INFO ] After 1015ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 1340717 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :{}
Probabilistic random walk after 1340717 steps, saw 193050 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:50:34] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:34] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:50:34] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:50:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:50:35] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:35] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:50:35] [INFO ] After 32ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:35] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:50:35] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:50:35] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:50:35] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:50:35] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:50:35] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:50:35] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:50:35] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:50:35] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 776 ms
[2022-05-17 16:50:35] [INFO ] After 824ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-17 16:50:35] [INFO ] After 1012ms 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 SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2022-05-17 16:50:35] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:35] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:50:36] [INFO ] Implicit Places using invariants in 158 ms returned []
[2022-05-17 16:50:36] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:36] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:50:36] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:50:36] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
[2022-05-17 16:50:36] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-17 16:50:36] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:36] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:50:36] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 0 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.1 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 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
[2022-05-17 16:50:36] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:50:36] [INFO ] After 13ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:50:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 16:50:36] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:36] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:50:36] [INFO ] After 16ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:36] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:50:36] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:50:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8775705253812508403.gal : 0 ms
[2022-05-17 16:50:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15536813740715284872.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8775705253812508403.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15536813740715284872.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality15536813740715284872.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001358,3452,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001607,3892,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1332079 steps, run timeout after 3001 ms. (steps per millisecond=443 ) properties seen :{}
Probabilistic random walk after 1332079 steps, saw 192000 distinct states, run finished after 3001 ms. (steps per millisecond=443 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:50:40] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:40] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:50:40] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:50:40] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:50:40] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:40] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:50:40] [INFO ] After 31ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:40] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-17 16:50:40] [INFO ] After 233ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1328453 steps, run timeout after 3001 ms. (steps per millisecond=442 ) properties seen :{}
Probabilistic random walk after 1328453 steps, saw 191614 distinct states, run finished after 3001 ms. (steps per millisecond=442 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:50:43] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:43] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:50:43] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:50:43] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:50:43] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:43] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:50:43] [INFO ] After 29ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:43] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 16:50:43] [INFO ] After 236ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:50:43] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:43] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:50:43] [INFO ] Implicit Places using invariants in 147 ms returned []
[2022-05-17 16:50:43] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:43] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:50:43] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:50:44] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
[2022-05-17 16:50:44] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-17 16:50:44] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:44] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:50:44] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 0 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 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
[2022-05-17 16:50:44] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:50:44] [INFO ] After 12ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:50:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:50:44] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:44] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:50:44] [INFO ] After 18ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:44] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:50:44] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:50:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12829980860234317304.gal : 0 ms
[2022-05-17 16:50:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8695506441456461386.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12829980860234317304.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8695506441456461386.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality8695506441456461386.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001366,3452,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.00161,3892,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1328117 steps, run timeout after 3001 ms. (steps per millisecond=442 ) properties seen :{}
Probabilistic random walk after 1328117 steps, saw 191597 distinct states, run finished after 3001 ms. (steps per millisecond=442 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:50:47] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:47] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:50:47] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:50:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:50:47] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:47] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:50:48] [INFO ] After 43ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:48] [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 18 ms.
[2022-05-17 16:50:48] [INFO ] After 251ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1330483 steps, run timeout after 3001 ms. (steps per millisecond=443 ) properties seen :{}
Probabilistic random walk after 1330483 steps, saw 191846 distinct states, run finished after 3001 ms. (steps per millisecond=443 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:50:51] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:51] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:50:51] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:50:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:50:51] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:51] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:50:51] [INFO ] After 39ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:51] [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 15 ms.
[2022-05-17 16:50:51] [INFO ] After 245ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:50:51] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:51] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:50:51] [INFO ] Implicit Places using invariants in 146 ms returned []
[2022-05-17 16:50:51] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:51] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:50:51] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:50:52] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
[2022-05-17 16:50:52] [INFO ] Redundant transitions in 9 ms returned []
[2022-05-17 16:50:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:52] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:50:52] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 0 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 4 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
[2022-05-17 16:50:52] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:50:52] [INFO ] After 13ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:50:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:50:52] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:52] [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.
[2022-05-17 16:50:52] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:52] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:50:52] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:50:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1019678093934627647.gal : 1 ms
[2022-05-17 16:50:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8899675942704134652.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1019678093934627647.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8899675942704134652.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality8899675942704134652.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001282,3452,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.00153,3892,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1337399 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :{}
Probabilistic random walk after 1337399 steps, saw 192606 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:50:55] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:55] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:50:55] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:50:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:50:55] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:55] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:50:55] [INFO ] After 31ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:55] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 16:50:55] [INFO ] After 239ms 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 SAFETY 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 1 iterations. 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 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1342915 steps, run timeout after 3001 ms. (steps per millisecond=447 ) properties seen :{}
Probabilistic random walk after 1342915 steps, saw 193454 distinct states, run finished after 3001 ms. (steps per millisecond=447 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:50:58] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:58] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:50:58] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:50:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:50:59] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:59] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:50:59] [INFO ] After 30ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:50:59] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-05-17 16:50:59] [INFO ] After 244ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2022-05-17 16:50:59] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:59] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:50:59] [INFO ] Implicit Places using invariants in 148 ms returned []
[2022-05-17 16:50:59] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:59] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:50:59] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:50:59] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
[2022-05-17 16:50:59] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-17 16:50:59] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:50:59] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:51:00] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 0 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 6 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
[2022-05-17 16:51:00] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:51:00] [INFO ] After 13ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:51:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 16:51:00] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:00] [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.
[2022-05-17 16:51:00] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:00] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:51:00] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:51:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6387087887457997395.gal : 1 ms
[2022-05-17 16:51:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2030923392851743230.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6387087887457997395.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2030923392851743230.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality2030923392851743230.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001276,3448,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001524,3888,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1334270 steps, run timeout after 3001 ms. (steps per millisecond=444 ) properties seen :{}
Probabilistic random walk after 1334270 steps, saw 192210 distinct states, run finished after 3001 ms. (steps per millisecond=444 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:51:03] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:51:03] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:51:03] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:51:03] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:51:03] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:03] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:51:03] [INFO ] After 30ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:03] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 16:51:03] [INFO ] After 236ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 1338134 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :{}
Probabilistic random walk after 1338134 steps, saw 192679 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:51:06] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:51:06] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:51:06] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:51:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:51:06] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:51:06] [INFO ] After 30ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:06] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-17 16:51:06] [INFO ] After 241ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:51:06] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:51:06] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:51:07] [INFO ] Implicit Places using invariants in 146 ms returned []
[2022-05-17 16:51:07] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:51:07] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:51:07] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:51:07] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
[2022-05-17 16:51:07] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-17 16:51:07] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:51:07] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:51:07] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 0 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 6 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
[2022-05-17 16:51:07] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:51:07] [INFO ] After 12ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:51:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 16:51:07] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:07] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:51:07] [INFO ] After 18ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:07] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:51:07] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:51:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1036499264520686265.gal : 1 ms
[2022-05-17 16:51:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8858995942401744824.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1036499264520686265.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8858995942401744824.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality8858995942401744824.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.002146,3456,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.002596,3896,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 1338176 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :{}
Probabilistic random walk after 1338176 steps, saw 192686 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:51:10] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:51:10] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:51:11] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:51:11] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:51:11] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:11] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:51:11] [INFO ] After 28ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:11] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:51:11] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:51:11] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:51:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 306 ms
[2022-05-17 16:51:11] [INFO ] After 351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-17 16:51:11] [INFO ] After 527ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1344658 steps, run timeout after 3001 ms. (steps per millisecond=448 ) properties seen :{}
Probabilistic random walk after 1344658 steps, saw 193657 distinct states, run finished after 3001 ms. (steps per millisecond=448 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:51:14] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:51:14] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:51:14] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:51:14] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:51:14] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:14] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:51:14] [INFO ] After 26ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:14] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:51:15] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:51:15] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:51:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 300 ms
[2022-05-17 16:51:15] [INFO ] After 344ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-17 16:51:15] [INFO ] After 525ms 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 SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:51:15] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:51:15] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:51:15] [INFO ] Implicit Places using invariants in 150 ms returned []
[2022-05-17 16:51:15] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:51:15] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:51:15] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:51:15] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
[2022-05-17 16:51:15] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-17 16:51:15] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:51:15] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:51:16] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 0 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 6 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
[2022-05-17 16:51:16] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:51:16] [INFO ] After 12ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:51:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:51:16] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:16] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:51:16] [INFO ] After 18ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:16] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:51:16] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:51:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8215114720798386920.gal : 0 ms
[2022-05-17 16:51:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4392116647932812088.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8215114720798386920.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4392116647932812088.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality4392116647932812088.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.008304,3452,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.008549,3892,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1346387 steps, run timeout after 3001 ms. (steps per millisecond=448 ) properties seen :{}
Probabilistic random walk after 1346387 steps, saw 193920 distinct states, run finished after 3001 ms. (steps per millisecond=448 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:51:19] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:51:19] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:51:19] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:51:19] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:51:19] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:19] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:51:19] [INFO ] After 28ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:19] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-17 16:51:19] [INFO ] After 232ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 1343734 steps, run timeout after 3001 ms. (steps per millisecond=447 ) properties seen :{}
Probabilistic random walk after 1343734 steps, saw 193522 distinct states, run finished after 3001 ms. (steps per millisecond=447 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:51:22] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:51:22] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:51:22] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:51:22] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:51:22] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:22] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:51:22] [INFO ] After 30ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:22] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-05-17 16:51:22] [INFO ] After 240ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2022-05-17 16:51:22] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:51:22] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:51:23] [INFO ] Implicit Places using invariants in 166 ms returned []
[2022-05-17 16:51:23] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:51:23] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:51:23] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:51:23] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
[2022-05-17 16:51:23] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-17 16:51:23] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:51:23] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:51:23] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 1 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 0 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 4 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
[2022-05-17 16:51:23] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:51:23] [INFO ] After 12ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:51:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:51:23] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:23] [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.
[2022-05-17 16:51:23] [INFO ] After 17ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:23] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:51:23] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:51:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3466061275010924569.gal : 1 ms
[2022-05-17 16:51:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality850062126636236364.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3466061275010924569.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality850062126636236364.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality850062126636236364.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.00126,3456,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001675,3896,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1342271 steps, run timeout after 3001 ms. (steps per millisecond=447 ) properties seen :{}
Probabilistic random walk after 1342271 steps, saw 193299 distinct states, run finished after 3001 ms. (steps per millisecond=447 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:51:27] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:51:27] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:51:27] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:51:27] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:51:27] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:27] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:51:27] [INFO ] After 32ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:27] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2022-05-17 16:51:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2022-05-17 16:51:27] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 16:51:27] [INFO ] After 293ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1342369 steps, run timeout after 3001 ms. (steps per millisecond=447 ) properties seen :{}
Probabilistic random walk after 1342369 steps, saw 193304 distinct states, run finished after 3001 ms. (steps per millisecond=447 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:51:30] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:51:30] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:51:30] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:51:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:51:30] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:30] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:51:30] [INFO ] After 30ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:30] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2022-05-17 16:51:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2022-05-17 16:51:30] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-17 16:51:30] [INFO ] After 324ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:51:30] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:51:30] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:51:30] [INFO ] Implicit Places using invariants in 156 ms returned []
[2022-05-17 16:51:30] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:51:30] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:51:31] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:51:31] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 808 ms to find 0 implicit places.
[2022-05-17 16:51:31] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-17 16:51:31] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:51:31] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:51:31] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 0 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 6 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
[2022-05-17 16:51:31] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:51:31] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:51:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 16:51:31] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:31] [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.
[2022-05-17 16:51:31] [INFO ] After 18ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:31] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:51:31] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:51:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4348700523719523392.gal : 0 ms
[2022-05-17 16:51:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15171400471274226694.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14736498769191451156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4348700523719523392.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15171400471274226694.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality15171400471274226694.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001208,3456,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001467,3896,2,3,6,12,7,0,16,6,0
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 1293733 steps, run timeout after 3001 ms. (steps per millisecond=431 ) properties seen :{}
Probabilistic random walk after 1293733 steps, saw 187095 distinct states, run finished after 3001 ms. (steps per millisecond=431 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:51:34] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:51:34] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:51:34] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:51:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:51:35] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:35] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:51:35] [INFO ] After 33ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:35] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-17 16:51:35] [INFO ] After 242ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1296449 steps, run timeout after 3001 ms. (steps per millisecond=432 ) properties seen :{}
Probabilistic random walk after 1296449 steps, saw 187453 distinct states, run finished after 3001 ms. (steps per millisecond=432 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:51:38] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:51:38] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:51:38] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:51:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:51:38] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:38] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:51:38] [INFO ] After 35ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:51:38] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-17 16:51:38] [INFO ] After 248ms 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 SAFETY 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 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY 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.
[2022-05-17 16:51:38] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:51:38] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:51:38] [INFO ] Implicit Places using invariants in 156 ms returned []
[2022-05-17 16:51:38] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:51:38] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:51:38] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:51:39] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
[2022-05-17 16:51:39] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-17 16:51:39] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:51:39] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:51:39] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 1 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 0 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.
========== file over 1MB has been truncated ======
retrieve it from the run archives if needed
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="itstools"
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-4028"
echo " Executing tool itstools"
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 r175-tall-165277023900049"
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 ;