About the Execution of ITS-Tools for Peterson-PT-4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6265.472 | 1587473.00 | 4366589.00 | 2384.80 | FTTTFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r268-smll-171654407300268.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Peterson-PT-4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654407300268
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 48K Apr 12 02:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 222K Apr 12 02:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 12 02:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 270K Apr 12 02:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 75K Apr 12 03:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 304K Apr 12 03:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 212K Apr 12 03:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 982K Apr 12 03:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 298K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-PT-4-LTLFireability-00
FORMULA_NAME Peterson-PT-4-LTLFireability-01
FORMULA_NAME Peterson-PT-4-LTLFireability-02
FORMULA_NAME Peterson-PT-4-LTLFireability-03
FORMULA_NAME Peterson-PT-4-LTLFireability-04
FORMULA_NAME Peterson-PT-4-LTLFireability-05
FORMULA_NAME Peterson-PT-4-LTLFireability-06
FORMULA_NAME Peterson-PT-4-LTLFireability-07
FORMULA_NAME Peterson-PT-4-LTLFireability-08
FORMULA_NAME Peterson-PT-4-LTLFireability-09
FORMULA_NAME Peterson-PT-4-LTLFireability-10
FORMULA_NAME Peterson-PT-4-LTLFireability-11
FORMULA_NAME Peterson-PT-4-LTLFireability-12
FORMULA_NAME Peterson-PT-4-LTLFireability-13
FORMULA_NAME Peterson-PT-4-LTLFireability-14
FORMULA_NAME Peterson-PT-4-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716767119189
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-26 23:45:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 23:45:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 23:45:21] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2024-05-26 23:45:21] [INFO ] Transformed 480 places.
[2024-05-26 23:45:21] [INFO ] Transformed 690 transitions.
[2024-05-26 23:45:21] [INFO ] Found NUPN structural information;
[2024-05-26 23:45:21] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 323 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Peterson-PT-4-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 383 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 33 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-05-26 23:45:21] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-05-26 23:45:21] [INFO ] Computed 19 invariants in 30 ms
[2024-05-26 23:45:22] [INFO ] Implicit Places using invariants in 686 ms returned []
[2024-05-26 23:45:22] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-05-26 23:45:22] [INFO ] Invariant cache hit.
[2024-05-26 23:45:23] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-26 23:45:23] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 1398 ms to find 0 implicit places.
Running 685 sub problems to find dead transitions.
[2024-05-26 23:45:23] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-05-26 23:45:23] [INFO ] Invariant cache hit.
[2024-05-26 23:45:23] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 475/475 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (OVERLAPS) 5/480 variables, 10/489 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 5/494 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 23:45:44] [INFO ] Deduced a trap composed of 10 places in 281 ms of which 39 ms to minimize.
[2024-05-26 23:45:44] [INFO ] Deduced a trap composed of 35 places in 385 ms of which 11 ms to minimize.
[2024-05-26 23:45:44] [INFO ] Deduced a trap composed of 27 places in 248 ms of which 3 ms to minimize.
[2024-05-26 23:45:45] [INFO ] Deduced a trap composed of 36 places in 282 ms of which 4 ms to minimize.
[2024-05-26 23:45:45] [INFO ] Deduced a trap composed of 36 places in 255 ms of which 5 ms to minimize.
[2024-05-26 23:45:45] [INFO ] Deduced a trap composed of 45 places in 274 ms of which 4 ms to minimize.
[2024-05-26 23:45:45] [INFO ] Deduced a trap composed of 54 places in 264 ms of which 4 ms to minimize.
[2024-05-26 23:45:46] [INFO ] Deduced a trap composed of 32 places in 286 ms of which 5 ms to minimize.
[2024-05-26 23:45:46] [INFO ] Deduced a trap composed of 58 places in 209 ms of which 4 ms to minimize.
[2024-05-26 23:45:46] [INFO ] Deduced a trap composed of 14 places in 300 ms of which 5 ms to minimize.
[2024-05-26 23:45:47] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 5 ms to minimize.
[2024-05-26 23:45:47] [INFO ] Deduced a trap composed of 13 places in 287 ms of which 5 ms to minimize.
[2024-05-26 23:45:47] [INFO ] Deduced a trap composed of 18 places in 280 ms of which 4 ms to minimize.
[2024-05-26 23:45:47] [INFO ] Deduced a trap composed of 10 places in 293 ms of which 4 ms to minimize.
[2024-05-26 23:45:48] [INFO ] Deduced a trap composed of 54 places in 216 ms of which 3 ms to minimize.
[2024-05-26 23:45:48] [INFO ] Deduced a trap composed of 60 places in 126 ms of which 3 ms to minimize.
[2024-05-26 23:45:48] [INFO ] Deduced a trap composed of 64 places in 150 ms of which 3 ms to minimize.
[2024-05-26 23:45:48] [INFO ] Deduced a trap composed of 39 places in 215 ms of which 4 ms to minimize.
[2024-05-26 23:45:48] [INFO ] Deduced a trap composed of 40 places in 220 ms of which 4 ms to minimize.
[2024-05-26 23:45:49] [INFO ] Deduced a trap composed of 18 places in 279 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 20/519 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/1110 variables, and 519 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30051 ms.
Refiners :[Domain max(s): 480/480 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 685/685 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 475/475 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 20/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (OVERLAPS) 5/480 variables, 10/509 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/514 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 5/519 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 23:46:02] [INFO ] Deduced a trap composed of 14 places in 263 ms of which 4 ms to minimize.
[2024-05-26 23:46:02] [INFO ] Deduced a trap composed of 57 places in 220 ms of which 4 ms to minimize.
[2024-05-26 23:46:03] [INFO ] Deduced a trap composed of 86 places in 229 ms of which 3 ms to minimize.
[2024-05-26 23:46:03] [INFO ] Deduced a trap composed of 83 places in 211 ms of which 4 ms to minimize.
[2024-05-26 23:46:03] [INFO ] Deduced a trap composed of 84 places in 211 ms of which 3 ms to minimize.
[2024-05-26 23:46:03] [INFO ] Deduced a trap composed of 65 places in 203 ms of which 3 ms to minimize.
[2024-05-26 23:46:04] [INFO ] Deduced a trap composed of 62 places in 241 ms of which 5 ms to minimize.
[2024-05-26 23:46:04] [INFO ] Deduced a trap composed of 62 places in 304 ms of which 11 ms to minimize.
[2024-05-26 23:46:04] [INFO ] Deduced a trap composed of 96 places in 156 ms of which 3 ms to minimize.
[2024-05-26 23:46:04] [INFO ] Deduced a trap composed of 39 places in 251 ms of which 3 ms to minimize.
[2024-05-26 23:46:05] [INFO ] Deduced a trap composed of 61 places in 203 ms of which 3 ms to minimize.
[2024-05-26 23:46:05] [INFO ] Deduced a trap composed of 61 places in 151 ms of which 4 ms to minimize.
[2024-05-26 23:46:05] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 3 ms to minimize.
[2024-05-26 23:46:05] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 3 ms to minimize.
[2024-05-26 23:46:06] [INFO ] Deduced a trap composed of 21 places in 275 ms of which 8 ms to minimize.
[2024-05-26 23:46:06] [INFO ] Deduced a trap composed of 40 places in 198 ms of which 3 ms to minimize.
[2024-05-26 23:46:06] [INFO ] Deduced a trap composed of 25 places in 205 ms of which 4 ms to minimize.
[2024-05-26 23:46:06] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 4 ms to minimize.
[2024-05-26 23:46:06] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 4 ms to minimize.
[2024-05-26 23:46:07] [INFO ] Deduced a trap composed of 65 places in 203 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 20/539 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 23:46:08] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 3 ms to minimize.
[2024-05-26 23:46:08] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 4 ms to minimize.
[2024-05-26 23:46:08] [INFO ] Deduced a trap composed of 102 places in 264 ms of which 4 ms to minimize.
[2024-05-26 23:46:09] [INFO ] Deduced a trap composed of 62 places in 255 ms of which 4 ms to minimize.
[2024-05-26 23:46:09] [INFO ] Deduced a trap composed of 48 places in 213 ms of which 3 ms to minimize.
[2024-05-26 23:46:09] [INFO ] Deduced a trap composed of 62 places in 262 ms of which 4 ms to minimize.
[2024-05-26 23:46:09] [INFO ] Deduced a trap composed of 62 places in 230 ms of which 4 ms to minimize.
[2024-05-26 23:46:10] [INFO ] Deduced a trap composed of 43 places in 296 ms of which 5 ms to minimize.
[2024-05-26 23:46:10] [INFO ] Deduced a trap composed of 91 places in 163 ms of which 2 ms to minimize.
[2024-05-26 23:46:10] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-05-26 23:46:10] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 3 ms to minimize.
[2024-05-26 23:46:10] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 2 ms to minimize.
[2024-05-26 23:46:11] [INFO ] Deduced a trap composed of 80 places in 138 ms of which 3 ms to minimize.
[2024-05-26 23:46:11] [INFO ] Deduced a trap composed of 58 places in 154 ms of which 4 ms to minimize.
[2024-05-26 23:46:11] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 3 ms to minimize.
[2024-05-26 23:46:11] [INFO ] Deduced a trap composed of 54 places in 143 ms of which 3 ms to minimize.
[2024-05-26 23:46:11] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 6 ms to minimize.
[2024-05-26 23:46:12] [INFO ] Deduced a trap composed of 43 places in 166 ms of which 4 ms to minimize.
[2024-05-26 23:46:12] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 3 ms to minimize.
[2024-05-26 23:46:12] [INFO ] Deduced a trap composed of 50 places in 133 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 20/559 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 23:46:15] [INFO ] Deduced a trap composed of 88 places in 165 ms of which 3 ms to minimize.
[2024-05-26 23:46:15] [INFO ] Deduced a trap composed of 87 places in 159 ms of which 3 ms to minimize.
[2024-05-26 23:46:15] [INFO ] Deduced a trap composed of 87 places in 170 ms of which 3 ms to minimize.
[2024-05-26 23:46:15] [INFO ] Deduced a trap composed of 112 places in 164 ms of which 4 ms to minimize.
[2024-05-26 23:46:15] [INFO ] Deduced a trap composed of 128 places in 163 ms of which 3 ms to minimize.
[2024-05-26 23:46:16] [INFO ] Deduced a trap composed of 36 places in 307 ms of which 5 ms to minimize.
[2024-05-26 23:46:16] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 3 ms to minimize.
[2024-05-26 23:46:16] [INFO ] Deduced a trap composed of 35 places in 256 ms of which 4 ms to minimize.
[2024-05-26 23:46:16] [INFO ] Deduced a trap composed of 76 places in 140 ms of which 3 ms to minimize.
[2024-05-26 23:46:17] [INFO ] Deduced a trap composed of 76 places in 153 ms of which 3 ms to minimize.
[2024-05-26 23:46:17] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 2 ms to minimize.
[2024-05-26 23:46:17] [INFO ] Deduced a trap composed of 58 places in 139 ms of which 2 ms to minimize.
[2024-05-26 23:46:17] [INFO ] Deduced a trap composed of 76 places in 148 ms of which 2 ms to minimize.
[2024-05-26 23:46:17] [INFO ] Deduced a trap composed of 76 places in 158 ms of which 3 ms to minimize.
[2024-05-26 23:46:18] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 3 ms to minimize.
[2024-05-26 23:46:18] [INFO ] Deduced a trap composed of 92 places in 159 ms of which 3 ms to minimize.
[2024-05-26 23:46:18] [INFO ] Deduced a trap composed of 92 places in 158 ms of which 3 ms to minimize.
[2024-05-26 23:46:18] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 2 ms to minimize.
[2024-05-26 23:46:18] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 2 ms to minimize.
[2024-05-26 23:46:18] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 20/579 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 23:46:22] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-05-26 23:46:22] [INFO ] Deduced a trap composed of 54 places in 204 ms of which 3 ms to minimize.
[2024-05-26 23:46:22] [INFO ] Deduced a trap composed of 84 places in 185 ms of which 3 ms to minimize.
[2024-05-26 23:46:23] [INFO ] Deduced a trap composed of 84 places in 187 ms of which 3 ms to minimize.
[2024-05-26 23:46:23] [INFO ] Deduced a trap composed of 83 places in 190 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/1110 variables, and 584 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30018 ms.
Refiners :[Domain max(s): 480/480 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/685 constraints, Known Traps: 85/85 constraints]
After SMT, in 60428ms problems are : Problem set: 0 solved, 685 unsolved
Search for dead transitions found 0 dead transitions in 60473ms
Finished structural reductions in LTL mode , in 1 iterations and 61946 ms. Remains : 480/480 places, 690/690 transitions.
Support contains 383 out of 480 places after structural reductions.
[2024-05-26 23:46:24] [INFO ] Flatten gal took : 102 ms
[2024-05-26 23:46:24] [INFO ] Flatten gal took : 66 ms
[2024-05-26 23:46:24] [INFO ] Input system was already deterministic with 690 transitions.
Reduction of identical properties reduced properties to check from 29 to 25
RANDOM walk for 40000 steps (8 resets) in 3171 ms. (12 steps per ms) remains 10/25 properties
BEST_FIRST walk for 40004 steps (8 resets) in 539 ms. (74 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 10/10 properties
[2024-05-26 23:46:25] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-05-26 23:46:25] [INFO ] Invariant cache hit.
[2024-05-26 23:46:25] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp17 is UNSAT
At refinement iteration 4 (OVERLAPS) 437/465 variables, 10/44 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 437/481 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-26 23:46:26] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-05-26 23:46:26] [INFO ] Deduced a trap composed of 128 places in 105 ms of which 2 ms to minimize.
[2024-05-26 23:46:26] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
[2024-05-26 23:46:26] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 3 ms to minimize.
[2024-05-26 23:46:26] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 2 ms to minimize.
[2024-05-26 23:46:26] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 3 ms to minimize.
[2024-05-26 23:46:26] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-05-26 23:46:26] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-26 23:46:26] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-05-26 23:46:26] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-05-26 23:46:27] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 3 ms to minimize.
[2024-05-26 23:46:27] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 3 ms to minimize.
[2024-05-26 23:46:27] [INFO ] Deduced a trap composed of 144 places in 105 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 13/494 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-26 23:46:27] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-26 23:46:27] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-26 23:46:27] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 3/497 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-26 23:46:28] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 1/498 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-26 23:46:28] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 2 ms to minimize.
[2024-05-26 23:46:28] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 2/500 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/500 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 630/1095 variables, 465/965 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1095 variables, 116/1081 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-26 23:46:29] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1095 variables, 1/1082 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1095 variables, 0/1082 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 15/1110 variables, 15/1097 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1110 variables, 15/1112 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1110 variables, 3/1115 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1110 variables, 0/1115 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 0/1110 variables, 0/1115 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 1115 constraints, problems are : Problem set: 1 solved, 9 unsolved in 4551 ms.
Refiners :[Domain max(s): 480/480 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 5/30 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 436/460 variables, 9/39 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 436/475 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 4/479 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 0/479 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 630/1090 variables, 460/939 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1090 variables, 116/1055 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 8/1063 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1090 variables, 0/1063 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 20/1110 variables, 20/1083 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1110 variables, 20/1103 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1110 variables, 4/1107 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1110 variables, 1/1108 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1110 variables, 16/1124 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-26 23:46:32] [INFO ] Deduced a trap composed of 69 places in 246 ms of which 4 ms to minimize.
[2024-05-26 23:46:32] [INFO ] Deduced a trap composed of 101 places in 253 ms of which 4 ms to minimize.
[2024-05-26 23:46:32] [INFO ] Deduced a trap composed of 101 places in 250 ms of which 3 ms to minimize.
[2024-05-26 23:46:32] [INFO ] Deduced a trap composed of 91 places in 244 ms of which 4 ms to minimize.
[2024-05-26 23:46:33] [INFO ] Deduced a trap composed of 48 places in 264 ms of which 4 ms to minimize.
[2024-05-26 23:46:33] [INFO ] Deduced a trap composed of 39 places in 211 ms of which 3 ms to minimize.
[2024-05-26 23:46:33] [INFO ] Deduced a trap composed of 93 places in 264 ms of which 4 ms to minimize.
[2024-05-26 23:46:33] [INFO ] Deduced a trap composed of 69 places in 242 ms of which 3 ms to minimize.
[2024-05-26 23:46:34] [INFO ] Deduced a trap composed of 93 places in 249 ms of which 4 ms to minimize.
[2024-05-26 23:46:34] [INFO ] Deduced a trap composed of 40 places in 248 ms of which 4 ms to minimize.
[2024-05-26 23:46:34] [INFO ] Deduced a trap composed of 39 places in 249 ms of which 4 ms to minimize.
[2024-05-26 23:46:35] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 4 ms to minimize.
[2024-05-26 23:46:35] [INFO ] Deduced a trap composed of 91 places in 201 ms of which 3 ms to minimize.
SMT process timed out in 9668ms, After SMT, problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 186 transitions
Trivial Post-agglo rules discarded 186 transitions
Performed 186 trivial Post agglomeration. Transition count delta: 186
Iterating post reduction 0 with 186 rules applied. Total rules applied 186 place count 480 transition count 504
Reduce places removed 186 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 190 rules applied. Total rules applied 376 place count 294 transition count 500
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 380 place count 290 transition count 500
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 380 place count 290 transition count 405
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 570 place count 195 transition count 405
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 596 place count 182 transition count 392
Applied a total of 596 rules in 103 ms. Remains 182 /480 variables (removed 298) and now considering 392/690 (removed 298) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 182/480 places, 392/690 transitions.
RANDOM walk for 40000 steps (8 resets) in 466 ms. (85 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 8/8 properties
[2024-05-26 23:46:35] [INFO ] Flow matrix only has 332 transitions (discarded 60 similar events)
// Phase 1: matrix 332 rows 182 cols
[2024-05-26 23:46:35] [INFO ] Computed 19 invariants in 3 ms
[2024-05-26 23:46:36] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 139/162 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 139/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-26 23:46:36] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 2 ms to minimize.
[2024-05-26 23:46:36] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 332/494 variables, 162/341 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 116/457 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 20/514 variables, 20/477 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/514 variables, 20/497 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/514 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/514 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/514 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 501 constraints, problems are : Problem set: 0 solved, 8 unsolved in 756 ms.
Refiners :[Domain max(s): 182/182 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 182/182 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 139/162 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 139/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-26 23:46:36] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 2 ms to minimize.
[2024-05-26 23:46:37] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 332/494 variables, 162/343 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 116/459 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/494 variables, 7/466 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/494 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 20/514 variables, 20/486 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/514 variables, 20/506 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/514 variables, 4/510 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/514 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-26 23:46:37] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 2 ms to minimize.
[2024-05-26 23:46:37] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 2 ms to minimize.
[2024-05-26 23:46:37] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
[2024-05-26 23:46:37] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2024-05-26 23:46:37] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-26 23:46:38] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-26 23:46:38] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2024-05-26 23:46:38] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-26 23:46:38] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-26 23:46:38] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-26 23:46:38] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-26 23:46:38] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-26 23:46:38] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-05-26 23:46:38] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-26 23:46:38] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-26 23:46:38] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-05-26 23:46:38] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-26 23:46:39] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-05-26 23:46:39] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 2 ms to minimize.
[2024-05-26 23:46:39] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/514 variables, 20/531 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-26 23:46:39] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 3 ms to minimize.
[2024-05-26 23:46:39] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-26 23:46:39] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-05-26 23:46:39] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-05-26 23:46:39] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2024-05-26 23:46:39] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-05-26 23:46:39] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
[2024-05-26 23:46:39] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-26 23:46:40] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-26 23:46:40] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-26 23:46:40] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-05-26 23:46:40] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-26 23:46:40] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-05-26 23:46:40] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-05-26 23:46:40] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-05-26 23:46:40] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2024-05-26 23:46:40] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-26 23:46:40] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-05-26 23:46:40] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-26 23:46:41] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/514 variables, 20/551 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-26 23:46:41] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 2 ms to minimize.
[2024-05-26 23:46:41] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-26 23:46:41] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-26 23:46:41] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-26 23:46:41] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-05-26 23:46:41] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2024-05-26 23:46:41] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2024-05-26 23:46:42] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/514 variables, 8/559 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/514 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 0/514 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 514/514 variables, and 559 constraints, problems are : Problem set: 0 solved, 8 unsolved in 6034 ms.
Refiners :[Domain max(s): 182/182 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 182/182 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 52/52 constraints]
After SMT, in 6803ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 2 properties in 2056 ms.
Support contains 9 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 392/392 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 182 transition count 391
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 181 transition count 391
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 2 place count 181 transition count 384
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 16 place count 174 transition count 384
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 170 transition count 380
Applied a total of 24 rules in 41 ms. Remains 170 /182 variables (removed 12) and now considering 380/392 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 170/182 places, 380/392 transitions.
RANDOM walk for 40000 steps (8 resets) in 211 ms. (188 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 577758 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :0 out of 6
Probabilistic random walk after 577758 steps, saw 96685 distinct states, run finished after 3006 ms. (steps per millisecond=192 ) properties seen :0
[2024-05-26 23:46:48] [INFO ] Flow matrix only has 320 transitions (discarded 60 similar events)
// Phase 1: matrix 320 rows 170 cols
[2024-05-26 23:46:48] [INFO ] Computed 19 invariants in 2 ms
[2024-05-26 23:46:48] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 81/90 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 81/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 2/92 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 2/94 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 23:46:48] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 2 ms to minimize.
[2024-05-26 23:46:48] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/94 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/94 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 196/290 variables, 94/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/290 variables, 48/247 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/290 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 52/342 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/342 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/342 variables, 4/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/342 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 80/422 variables, 16/307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/422 variables, 16/323 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/422 variables, 68/391 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/422 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 36/458 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/458 variables, 36/429 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/458 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 2/460 variables, 2/431 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/460 variables, 2/433 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/460 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (OVERLAPS) 2/462 variables, 2/435 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/462 variables, 2/437 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/462 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (OVERLAPS) 28/490 variables, 40/477 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/490 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (OVERLAPS) 0/490 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 477 constraints, problems are : Problem set: 0 solved, 6 unsolved in 999 ms.
Refiners :[Domain max(s): 170/170 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 81/90 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 81/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 2/92 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 2/94 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/94 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/94 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 196/290 variables, 94/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/290 variables, 48/247 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/290 variables, 6/253 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/290 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 52/342 variables, 20/273 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/342 variables, 20/293 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/342 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 23:46:49] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-05-26 23:46:49] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-26 23:46:49] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-26 23:46:49] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-05-26 23:46:49] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-26 23:46:50] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/342 variables, 6/303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/342 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 80/422 variables, 16/319 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/422 variables, 16/335 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/422 variables, 68/403 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 23:46:50] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-05-26 23:46:50] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-26 23:46:50] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/422 variables, 3/406 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/422 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 36/458 variables, 2/408 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/458 variables, 36/444 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 23:46:50] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
[2024-05-26 23:46:50] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-26 23:46:50] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-26 23:46:50] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-05-26 23:46:51] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-05-26 23:46:51] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
[2024-05-26 23:46:51] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-05-26 23:46:51] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-05-26 23:46:51] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
[2024-05-26 23:46:51] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-05-26 23:46:51] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-05-26 23:46:51] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/458 variables, 12/456 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 23:46:51] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/458 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/458 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (OVERLAPS) 2/460 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/460 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 23:46:52] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/460 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/460 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (OVERLAPS) 2/462 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/462 variables, 2/466 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 23:46:52] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-05-26 23:46:52] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
[2024-05-26 23:46:52] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 2 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/462 variables, 3/469 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/462 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (OVERLAPS) 28/490 variables, 40/509 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/490 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 43 (OVERLAPS) 0/490 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 490/490 variables, and 509 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3717 ms.
Refiners :[Domain max(s): 170/170 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 28/28 constraints]
After SMT, in 4729ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 1315 ms.
Support contains 9 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 380/380 transitions.
Applied a total of 0 rules in 15 ms. Remains 170 /170 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 170/170 places, 380/380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 380/380 transitions.
Applied a total of 0 rules in 13 ms. Remains 170 /170 variables (removed 0) and now considering 380/380 (removed 0) transitions.
[2024-05-26 23:46:54] [INFO ] Flow matrix only has 320 transitions (discarded 60 similar events)
[2024-05-26 23:46:54] [INFO ] Invariant cache hit.
[2024-05-26 23:46:54] [INFO ] Implicit Places using invariants in 270 ms returned [161, 162, 163, 164]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 273 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 166/170 places, 380/380 transitions.
Applied a total of 0 rules in 12 ms. Remains 166 /166 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 300 ms. Remains : 166/170 places, 380/380 transitions.
RANDOM walk for 40000 steps (8 resets) in 277 ms. (143 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 542394 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 6
Probabilistic random walk after 542394 steps, saw 90824 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
[2024-05-26 23:46:57] [INFO ] Flow matrix only has 320 transitions (discarded 60 similar events)
// Phase 1: matrix 320 rows 166 cols
[2024-05-26 23:46:57] [INFO ] Computed 15 invariants in 3 ms
[2024-05-26 23:46:57] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 81/90 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 81/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 23:46:58] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 2 ms to minimize.
[2024-05-26 23:46:58] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2/92 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 196/288 variables, 92/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/288 variables, 48/241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/288 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 52/340 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/340 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/340 variables, 4/285 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/340 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 80/420 variables, 16/301 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 16/317 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/420 variables, 68/385 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/420 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 36/456 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/456 variables, 36/423 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/456 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 2/458 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/458 variables, 2/427 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/458 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 28/486 variables, 38/465 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/486 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 0/486 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 465 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1311 ms.
Refiners :[Domain max(s): 166/166 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 166/166 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 81/90 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 81/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2/92 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 196/288 variables, 92/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/288 variables, 48/241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/288 variables, 6/247 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/288 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 52/340 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/340 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/340 variables, 4/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 23:46:59] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-26 23:46:59] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-26 23:46:59] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-26 23:46:59] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-26 23:46:59] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/340 variables, 5/296 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/340 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 80/420 variables, 16/312 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/420 variables, 16/328 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/420 variables, 68/396 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 23:47:00] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-26 23:47:00] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-05-26 23:47:00] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
[2024-05-26 23:47:00] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 14 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/420 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/420 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 36/456 variables, 2/402 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/456 variables, 36/438 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 23:47:00] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-26 23:47:00] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2024-05-26 23:47:00] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 2 ms to minimize.
[2024-05-26 23:47:01] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 6 ms to minimize.
[2024-05-26 23:47:01] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-26 23:47:01] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 2 ms to minimize.
[2024-05-26 23:47:01] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2024-05-26 23:47:01] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-26 23:47:01] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-26 23:47:01] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-26 23:47:01] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2024-05-26 23:47:01] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 2 ms to minimize.
[2024-05-26 23:47:01] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-05-26 23:47:01] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-05-26 23:47:02] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/456 variables, 15/453 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 23:47:02] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/456 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 23:47:02] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/456 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 23:47:02] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/456 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/456 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 2/458 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/458 variables, 2/460 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/458 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 28/486 variables, 38/498 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 23:47:02] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/486 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/486 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 0/486 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 486/486 variables, and 499 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3997 ms.
Refiners :[Domain max(s): 166/166 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 166/166 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 30/30 constraints]
After SMT, in 5331ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 1 properties in 1134 ms.
Support contains 8 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 380/380 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 166 transition count 379
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 165 transition count 379
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 165 transition count 378
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 164 transition count 378
Applied a total of 4 rules in 24 ms. Remains 164 /166 variables (removed 2) and now considering 378/380 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 164/166 places, 378/380 transitions.
RANDOM walk for 40000 steps (8 resets) in 254 ms. (156 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 589992 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :0 out of 5
Probabilistic random walk after 589992 steps, saw 98805 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
[2024-05-26 23:47:07] [INFO ] Flow matrix only has 318 transitions (discarded 60 similar events)
// Phase 1: matrix 318 rows 164 cols
[2024-05-26 23:47:07] [INFO ] Computed 15 invariants in 3 ms
[2024-05-26 23:47:07] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 80/88 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-26 23:47:07] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-05-26 23:47:07] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2/90 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 194/284 variables, 90/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 48/237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 52/336 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/336 variables, 20/277 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/336 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/336 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 80/416 variables, 16/297 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/416 variables, 16/313 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/416 variables, 68/381 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/416 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 36/452 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/452 variables, 36/419 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/452 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 2/454 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/454 variables, 2/423 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/454 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 28/482 variables, 38/461 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/482 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 0/482 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 461 constraints, problems are : Problem set: 0 solved, 5 unsolved in 766 ms.
Refiners :[Domain max(s): 164/164 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 80/88 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2/90 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 194/284 variables, 90/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 48/237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 5/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 52/336 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/336 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/336 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-26 23:47:08] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-26 23:47:08] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
[2024-05-26 23:47:08] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-26 23:47:08] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-26 23:47:09] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/336 variables, 5/291 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/336 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 80/416 variables, 16/307 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/416 variables, 16/323 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/416 variables, 68/391 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-26 23:47:09] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-26 23:47:09] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-26 23:47:09] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-26 23:47:09] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-26 23:47:09] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-26 23:47:09] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-26 23:47:09] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-05-26 23:47:09] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-05-26 23:47:09] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/416 variables, 9/400 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/416 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 36/452 variables, 2/402 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/452 variables, 36/438 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-26 23:47:09] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-26 23:47:10] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-05-26 23:47:10] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-05-26 23:47:10] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 1 ms to minimize.
[2024-05-26 23:47:10] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 3 ms to minimize.
[2024-05-26 23:47:10] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-05-26 23:47:10] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2024-05-26 23:47:10] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 2 ms to minimize.
[2024-05-26 23:47:10] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-26 23:47:10] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-26 23:47:10] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-26 23:47:11] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 2 ms to minimize.
[2024-05-26 23:47:11] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-05-26 23:47:11] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/452 variables, 14/452 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-26 23:47:11] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2024-05-26 23:47:11] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/452 variables, 2/454 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/452 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 2/454 variables, 2/456 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/454 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-26 23:47:11] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/454 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-26 23:47:11] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
[2024-05-26 23:47:11] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 2 ms to minimize.
[2024-05-26 23:47:12] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-26 23:47:12] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-05-26 23:47:12] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2024-05-26 23:47:12] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-26 23:47:12] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-26 23:47:12] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
[2024-05-26 23:47:12] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/454 variables, 9/468 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-26 23:47:12] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 2 ms to minimize.
[2024-05-26 23:47:12] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-26 23:47:12] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-26 23:47:12] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/454 variables, 4/472 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/454 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 28/482 variables, 38/510 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-26 23:47:13] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
[2024-05-26 23:47:13] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2024-05-26 23:47:13] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/482 variables, 3/513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-26 23:47:13] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
[2024-05-26 23:47:13] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/482 variables, 2/515 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/482 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (OVERLAPS) 0/482 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 515 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5429 ms.
Refiners :[Domain max(s): 164/164 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 51/51 constraints]
After SMT, in 6208ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 1 properties in 660 ms.
Support contains 7 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 378/378 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 164 transition count 377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 163 transition count 377
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 2 with 2 rules applied. Total rules applied 4 place count 162 transition count 376
Applied a total of 4 rules in 17 ms. Remains 162 /164 variables (removed 2) and now considering 376/378 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 162/164 places, 376/378 transitions.
RANDOM walk for 40000 steps (8 resets) in 140 ms. (283 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 3/3 properties
[2024-05-26 23:47:14] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 162 cols
[2024-05-26 23:47:14] [INFO ] Computed 15 invariants in 1 ms
[2024-05-26 23:47:14] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 80/86 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 80/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/88 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 192/280 variables, 88/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/280 variables, 48/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/280 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 52/332 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/332 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/332 variables, 4/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/332 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 80/412 variables, 16/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/412 variables, 16/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/412 variables, 68/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/412 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 36/448 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/448 variables, 36/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/448 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 2/450 variables, 2/415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/450 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/450 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 28/478 variables, 38/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/478 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/478 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 455 constraints, problems are : Problem set: 0 solved, 3 unsolved in 446 ms.
Refiners :[Domain max(s): 162/162 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 80/86 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 80/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/88 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 192/280 variables, 88/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/280 variables, 48/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/280 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 52/332 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/332 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/332 variables, 4/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 23:47:15] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
[2024-05-26 23:47:15] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/332 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/332 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 80/412 variables, 16/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/412 variables, 16/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/412 variables, 68/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 23:47:15] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-26 23:47:15] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-26 23:47:15] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 2 ms to minimize.
[2024-05-26 23:47:15] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/412 variables, 4/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/412 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 36/448 variables, 2/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/448 variables, 36/422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 23:47:16] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2024-05-26 23:47:16] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
[2024-05-26 23:47:16] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-26 23:47:16] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-26 23:47:16] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-05-26 23:47:16] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2024-05-26 23:47:16] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-26 23:47:16] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-26 23:47:16] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-26 23:47:16] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-05-26 23:47:17] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-26 23:47:17] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-05-26 23:47:17] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-05-26 23:47:17] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-05-26 23:47:17] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-26 23:47:17] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-26 23:47:17] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-26 23:47:17] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-26 23:47:17] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-05-26 23:47:17] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/448 variables, 20/442 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/448 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 2/450 variables, 2/444 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/450 variables, 2/446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/450 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 28/478 variables, 38/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/478 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 0/478 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 478/478 variables, and 484 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2929 ms.
Refiners :[Domain max(s): 162/162 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 26/26 constraints]
After SMT, in 3387ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 252 ms.
Support contains 6 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 376/376 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 161 transition count 375
Applied a total of 2 rules in 24 ms. Remains 161 /162 variables (removed 1) and now considering 375/376 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 161/162 places, 375/376 transitions.
RANDOM walk for 40000 steps (8 resets) in 152 ms. (261 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 775638 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :0 out of 3
Probabilistic random walk after 775638 steps, saw 129686 distinct states, run finished after 3001 ms. (steps per millisecond=258 ) properties seen :0
[2024-05-26 23:47:21] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 161 cols
[2024-05-26 23:47:21] [INFO ] Computed 15 invariants in 2 ms
[2024-05-26 23:47:21] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 79/85 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 79/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/87 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 191/278 variables, 87/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 48/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/278 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 52/330 variables, 20/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/330 variables, 20/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/330 variables, 4/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 80/410 variables, 16/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/410 variables, 16/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/410 variables, 68/373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/410 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 36/446 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/446 variables, 36/411 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/446 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 2/448 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/448 variables, 2/415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/448 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 28/476 variables, 38/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/476 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/476 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 453 constraints, problems are : Problem set: 0 solved, 3 unsolved in 450 ms.
Refiners :[Domain max(s): 161/161 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 79/85 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 79/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/87 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 191/278 variables, 87/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 48/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/278 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/278 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 52/330 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/330 variables, 20/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 4/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 23:47:22] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-26 23:47:22] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-05-26 23:47:22] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-26 23:47:22] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-26 23:47:22] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/330 variables, 5/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/330 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 80/410 variables, 16/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/410 variables, 16/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/410 variables, 68/381 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 23:47:22] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/410 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/410 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 36/446 variables, 2/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/446 variables, 36/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 23:47:22] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-05-26 23:47:22] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-05-26 23:47:23] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-26 23:47:23] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-05-26 23:47:23] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 2 ms to minimize.
[2024-05-26 23:47:23] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/446 variables, 6/426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/446 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 2/448 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/448 variables, 2/430 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/448 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 28/476 variables, 38/468 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 23:47:23] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2024-05-26 23:47:23] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2024-05-26 23:47:23] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-05-26 23:47:23] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-26 23:47:23] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-26 23:47:24] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-05-26 23:47:24] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-26 23:47:24] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
[2024-05-26 23:47:24] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-05-26 23:47:24] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-26 23:47:24] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2024-05-26 23:47:24] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/476 variables, 12/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 23:47:24] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/476 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/476 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 0/476 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 476/476 variables, and 481 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2971 ms.
Refiners :[Domain max(s): 161/161 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 25/25 constraints]
After SMT, in 3434ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 265 ms.
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 375/375 transitions.
Applied a total of 0 rules in 8 ms. Remains 161 /161 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 161/161 places, 375/375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 375/375 transitions.
Applied a total of 0 rules in 7 ms. Remains 161 /161 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2024-05-26 23:47:25] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
[2024-05-26 23:47:25] [INFO ] Invariant cache hit.
[2024-05-26 23:47:25] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-26 23:47:25] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
[2024-05-26 23:47:25] [INFO ] Invariant cache hit.
[2024-05-26 23:47:25] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-26 23:47:26] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
[2024-05-26 23:47:26] [INFO ] Redundant transitions in 27 ms returned []
Running 370 sub problems to find dead transitions.
[2024-05-26 23:47:26] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
[2024-05-26 23:47:26] [INFO ] Invariant cache hit.
[2024-05-26 23:47:26] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 12/172 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-05-26 23:47:27] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
[2024-05-26 23:47:28] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-26 23:47:28] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-26 23:47:28] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-05-26 23:47:28] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-26 23:47:28] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-26 23:47:28] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-26 23:47:28] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-26 23:47:28] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-26 23:47:28] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-26 23:47:28] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-26 23:47:28] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
[2024-05-26 23:47:28] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-05-26 23:47:28] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-26 23:47:29] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-26 23:47:29] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-26 23:47:29] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-26 23:47:29] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-26 23:47:29] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-26 23:47:29] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-05-26 23:47:29] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-26 23:47:29] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-26 23:47:29] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-26 23:47:29] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
[2024-05-26 23:47:29] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-26 23:47:29] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 2 ms to minimize.
[2024-05-26 23:47:30] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-26 23:47:30] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-26 23:47:30] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-26 23:47:30] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-26 23:47:30] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-26 23:47:30] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 2 ms to minimize.
[2024-05-26 23:47:30] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-26 23:47:30] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-26 23:47:30] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-26 23:47:30] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-26 23:47:30] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-26 23:47:31] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 2 ms to minimize.
[2024-05-26 23:47:31] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 2 ms to minimize.
[2024-05-26 23:47:31] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-05-26 23:47:32] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-26 23:47:33] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 2 ms to minimize.
[2024-05-26 23:47:33] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 2 ms to minimize.
[2024-05-26 23:47:33] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-26 23:47:33] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-26 23:47:33] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-26 23:47:33] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-26 23:47:34] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-26 23:47:34] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2024-05-26 23:47:34] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2024-05-26 23:47:34] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-05-26 23:47:34] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-26 23:47:34] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-26 23:47:34] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-05-26 23:47:35] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-26 23:47:35] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-26 23:47:35] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-26 23:47:35] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-26 23:47:35] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-26 23:47:35] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-05-26 23:47:36] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 2 ms to minimize.
[2024-05-26 23:47:37] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-05-26 23:47:37] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 3/235 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-05-26 23:47:39] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-26 23:47:39] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-05-26 23:47:42] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-26 23:47:42] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 9 (OVERLAPS) 1/161 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/161 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-05-26 23:47:47] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2024-05-26 23:47:47] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-05-26 23:47:47] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-26 23:47:47] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-05-26 23:47:47] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-05-26 23:47:47] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-05-26 23:47:47] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-05-26 23:47:47] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 2 ms to minimize.
[2024-05-26 23:47:47] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-26 23:47:48] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 2 ms to minimize.
[2024-05-26 23:47:48] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-26 23:47:48] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-26 23:47:48] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-26 23:47:48] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-26 23:47:48] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-26 23:47:48] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-26 23:47:48] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-26 23:47:48] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-26 23:47:48] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-26 23:47:49] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/161 variables, 20/263 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-05-26 23:47:51] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-05-26 23:47:51] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-26 23:47:51] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-26 23:47:52] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-26 23:47:52] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-05-26 23:47:53] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-05-26 23:47:53] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-26 23:47:53] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-26 23:47:53] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-05-26 23:47:53] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-26 23:47:53] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-26 23:47:53] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-26 23:47:53] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-26 23:47:53] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-05-26 23:47:54] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
[2024-05-26 23:47:54] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-26 23:47:54] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-26 23:47:54] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 2 ms to minimize.
[2024-05-26 23:47:54] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-05-26 23:47:55] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/161 variables, 20/283 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 161/476 variables, and 283 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30015 ms.
Refiners :[Domain max(s): 161/161 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/161 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 107/107 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 12/172 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 105/277 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-05-26 23:47:58] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-26 23:47:58] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-26 23:47:58] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-05-26 23:47:59] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
[2024-05-26 23:48:00] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (OVERLAPS) 1/161 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-05-26 23:48:06] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2024-05-26 23:48:07] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2024-05-26 23:48:07] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-05-26 23:48:08] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-05-26 23:48:08] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-26 23:48:08] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-26 23:48:08] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-26 23:48:09] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-26 23:48:09] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 9/297 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-05-26 23:48:12] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-26 23:48:12] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-26 23:48:12] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/161 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-05-26 23:48:15] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-05-26 23:48:16] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/161 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-05-26 23:48:19] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2024-05-26 23:48:20] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/161 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-05-26 23:48:22] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-26 23:48:23] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-26 23:48:24] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 2 ms to minimize.
[2024-05-26 23:48:24] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/161 variables, 4/308 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 161/476 variables, and 308 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30011 ms.
Refiners :[Domain max(s): 161/161 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/161 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/370 constraints, Known Traps: 132/132 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60939 ms. Remains : 161/161 places, 375/375 transitions.
FORMULA Peterson-PT-4-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA Peterson-PT-4-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 85 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-05-26 23:48:26] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-05-26 23:48:26] [INFO ] Computed 19 invariants in 4 ms
[2024-05-26 23:48:26] [INFO ] Implicit Places using invariants in 249 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 251 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 13 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 273 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 286 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 655 ms.
Product exploration explored 100000 steps with 50000 reset in 608 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-4-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-4-LTLFireability-01 finished in 1942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X(X((p1 U (F(p3)||p2)))))))'
Support contains 140 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-05-26 23:48:28] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-05-26 23:48:28] [INFO ] Invariant cache hit.
[2024-05-26 23:48:29] [INFO ] Implicit Places using invariants in 501 ms returned []
[2024-05-26 23:48:29] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-05-26 23:48:29] [INFO ] Invariant cache hit.
[2024-05-26 23:48:29] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-26 23:48:29] [INFO ] Implicit Places using invariants and state equation in 939 ms returned []
Implicit Place search using SMT with State Equation took 1444 ms to find 0 implicit places.
Running 685 sub problems to find dead transitions.
[2024-05-26 23:48:29] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-05-26 23:48:29] [INFO ] Invariant cache hit.
[2024-05-26 23:48:29] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 475/475 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (OVERLAPS) 5/480 variables, 10/489 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 5/494 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 23:48:50] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 5 ms to minimize.
[2024-05-26 23:48:51] [INFO ] Deduced a trap composed of 35 places in 269 ms of which 4 ms to minimize.
[2024-05-26 23:48:51] [INFO ] Deduced a trap composed of 27 places in 241 ms of which 4 ms to minimize.
[2024-05-26 23:48:51] [INFO ] Deduced a trap composed of 36 places in 253 ms of which 4 ms to minimize.
[2024-05-26 23:48:51] [INFO ] Deduced a trap composed of 36 places in 253 ms of which 4 ms to minimize.
[2024-05-26 23:48:52] [INFO ] Deduced a trap composed of 45 places in 355 ms of which 6 ms to minimize.
[2024-05-26 23:48:52] [INFO ] Deduced a trap composed of 54 places in 349 ms of which 4 ms to minimize.
[2024-05-26 23:48:52] [INFO ] Deduced a trap composed of 32 places in 275 ms of which 4 ms to minimize.
[2024-05-26 23:48:53] [INFO ] Deduced a trap composed of 58 places in 220 ms of which 4 ms to minimize.
[2024-05-26 23:48:53] [INFO ] Deduced a trap composed of 14 places in 296 ms of which 4 ms to minimize.
[2024-05-26 23:48:53] [INFO ] Deduced a trap composed of 17 places in 282 ms of which 4 ms to minimize.
[2024-05-26 23:48:54] [INFO ] Deduced a trap composed of 13 places in 295 ms of which 6 ms to minimize.
[2024-05-26 23:48:54] [INFO ] Deduced a trap composed of 18 places in 384 ms of which 6 ms to minimize.
[2024-05-26 23:48:54] [INFO ] Deduced a trap composed of 10 places in 299 ms of which 4 ms to minimize.
[2024-05-26 23:48:55] [INFO ] Deduced a trap composed of 54 places in 236 ms of which 5 ms to minimize.
[2024-05-26 23:48:55] [INFO ] Deduced a trap composed of 60 places in 224 ms of which 5 ms to minimize.
[2024-05-26 23:48:55] [INFO ] Deduced a trap composed of 64 places in 214 ms of which 3 ms to minimize.
[2024-05-26 23:48:55] [INFO ] Deduced a trap composed of 39 places in 250 ms of which 4 ms to minimize.
[2024-05-26 23:48:56] [INFO ] Deduced a trap composed of 40 places in 258 ms of which 4 ms to minimize.
[2024-05-26 23:48:56] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 20/519 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/1110 variables, and 519 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30018 ms.
Refiners :[Domain max(s): 480/480 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 685/685 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 475/475 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 20/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (OVERLAPS) 5/480 variables, 10/509 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/514 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 5/519 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 23:49:08] [INFO ] Deduced a trap composed of 14 places in 252 ms of which 4 ms to minimize.
[2024-05-26 23:49:09] [INFO ] Deduced a trap composed of 57 places in 172 ms of which 4 ms to minimize.
[2024-05-26 23:49:09] [INFO ] Deduced a trap composed of 86 places in 209 ms of which 4 ms to minimize.
[2024-05-26 23:49:09] [INFO ] Deduced a trap composed of 83 places in 215 ms of which 3 ms to minimize.
[2024-05-26 23:49:09] [INFO ] Deduced a trap composed of 84 places in 220 ms of which 4 ms to minimize.
[2024-05-26 23:49:10] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 4 ms to minimize.
[2024-05-26 23:49:10] [INFO ] Deduced a trap composed of 62 places in 211 ms of which 3 ms to minimize.
[2024-05-26 23:49:10] [INFO ] Deduced a trap composed of 62 places in 205 ms of which 3 ms to minimize.
[2024-05-26 23:49:10] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 3 ms to minimize.
[2024-05-26 23:49:10] [INFO ] Deduced a trap composed of 39 places in 243 ms of which 4 ms to minimize.
[2024-05-26 23:49:11] [INFO ] Deduced a trap composed of 61 places in 191 ms of which 3 ms to minimize.
[2024-05-26 23:49:11] [INFO ] Deduced a trap composed of 61 places in 195 ms of which 3 ms to minimize.
[2024-05-26 23:49:11] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 4 ms to minimize.
[2024-05-26 23:49:11] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 3 ms to minimize.
[2024-05-26 23:49:12] [INFO ] Deduced a trap composed of 21 places in 266 ms of which 4 ms to minimize.
[2024-05-26 23:49:12] [INFO ] Deduced a trap composed of 40 places in 251 ms of which 4 ms to minimize.
[2024-05-26 23:49:12] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 3 ms to minimize.
[2024-05-26 23:49:12] [INFO ] Deduced a trap composed of 65 places in 209 ms of which 3 ms to minimize.
[2024-05-26 23:49:13] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 3 ms to minimize.
[2024-05-26 23:49:13] [INFO ] Deduced a trap composed of 65 places in 206 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 20/539 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 23:49:14] [INFO ] Deduced a trap composed of 32 places in 224 ms of which 3 ms to minimize.
[2024-05-26 23:49:14] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 4 ms to minimize.
[2024-05-26 23:49:15] [INFO ] Deduced a trap composed of 102 places in 266 ms of which 5 ms to minimize.
[2024-05-26 23:49:15] [INFO ] Deduced a trap composed of 62 places in 258 ms of which 4 ms to minimize.
[2024-05-26 23:49:15] [INFO ] Deduced a trap composed of 48 places in 210 ms of which 4 ms to minimize.
[2024-05-26 23:49:16] [INFO ] Deduced a trap composed of 62 places in 257 ms of which 4 ms to minimize.
[2024-05-26 23:49:16] [INFO ] Deduced a trap composed of 62 places in 209 ms of which 3 ms to minimize.
[2024-05-26 23:49:16] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 3 ms to minimize.
[2024-05-26 23:49:16] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
[2024-05-26 23:49:16] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 6 ms to minimize.
[2024-05-26 23:49:16] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-05-26 23:49:16] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 2 ms to minimize.
[2024-05-26 23:49:17] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-26 23:49:17] [INFO ] Deduced a trap composed of 58 places in 150 ms of which 2 ms to minimize.
[2024-05-26 23:49:17] [INFO ] Deduced a trap composed of 42 places in 182 ms of which 3 ms to minimize.
[2024-05-26 23:49:17] [INFO ] Deduced a trap composed of 54 places in 144 ms of which 3 ms to minimize.
[2024-05-26 23:49:17] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 3 ms to minimize.
[2024-05-26 23:49:18] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 3 ms to minimize.
[2024-05-26 23:49:18] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 2 ms to minimize.
[2024-05-26 23:49:18] [INFO ] Deduced a trap composed of 50 places in 131 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 20/559 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 23:49:21] [INFO ] Deduced a trap composed of 88 places in 180 ms of which 3 ms to minimize.
[2024-05-26 23:49:21] [INFO ] Deduced a trap composed of 87 places in 152 ms of which 2 ms to minimize.
[2024-05-26 23:49:21] [INFO ] Deduced a trap composed of 87 places in 173 ms of which 3 ms to minimize.
[2024-05-26 23:49:21] [INFO ] Deduced a trap composed of 112 places in 157 ms of which 3 ms to minimize.
[2024-05-26 23:49:21] [INFO ] Deduced a trap composed of 128 places in 161 ms of which 4 ms to minimize.
[2024-05-26 23:49:22] [INFO ] Deduced a trap composed of 36 places in 302 ms of which 4 ms to minimize.
[2024-05-26 23:49:22] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 3 ms to minimize.
[2024-05-26 23:49:22] [INFO ] Deduced a trap composed of 35 places in 251 ms of which 4 ms to minimize.
[2024-05-26 23:49:22] [INFO ] Deduced a trap composed of 76 places in 139 ms of which 2 ms to minimize.
[2024-05-26 23:49:23] [INFO ] Deduced a trap composed of 76 places in 156 ms of which 3 ms to minimize.
[2024-05-26 23:49:23] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 2 ms to minimize.
[2024-05-26 23:49:23] [INFO ] Deduced a trap composed of 58 places in 136 ms of which 3 ms to minimize.
[2024-05-26 23:49:23] [INFO ] Deduced a trap composed of 76 places in 151 ms of which 2 ms to minimize.
[2024-05-26 23:49:23] [INFO ] Deduced a trap composed of 76 places in 157 ms of which 3 ms to minimize.
[2024-05-26 23:49:24] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 6 ms to minimize.
[2024-05-26 23:49:24] [INFO ] Deduced a trap composed of 92 places in 157 ms of which 3 ms to minimize.
[2024-05-26 23:49:24] [INFO ] Deduced a trap composed of 92 places in 161 ms of which 3 ms to minimize.
[2024-05-26 23:49:24] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-05-26 23:49:24] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 1 ms to minimize.
[2024-05-26 23:49:24] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 20/579 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 23:49:28] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-05-26 23:49:28] [INFO ] Deduced a trap composed of 54 places in 211 ms of which 3 ms to minimize.
[2024-05-26 23:49:29] [INFO ] Deduced a trap composed of 84 places in 187 ms of which 3 ms to minimize.
[2024-05-26 23:49:29] [INFO ] Deduced a trap composed of 84 places in 197 ms of which 4 ms to minimize.
[2024-05-26 23:49:29] [INFO ] Deduced a trap composed of 83 places in 186 ms of which 3 ms to minimize.
[2024-05-26 23:49:29] [INFO ] Deduced a trap composed of 119 places in 139 ms of which 2 ms to minimize.
[2024-05-26 23:49:30] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 2 ms to minimize.
[2024-05-26 23:49:30] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 2 ms to minimize.
SMT process timed out in 60251ms, After SMT, problems are : Problem set: 0 solved, 685 unsolved
Search for dead transitions found 0 dead transitions in 60262ms
Finished structural reductions in LTL mode , in 1 iterations and 61719 ms. Remains : 480/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 354 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-02
Product exploration explored 100000 steps with 25000 reset in 307 ms.
Product exploration explored 100000 steps with 25000 reset in 318 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 8 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
RANDOM walk for 93 steps (0 resets) in 7 ms. (11 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (NOT p3)), (F p2), (F (NOT (OR p1 p2 p3))), (F (NOT (OR (NOT p1) p2 p3)))]
Knowledge based reduction with 3 factoid took 232 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 191 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 130 out of 480 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-05-26 23:49:32] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-05-26 23:49:32] [INFO ] Invariant cache hit.
[2024-05-26 23:49:32] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-26 23:49:32] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-05-26 23:49:32] [INFO ] Invariant cache hit.
[2024-05-26 23:49:32] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-26 23:49:33] [INFO ] Implicit Places using invariants and state equation in 970 ms returned []
Implicit Place search using SMT with State Equation took 1295 ms to find 0 implicit places.
Running 685 sub problems to find dead transitions.
[2024-05-26 23:49:33] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-05-26 23:49:33] [INFO ] Invariant cache hit.
[2024-05-26 23:49:33] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 475/475 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (OVERLAPS) 5/480 variables, 10/489 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 5/494 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 23:49:54] [INFO ] Deduced a trap composed of 10 places in 299 ms of which 5 ms to minimize.
[2024-05-26 23:49:54] [INFO ] Deduced a trap composed of 35 places in 286 ms of which 4 ms to minimize.
[2024-05-26 23:49:54] [INFO ] Deduced a trap composed of 27 places in 250 ms of which 4 ms to minimize.
[2024-05-26 23:49:55] [INFO ] Deduced a trap composed of 36 places in 289 ms of which 5 ms to minimize.
[2024-05-26 23:49:55] [INFO ] Deduced a trap composed of 36 places in 343 ms of which 4 ms to minimize.
[2024-05-26 23:49:55] [INFO ] Deduced a trap composed of 45 places in 276 ms of which 4 ms to minimize.
[2024-05-26 23:49:56] [INFO ] Deduced a trap composed of 54 places in 297 ms of which 5 ms to minimize.
[2024-05-26 23:49:56] [INFO ] Deduced a trap composed of 32 places in 376 ms of which 4 ms to minimize.
[2024-05-26 23:49:56] [INFO ] Deduced a trap composed of 58 places in 195 ms of which 3 ms to minimize.
[2024-05-26 23:49:57] [INFO ] Deduced a trap composed of 14 places in 291 ms of which 4 ms to minimize.
[2024-05-26 23:49:57] [INFO ] Deduced a trap composed of 17 places in 283 ms of which 4 ms to minimize.
[2024-05-26 23:49:57] [INFO ] Deduced a trap composed of 13 places in 269 ms of which 4 ms to minimize.
[2024-05-26 23:49:57] [INFO ] Deduced a trap composed of 18 places in 267 ms of which 4 ms to minimize.
[2024-05-26 23:49:58] [INFO ] Deduced a trap composed of 10 places in 310 ms of which 5 ms to minimize.
[2024-05-26 23:49:58] [INFO ] Deduced a trap composed of 54 places in 248 ms of which 4 ms to minimize.
[2024-05-26 23:49:58] [INFO ] Deduced a trap composed of 60 places in 146 ms of which 3 ms to minimize.
[2024-05-26 23:49:58] [INFO ] Deduced a trap composed of 64 places in 142 ms of which 3 ms to minimize.
[2024-05-26 23:49:59] [INFO ] Deduced a trap composed of 39 places in 269 ms of which 5 ms to minimize.
[2024-05-26 23:49:59] [INFO ] Deduced a trap composed of 40 places in 258 ms of which 4 ms to minimize.
[2024-05-26 23:49:59] [INFO ] Deduced a trap composed of 18 places in 261 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 20/519 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/1110 variables, and 519 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30028 ms.
Refiners :[Domain max(s): 480/480 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 685/685 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 475/475 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 20/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (OVERLAPS) 5/480 variables, 10/509 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/514 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 5/519 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 23:50:12] [INFO ] Deduced a trap composed of 14 places in 275 ms of which 4 ms to minimize.
[2024-05-26 23:50:12] [INFO ] Deduced a trap composed of 57 places in 226 ms of which 3 ms to minimize.
[2024-05-26 23:50:13] [INFO ] Deduced a trap composed of 86 places in 214 ms of which 3 ms to minimize.
[2024-05-26 23:50:13] [INFO ] Deduced a trap composed of 83 places in 195 ms of which 4 ms to minimize.
[2024-05-26 23:50:13] [INFO ] Deduced a trap composed of 84 places in 218 ms of which 3 ms to minimize.
[2024-05-26 23:50:13] [INFO ] Deduced a trap composed of 65 places in 213 ms of which 3 ms to minimize.
[2024-05-26 23:50:13] [INFO ] Deduced a trap composed of 62 places in 217 ms of which 3 ms to minimize.
[2024-05-26 23:50:14] [INFO ] Deduced a trap composed of 62 places in 224 ms of which 3 ms to minimize.
[2024-05-26 23:50:14] [INFO ] Deduced a trap composed of 96 places in 152 ms of which 3 ms to minimize.
[2024-05-26 23:50:14] [INFO ] Deduced a trap composed of 39 places in 255 ms of which 4 ms to minimize.
[2024-05-26 23:50:14] [INFO ] Deduced a trap composed of 61 places in 196 ms of which 4 ms to minimize.
[2024-05-26 23:50:14] [INFO ] Deduced a trap composed of 61 places in 192 ms of which 3 ms to minimize.
[2024-05-26 23:50:15] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 3 ms to minimize.
[2024-05-26 23:50:15] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 3 ms to minimize.
[2024-05-26 23:50:15] [INFO ] Deduced a trap composed of 21 places in 270 ms of which 4 ms to minimize.
[2024-05-26 23:50:16] [INFO ] Deduced a trap composed of 40 places in 243 ms of which 4 ms to minimize.
[2024-05-26 23:50:16] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 3 ms to minimize.
[2024-05-26 23:50:16] [INFO ] Deduced a trap composed of 65 places in 227 ms of which 5 ms to minimize.
[2024-05-26 23:50:16] [INFO ] Deduced a trap composed of 65 places in 295 ms of which 5 ms to minimize.
[2024-05-26 23:50:17] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 20/539 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 23:50:18] [INFO ] Deduced a trap composed of 32 places in 218 ms of which 3 ms to minimize.
[2024-05-26 23:50:18] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 4 ms to minimize.
[2024-05-26 23:50:18] [INFO ] Deduced a trap composed of 102 places in 270 ms of which 4 ms to minimize.
[2024-05-26 23:50:19] [INFO ] Deduced a trap composed of 62 places in 254 ms of which 5 ms to minimize.
[2024-05-26 23:50:19] [INFO ] Deduced a trap composed of 48 places in 205 ms of which 4 ms to minimize.
[2024-05-26 23:50:19] [INFO ] Deduced a trap composed of 62 places in 209 ms of which 4 ms to minimize.
[2024-05-26 23:50:19] [INFO ] Deduced a trap composed of 62 places in 216 ms of which 4 ms to minimize.
[2024-05-26 23:50:20] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 3 ms to minimize.
[2024-05-26 23:50:20] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 2 ms to minimize.
[2024-05-26 23:50:20] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
[2024-05-26 23:50:20] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
[2024-05-26 23:50:20] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 3 ms to minimize.
[2024-05-26 23:50:20] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 2 ms to minimize.
[2024-05-26 23:50:20] [INFO ] Deduced a trap composed of 58 places in 147 ms of which 3 ms to minimize.
[2024-05-26 23:50:21] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 3 ms to minimize.
[2024-05-26 23:50:21] [INFO ] Deduced a trap composed of 54 places in 157 ms of which 3 ms to minimize.
[2024-05-26 23:50:21] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 3 ms to minimize.
[2024-05-26 23:50:21] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 2 ms to minimize.
[2024-05-26 23:50:21] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 2 ms to minimize.
[2024-05-26 23:50:22] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 20/559 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 23:50:24] [INFO ] Deduced a trap composed of 88 places in 174 ms of which 3 ms to minimize.
[2024-05-26 23:50:24] [INFO ] Deduced a trap composed of 87 places in 149 ms of which 3 ms to minimize.
[2024-05-26 23:50:25] [INFO ] Deduced a trap composed of 87 places in 158 ms of which 3 ms to minimize.
[2024-05-26 23:50:25] [INFO ] Deduced a trap composed of 112 places in 153 ms of which 3 ms to minimize.
[2024-05-26 23:50:25] [INFO ] Deduced a trap composed of 128 places in 161 ms of which 3 ms to minimize.
[2024-05-26 23:50:25] [INFO ] Deduced a trap composed of 36 places in 312 ms of which 4 ms to minimize.
[2024-05-26 23:50:26] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 2 ms to minimize.
[2024-05-26 23:50:26] [INFO ] Deduced a trap composed of 35 places in 273 ms of which 3 ms to minimize.
[2024-05-26 23:50:26] [INFO ] Deduced a trap composed of 76 places in 147 ms of which 3 ms to minimize.
[2024-05-26 23:50:26] [INFO ] Deduced a trap composed of 76 places in 155 ms of which 3 ms to minimize.
[2024-05-26 23:50:26] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 3 ms to minimize.
[2024-05-26 23:50:27] [INFO ] Deduced a trap composed of 58 places in 142 ms of which 3 ms to minimize.
[2024-05-26 23:50:27] [INFO ] Deduced a trap composed of 76 places in 163 ms of which 3 ms to minimize.
[2024-05-26 23:50:27] [INFO ] Deduced a trap composed of 76 places in 164 ms of which 3 ms to minimize.
[2024-05-26 23:50:27] [INFO ] Deduced a trap composed of 92 places in 164 ms of which 3 ms to minimize.
[2024-05-26 23:50:27] [INFO ] Deduced a trap composed of 92 places in 171 ms of which 3 ms to minimize.
[2024-05-26 23:50:28] [INFO ] Deduced a trap composed of 92 places in 161 ms of which 3 ms to minimize.
[2024-05-26 23:50:28] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 2 ms to minimize.
[2024-05-26 23:50:28] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-05-26 23:50:28] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 20/579 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 23:50:32] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 3 ms to minimize.
[2024-05-26 23:50:32] [INFO ] Deduced a trap composed of 54 places in 220 ms of which 3 ms to minimize.
[2024-05-26 23:50:32] [INFO ] Deduced a trap composed of 84 places in 186 ms of which 3 ms to minimize.
[2024-05-26 23:50:32] [INFO ] Deduced a trap composed of 84 places in 190 ms of which 3 ms to minimize.
[2024-05-26 23:50:33] [INFO ] Deduced a trap composed of 83 places in 183 ms of which 3 ms to minimize.
[2024-05-26 23:50:33] [INFO ] Deduced a trap composed of 119 places in 139 ms of which 3 ms to minimize.
[2024-05-26 23:50:33] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 2 ms to minimize.
SMT process timed out in 60271ms, After SMT, problems are : Problem set: 0 solved, 685 unsolved
Search for dead transitions found 0 dead transitions in 60280ms
Finished structural reductions in LTL mode , in 1 iterations and 61583 ms. Remains : 480/480 places, 690/690 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 (NOT p1) (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
RANDOM walk for 143 steps (0 resets) in 9 ms. (14 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p3 (NOT p1) (NOT p2))]
False Knowledge obtained : [(F p1), (F (NOT p3)), (F p2), (F (NOT (OR p1 p2 p3))), (F (NOT (OR (NOT p1) p2 p3)))]
Knowledge based reduction with 1 factoid took 179 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 188 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 191 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 25000 reset in 710 ms.
Product exploration explored 100000 steps with 25000 reset in 537 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 186 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 130 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 480 transition count 690
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 84 place count 480 transition count 690
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 89 place count 480 transition count 690
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 120 place count 480 transition count 690
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 135 place count 465 transition count 675
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 150 place count 465 transition count 675
Deduced a syphon composed of 105 places in 0 ms
Applied a total of 150 rules in 79 ms. Remains 465 /480 variables (removed 15) and now considering 675/690 (removed 15) transitions.
[2024-05-26 23:50:36] [INFO ] Redundant transitions in 10 ms returned []
Running 670 sub problems to find dead transitions.
[2024-05-26 23:50:36] [INFO ] Flow matrix only has 615 transitions (discarded 60 similar events)
// Phase 1: matrix 615 rows 465 cols
[2024-05-26 23:50:36] [INFO ] Computed 19 invariants in 14 ms
[2024-05-26 23:50:36] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 2 (OVERLAPS) 5/465 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 670 unsolved
[2024-05-26 23:50:55] [INFO ] Deduced a trap composed of 33 places in 298 ms of which 5 ms to minimize.
[2024-05-26 23:50:55] [INFO ] Deduced a trap composed of 28 places in 330 ms of which 5 ms to minimize.
[2024-05-26 23:50:55] [INFO ] Deduced a trap composed of 88 places in 327 ms of which 4 ms to minimize.
[2024-05-26 23:50:56] [INFO ] Deduced a trap composed of 60 places in 274 ms of which 4 ms to minimize.
[2024-05-26 23:50:56] [INFO ] Deduced a trap composed of 28 places in 319 ms of which 7 ms to minimize.
[2024-05-26 23:50:56] [INFO ] Deduced a trap composed of 23 places in 407 ms of which 6 ms to minimize.
[2024-05-26 23:50:57] [INFO ] Deduced a trap composed of 25 places in 272 ms of which 3 ms to minimize.
[2024-05-26 23:50:57] [INFO ] Deduced a trap composed of 11 places in 279 ms of which 4 ms to minimize.
[2024-05-26 23:50:57] [INFO ] Deduced a trap composed of 9 places in 265 ms of which 4 ms to minimize.
[2024-05-26 23:50:58] [INFO ] Deduced a trap composed of 12 places in 325 ms of which 6 ms to minimize.
[2024-05-26 23:50:58] [INFO ] Deduced a trap composed of 9 places in 375 ms of which 4 ms to minimize.
[2024-05-26 23:50:58] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 4 ms to minimize.
[2024-05-26 23:50:59] [INFO ] Deduced a trap composed of 9 places in 262 ms of which 4 ms to minimize.
[2024-05-26 23:50:59] [INFO ] Deduced a trap composed of 41 places in 276 ms of which 4 ms to minimize.
[2024-05-26 23:50:59] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 3 ms to minimize.
[2024-05-26 23:50:59] [INFO ] Deduced a trap composed of 47 places in 198 ms of which 3 ms to minimize.
[2024-05-26 23:50:59] [INFO ] Deduced a trap composed of 22 places in 184 ms of which 3 ms to minimize.
[2024-05-26 23:51:00] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-26 23:51:00] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 4 ms to minimize.
[2024-05-26 23:51:00] [INFO ] Deduced a trap composed of 33 places in 266 ms of which 4 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD663 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 20/39 constraints. Problems are: Problem set: 21 solved, 649 unsolved
[2024-05-26 23:51:01] [INFO ] Deduced a trap composed of 44 places in 199 ms of which 3 ms to minimize.
[2024-05-26 23:51:01] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 3 ms to minimize.
[2024-05-26 23:51:01] [INFO ] Deduced a trap composed of 36 places in 194 ms of which 3 ms to minimize.
[2024-05-26 23:51:01] [INFO ] Deduced a trap composed of 41 places in 289 ms of which 5 ms to minimize.
[2024-05-26 23:51:02] [INFO ] Deduced a trap composed of 25 places in 329 ms of which 4 ms to minimize.
[2024-05-26 23:51:02] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 4 ms to minimize.
[2024-05-26 23:51:02] [INFO ] Deduced a trap composed of 48 places in 140 ms of which 4 ms to minimize.
[2024-05-26 23:51:02] [INFO ] Deduced a trap composed of 57 places in 208 ms of which 4 ms to minimize.
[2024-05-26 23:51:02] [INFO ] Deduced a trap composed of 44 places in 216 ms of which 3 ms to minimize.
[2024-05-26 23:51:03] [INFO ] Deduced a trap composed of 60 places in 134 ms of which 3 ms to minimize.
[2024-05-26 23:51:03] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 2 ms to minimize.
[2024-05-26 23:51:03] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-26 23:51:03] [INFO ] Deduced a trap composed of 33 places in 192 ms of which 3 ms to minimize.
[2024-05-26 23:51:03] [INFO ] Deduced a trap composed of 44 places in 231 ms of which 4 ms to minimize.
[2024-05-26 23:51:03] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 3 ms to minimize.
[2024-05-26 23:51:04] [INFO ] Deduced a trap composed of 66 places in 136 ms of which 3 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-26 23:51:04] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 3 ms to minimize.
[2024-05-26 23:51:04] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
[2024-05-26 23:51:04] [INFO ] Deduced a trap composed of 84 places in 158 ms of which 2 ms to minimize.
[2024-05-26 23:51:04] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD669 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 20/59 constraints. Problems are: Problem set: 105 solved, 565 unsolved
[2024-05-26 23:51:05] [INFO ] Deduced a trap composed of 17 places in 245 ms of which 3 ms to minimize.
[2024-05-26 23:51:05] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 3 ms to minimize.
[2024-05-26 23:51:05] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 2 ms to minimize.
[2024-05-26 23:51:06] [INFO ] Deduced a trap composed of 63 places in 189 ms of which 3 ms to minimize.
[2024-05-26 23:51:06] [INFO ] Deduced a trap composed of 47 places in 201 ms of which 3 ms to minimize.
[2024-05-26 23:51:06] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 4 ms to minimize.
[2024-05-26 23:51:06] [INFO ] Deduced a trap composed of 63 places in 307 ms of which 4 ms to minimize.
SMT process timed out in 30206ms, After SMT, problems are : Problem set: 105 solved, 565 unsolved
Search for dead transitions found 105 dead transitions in 30216ms
Found 105 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 105 transitions
Dead transitions reduction (with SMT) removed 105 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 465/480 places, 570/690 transitions.
Graph (complete) has 1210 edges and 465 vertex of which 360 are kept as prefixes of interest. Removing 105 places using SCC suffix rule.7 ms
Discarding 105 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 34 ms. Remains 360 /465 variables (removed 105) and now considering 570/570 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 360/480 places, 570/690 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30352 ms. Remains : 360/480 places, 570/690 transitions.
Built C files in :
/tmp/ltsmin9657269400963750967
[2024-05-26 23:51:06] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9657269400963750967
Running compilation step : cd /tmp/ltsmin9657269400963750967;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2512 ms.
Running link step : cd /tmp/ltsmin9657269400963750967;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin9657269400963750967;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15166354177733391282.hoa' '--buchi-type=spotba'
LTSmin run took 611 ms.
FORMULA Peterson-PT-4-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Peterson-PT-4-LTLFireability-02 finished in 161674 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 40 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-05-26 23:51:10] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-05-26 23:51:10] [INFO ] Computed 19 invariants in 4 ms
[2024-05-26 23:51:10] [INFO ] Implicit Places using invariants in 269 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 271 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 12 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 291 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 493 ms.
Product exploration explored 100000 steps with 50000 reset in 318 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-4-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-4-LTLFireability-03 finished in 1215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 200 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-05-26 23:51:11] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-05-26 23:51:11] [INFO ] Invariant cache hit.
[2024-05-26 23:51:11] [INFO ] Implicit Places using invariants in 262 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 263 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 273 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Peterson-PT-4-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-4-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-4-LTLFireability-04 finished in 408 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)&&X(G(p2)))))))'
Support contains 35 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 480 transition count 498
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 1 with 192 rules applied. Total rules applied 384 place count 288 transition count 498
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 384 place count 288 transition count 399
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 582 place count 189 transition count 399
Applied a total of 582 rules in 22 ms. Remains 189 /480 variables (removed 291) and now considering 399/690 (removed 291) transitions.
[2024-05-26 23:51:11] [INFO ] Flow matrix only has 339 transitions (discarded 60 similar events)
// Phase 1: matrix 339 rows 189 cols
[2024-05-26 23:51:11] [INFO ] Computed 19 invariants in 2 ms
[2024-05-26 23:51:12] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-26 23:51:12] [INFO ] Flow matrix only has 339 transitions (discarded 60 similar events)
[2024-05-26 23:51:12] [INFO ] Invariant cache hit.
[2024-05-26 23:51:12] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-26 23:51:12] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
[2024-05-26 23:51:12] [INFO ] Redundant transitions in 19 ms returned []
Running 394 sub problems to find dead transitions.
[2024-05-26 23:51:12] [INFO ] Flow matrix only has 339 transitions (discarded 60 similar events)
[2024-05-26 23:51:12] [INFO ] Invariant cache hit.
[2024-05-26 23:51:12] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 184/184 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 5/189 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (OVERLAPS) 5/189 variables, 9/199 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-05-26 23:51:20] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-05-26 23:51:20] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 2 ms to minimize.
[2024-05-26 23:51:20] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2024-05-26 23:51:20] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2024-05-26 23:51:20] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-05-26 23:51:20] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-05-26 23:51:20] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-26 23:51:20] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-26 23:51:20] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-26 23:51:20] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-05-26 23:51:21] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-26 23:51:21] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2024-05-26 23:51:21] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
[2024-05-26 23:51:21] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-26 23:51:21] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-05-26 23:51:21] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-26 23:51:21] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 2 ms to minimize.
[2024-05-26 23:51:21] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-05-26 23:51:21] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2024-05-26 23:51:21] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 20/228 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-05-26 23:51:22] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-05-26 23:51:22] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-26 23:51:22] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-26 23:51:22] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-26 23:51:22] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-26 23:51:22] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-26 23:51:22] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 2 ms to minimize.
[2024-05-26 23:51:22] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-26 23:51:22] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-26 23:51:22] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-26 23:51:22] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-26 23:51:22] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2024-05-26 23:51:22] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2024-05-26 23:51:22] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-05-26 23:51:22] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-26 23:51:22] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-05-26 23:51:23] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2024-05-26 23:51:23] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
[2024-05-26 23:51:23] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-26 23:51:23] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 20/248 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-05-26 23:51:23] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-05-26 23:51:23] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-26 23:51:23] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-26 23:51:24] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-26 23:51:24] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-26 23:51:24] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-26 23:51:24] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-26 23:51:24] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 2 ms to minimize.
[2024-05-26 23:51:24] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-26 23:51:24] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-26 23:51:24] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 2 ms to minimize.
[2024-05-26 23:51:24] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-26 23:51:24] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-26 23:51:24] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-05-26 23:51:24] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-05-26 23:51:25] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-05-26 23:51:25] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 2 ms to minimize.
[2024-05-26 23:51:25] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-26 23:51:25] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
[2024-05-26 23:51:25] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 20/268 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-05-26 23:51:28] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-05-26 23:51:28] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-26 23:51:28] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
[2024-05-26 23:51:28] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-05-26 23:51:28] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-26 23:51:28] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-26 23:51:29] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-26 23:51:29] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 2 ms to minimize.
[2024-05-26 23:51:29] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-05-26 23:51:29] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
[2024-05-26 23:51:29] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 2 ms to minimize.
[2024-05-26 23:51:29] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2024-05-26 23:51:29] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-05-26 23:51:29] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-26 23:51:29] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-05-26 23:51:29] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-05-26 23:51:30] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 2 ms to minimize.
[2024-05-26 23:51:30] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-05-26 23:51:30] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 2 ms to minimize.
[2024-05-26 23:51:30] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 20/288 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-05-26 23:51:31] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-26 23:51:31] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-26 23:51:31] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2024-05-26 23:51:31] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-05-26 23:51:31] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-26 23:51:31] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2024-05-26 23:51:31] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-05-26 23:51:31] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2024-05-26 23:51:32] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 2 ms to minimize.
[2024-05-26 23:51:32] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 2 ms to minimize.
[2024-05-26 23:51:32] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 2 ms to minimize.
[2024-05-26 23:51:32] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2024-05-26 23:51:32] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 2 ms to minimize.
[2024-05-26 23:51:32] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-05-26 23:51:32] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-26 23:51:33] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-26 23:51:33] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-26 23:51:33] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-26 23:51:33] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-26 23:51:33] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 20/308 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-05-26 23:51:34] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-05-26 23:51:34] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-05-26 23:51:35] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2024-05-26 23:51:35] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-26 23:51:35] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 2 ms to minimize.
[2024-05-26 23:51:36] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-26 23:51:36] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-26 23:51:36] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-05-26 23:51:36] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-26 23:51:36] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-26 23:51:36] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-26 23:51:37] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 2 ms to minimize.
[2024-05-26 23:51:37] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-05-26 23:51:37] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-05-26 23:51:37] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-05-26 23:51:38] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2024-05-26 23:51:38] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-05-26 23:51:38] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-26 23:51:38] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-05-26 23:51:38] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 20/328 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 189/528 variables, and 328 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30016 ms.
Refiners :[Domain max(s): 189/189 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/189 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 184/184 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 5/189 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 116/306 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 5 (OVERLAPS) 5/189 variables, 9/315 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 4/328 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-05-26 23:51:49] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-05-26 23:51:49] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-05-26 23:51:49] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-26 23:51:50] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-26 23:51:50] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-05-26 23:51:51] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-26 23:51:52] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-26 23:51:52] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
[2024-05-26 23:51:52] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-05-26 23:51:52] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-05-26 23:51:52] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 11/339 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-05-26 23:51:54] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-26 23:51:54] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-26 23:51:55] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-26 23:51:56] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-05-26 23:51:57] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-05-26 23:51:57] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-26 23:51:57] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 7/346 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-05-26 23:52:00] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-05-26 23:52:00] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-26 23:52:02] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-26 23:52:02] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 2 ms to minimize.
[2024-05-26 23:52:03] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 5/351 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-05-26 23:52:05] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-05-26 23:52:07] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-05-26 23:52:07] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-26 23:52:08] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 4/355 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 189/528 variables, and 355 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30012 ms.
Refiners :[Domain max(s): 189/189 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/189 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/394 constraints, Known Traps: 147/147 constraints]
After SMT, in 60125ms problems are : Problem set: 0 solved, 394 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Starting structural reductions in SI_LTL mode, iteration 1 : 189/480 places, 399/690 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60934 ms. Remains : 189/480 places, 399/690 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 380 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 34 in 1 ms.
FORMULA Peterson-PT-4-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-06 finished in 61540 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(p1)))))'
Support contains 120 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-05-26 23:52:13] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-05-26 23:52:13] [INFO ] Computed 19 invariants in 4 ms
[2024-05-26 23:52:13] [INFO ] Implicit Places using invariants in 326 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 327 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 335 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-07
Entered a terminal (fully accepting) state of product in 21 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-4-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-4-LTLFireability-07 finished in 472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0) U (p0 U X((p1 U p2)))))&&X(p1)))'
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-05-26 23:52:13] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-05-26 23:52:13] [INFO ] Invariant cache hit.
[2024-05-26 23:52:14] [INFO ] Implicit Places using invariants in 352 ms returned [468, 469, 470, 471]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 353 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 476/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 476 /476 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 365 ms. Remains : 476/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), false, (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 230 ms.
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-4-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-4-LTLFireability-08 finished in 893 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 480 transition count 493
Reduce places removed 197 places and 0 transitions.
Iterating post reduction 1 with 197 rules applied. Total rules applied 394 place count 283 transition count 493
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 394 place count 283 transition count 393
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 594 place count 183 transition count 393
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 634 place count 163 transition count 373
Applied a total of 634 rules in 23 ms. Remains 163 /480 variables (removed 317) and now considering 373/690 (removed 317) transitions.
[2024-05-26 23:52:14] [INFO ] Flow matrix only has 313 transitions (discarded 60 similar events)
// Phase 1: matrix 313 rows 163 cols
[2024-05-26 23:52:14] [INFO ] Computed 19 invariants in 2 ms
[2024-05-26 23:52:14] [INFO ] Implicit Places using invariants in 217 ms returned [153, 154, 155, 156, 157]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 234 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/480 places, 373/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 264 ms. Remains : 158/480 places, 373/690 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 161 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 1 ms.
FORMULA Peterson-PT-4-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-10 finished in 553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 480 transition count 493
Reduce places removed 197 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 198 rules applied. Total rules applied 395 place count 283 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 396 place count 282 transition count 492
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 396 place count 282 transition count 391
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 598 place count 181 transition count 391
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 636 place count 162 transition count 372
Applied a total of 636 rules in 22 ms. Remains 162 /480 variables (removed 318) and now considering 372/690 (removed 318) transitions.
[2024-05-26 23:52:15] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 162 cols
[2024-05-26 23:52:15] [INFO ] Computed 19 invariants in 1 ms
[2024-05-26 23:52:15] [INFO ] Implicit Places using invariants in 225 ms returned [152, 153, 154, 155, 156]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 226 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/480 places, 372/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 157 /157 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 253 ms. Remains : 157/480 places, 372/690 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 157 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 0 ms.
FORMULA Peterson-PT-4-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-11 finished in 495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((G(p2)||p1)))))'
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 480 transition count 491
Reduce places removed 199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 200 rules applied. Total rules applied 399 place count 281 transition count 490
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 400 place count 280 transition count 490
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 400 place count 280 transition count 392
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 596 place count 182 transition count 392
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 634 place count 163 transition count 373
Applied a total of 634 rules in 19 ms. Remains 163 /480 variables (removed 317) and now considering 373/690 (removed 317) transitions.
[2024-05-26 23:52:15] [INFO ] Flow matrix only has 313 transitions (discarded 60 similar events)
// Phase 1: matrix 313 rows 163 cols
[2024-05-26 23:52:15] [INFO ] Computed 19 invariants in 1 ms
[2024-05-26 23:52:15] [INFO ] Implicit Places using invariants in 248 ms returned [154, 155, 156, 157]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 249 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/480 places, 373/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 159 /159 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 273 ms. Remains : 159/480 places, 373/690 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 187 ms.
Stack based approach found an accepted trace after 119 steps with 0 reset with depth 120 and stack size 100 in 1 ms.
FORMULA Peterson-PT-4-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-12 finished in 638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 480 transition count 493
Reduce places removed 197 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 198 rules applied. Total rules applied 395 place count 283 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 396 place count 282 transition count 492
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 396 place count 282 transition count 392
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 596 place count 182 transition count 392
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 636 place count 162 transition count 372
Applied a total of 636 rules in 21 ms. Remains 162 /480 variables (removed 318) and now considering 372/690 (removed 318) transitions.
[2024-05-26 23:52:16] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 162 cols
[2024-05-26 23:52:16] [INFO ] Computed 19 invariants in 1 ms
[2024-05-26 23:52:16] [INFO ] Implicit Places using invariants in 272 ms returned [153, 154, 155, 156]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 274 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/480 places, 372/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 299 ms. Remains : 158/480 places, 372/690 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 167 ms.
Product exploration explored 100000 steps with 0 reset in 441 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 249 ms. (160 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1398456 steps, run timeout after 3001 ms. (steps per millisecond=465 ) properties seen :0 out of 1
Probabilistic random walk after 1398456 steps, saw 233173 distinct states, run finished after 3001 ms. (steps per millisecond=465 ) properties seen :0
[2024-05-26 23:52:20] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 158 cols
[2024-05-26 23:52:20] [INFO ] Computed 15 invariants in 1 ms
[2024-05-26 23:52:20] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/56 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/57 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 126/183 variables, 57/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 24/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 68/251 variables, 20/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 120/371 variables, 24/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/371 variables, 24/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/371 variables, 92/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/371 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 54/425 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/425 variables, 54/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/425 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 3/428 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/428 variables, 3/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/428 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 42/470 variables, 57/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/470 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/470 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 447 constraints, problems are : Problem set: 0 solved, 1 unsolved in 232 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/56 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/57 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 126/183 variables, 57/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 24/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 68/251 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/251 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 120/371 variables, 24/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/371 variables, 24/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/371 variables, 92/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/371 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 54/425 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/425 variables, 54/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 23:52:21] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 2 ms to minimize.
[2024-05-26 23:52:21] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-26 23:52:21] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-05-26 23:52:21] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-05-26 23:52:21] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-05-26 23:52:21] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-26 23:52:21] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2024-05-26 23:52:21] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/425 variables, 8/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/425 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 3/428 variables, 3/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/428 variables, 3/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/428 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 42/470 variables, 57/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/470 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/470 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 456 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1034 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 1278ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 372/372 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 158/158 places, 372/372 transitions.
RANDOM walk for 40000 steps (8 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1396620 steps, run timeout after 3001 ms. (steps per millisecond=465 ) properties seen :0 out of 1
Probabilistic random walk after 1396620 steps, saw 232853 distinct states, run finished after 3001 ms. (steps per millisecond=465 ) properties seen :0
[2024-05-26 23:52:24] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
[2024-05-26 23:52:24] [INFO ] Invariant cache hit.
[2024-05-26 23:52:24] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/56 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/57 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 126/183 variables, 57/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 24/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 68/251 variables, 20/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 120/371 variables, 24/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/371 variables, 24/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/371 variables, 92/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/371 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 54/425 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/425 variables, 54/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/425 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 3/428 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/428 variables, 3/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/428 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 42/470 variables, 57/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/470 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/470 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 447 constraints, problems are : Problem set: 0 solved, 1 unsolved in 226 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/56 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/57 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 126/183 variables, 57/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 24/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 68/251 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/251 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 120/371 variables, 24/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/371 variables, 24/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/371 variables, 92/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/371 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 54/425 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/425 variables, 54/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 23:52:25] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-05-26 23:52:25] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-05-26 23:52:25] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
[2024-05-26 23:52:25] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/425 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/425 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 3/428 variables, 3/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/428 variables, 3/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/428 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 42/470 variables, 57/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 23:52:25] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 2 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/470 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/470 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/470 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 718 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 954ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 372/372 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 158/158 places, 372/372 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 372/372 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 372/372 (removed 0) transitions.
[2024-05-26 23:52:25] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
[2024-05-26 23:52:25] [INFO ] Invariant cache hit.
[2024-05-26 23:52:26] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-26 23:52:26] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
[2024-05-26 23:52:26] [INFO ] Invariant cache hit.
[2024-05-26 23:52:26] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-26 23:52:26] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
[2024-05-26 23:52:26] [INFO ] Redundant transitions in 7 ms returned []
Running 367 sub problems to find dead transitions.
[2024-05-26 23:52:26] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
[2024-05-26 23:52:26] [INFO ] Invariant cache hit.
[2024-05-26 23:52:26] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:52:28] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-26 23:52:28] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2024-05-26 23:52:28] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-26 23:52:28] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-26 23:52:28] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-26 23:52:28] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-26 23:52:28] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
[2024-05-26 23:52:28] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-26 23:52:28] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-26 23:52:29] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-26 23:52:29] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-26 23:52:29] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-26 23:52:29] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-26 23:52:29] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-05-26 23:52:29] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-26 23:52:29] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-26 23:52:29] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 2 ms to minimize.
[2024-05-26 23:52:29] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-26 23:52:29] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-26 23:52:29] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:52:30] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 2 ms to minimize.
[2024-05-26 23:52:30] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-26 23:52:30] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-26 23:52:30] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-26 23:52:30] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-26 23:52:30] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-26 23:52:30] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-26 23:52:30] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-26 23:52:30] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-26 23:52:30] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-26 23:52:31] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-26 23:52:31] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-26 23:52:31] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-26 23:52:31] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-05-26 23:52:31] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-26 23:52:31] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-26 23:52:31] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-26 23:52:31] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 2 ms to minimize.
[2024-05-26 23:52:32] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 2 ms to minimize.
[2024-05-26 23:52:32] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:52:33] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-26 23:52:34] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-26 23:52:35] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 2 ms to minimize.
[2024-05-26 23:52:35] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-26 23:52:35] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 4 ms to minimize.
[2024-05-26 23:52:35] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-26 23:52:35] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-26 23:52:35] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-26 23:52:35] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-26 23:52:35] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-26 23:52:35] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-26 23:52:35] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-26 23:52:35] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-26 23:52:35] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-26 23:52:35] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-26 23:52:36] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-26 23:52:36] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 17/226 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:52:36] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (OVERLAPS) 1/158 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:52:43] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-05-26 23:52:43] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-05-26 23:52:43] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-26 23:52:43] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-05-26 23:52:43] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-26 23:52:43] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-05-26 23:52:43] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-26 23:52:43] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-26 23:52:43] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-05-26 23:52:44] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-26 23:52:44] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 2 ms to minimize.
[2024-05-26 23:52:44] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-05-26 23:52:44] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-05-26 23:52:44] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-26 23:52:44] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
[2024-05-26 23:52:44] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-26 23:52:44] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-26 23:52:44] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-05-26 23:52:45] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-26 23:52:45] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:52:45] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 2 ms to minimize.
[2024-05-26 23:52:46] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-26 23:52:46] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-26 23:52:46] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-26 23:52:46] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 2 ms to minimize.
[2024-05-26 23:52:46] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-26 23:52:46] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-26 23:52:46] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-26 23:52:46] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-26 23:52:47] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2024-05-26 23:52:47] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-26 23:52:47] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-26 23:52:47] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-26 23:52:47] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-26 23:52:47] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-26 23:52:47] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-26 23:52:47] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-05-26 23:52:47] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-26 23:52:48] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-26 23:52:48] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:52:50] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-26 23:52:50] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-05-26 23:52:51] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2024-05-26 23:52:51] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-26 23:52:51] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 2 ms to minimize.
[2024-05-26 23:52:51] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-26 23:52:51] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-05-26 23:52:51] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 8/279 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:52:55] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-26 23:52:55] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-26 23:52:55] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-26 23:52:56] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-26 23:52:56] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/470 variables, and 284 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30011 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/158 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 111/111 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 104/273 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:52:58] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-26 23:52:59] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 1/158 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 7/286 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:53:06] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-26 23:53:06] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:53:09] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-26 23:53:10] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-05-26 23:53:10] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-26 23:53:10] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-26 23:53:10] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 5/293 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:53:14] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 2 ms to minimize.
[2024-05-26 23:53:14] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:53:18] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-26 23:53:18] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:53:21] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-26 23:53:21] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-26 23:53:22] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:53:25] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 158/470 variables, and 301 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30013 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/158 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/367 constraints, Known Traps: 128/128 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60768 ms. Remains : 158/158 places, 372/372 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 280 edges and 158 vertex of which 98 / 158 are part of one of the 20 SCC in 7 ms
Free SCC test removed 78 places
Drop transitions (Empty/Sink Transition effects.) removed 156 transitions
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 235 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 1 place count 80 transition count 118
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 39 place count 61 transition count 118
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 43 place count 59 transition count 115
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 57 place count 50 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 25 edges and 50 vertex of which 20 / 50 are part of one of the 4 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 59 place count 34 transition count 114
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (trivial) has 53 edges and 31 vertex of which 12 / 31 are part of one of the 4 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 24 rules applied. Total rules applied 83 place count 23 transition count 94
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 2 with 58 rules applied. Total rules applied 141 place count 23 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 23 transition count 33
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 145 place count 23 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 146 place count 22 transition count 32
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 147 place count 22 transition count 32
Applied a total of 147 rules in 30 ms. Remains 22 /158 variables (removed 136) and now considering 32/372 (removed 340) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 32 rows 22 cols
[2024-05-26 23:53:26] [INFO ] Computed 8 invariants in 0 ms
[2024-05-26 23:53:26] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 23:53:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-26 23:53:26] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-26 23:53:26] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-26 23:53:26] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-26 23:53:26] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 138 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 372/372 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 372/372 (removed 0) transitions.
[2024-05-26 23:53:26] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 158 cols
[2024-05-26 23:53:26] [INFO ] Computed 15 invariants in 1 ms
[2024-05-26 23:53:27] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-05-26 23:53:27] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
[2024-05-26 23:53:27] [INFO ] Invariant cache hit.
[2024-05-26 23:53:27] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-26 23:53:27] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
[2024-05-26 23:53:27] [INFO ] Redundant transitions in 3 ms returned []
Running 367 sub problems to find dead transitions.
[2024-05-26 23:53:27] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
[2024-05-26 23:53:27] [INFO ] Invariant cache hit.
[2024-05-26 23:53:27] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:53:29] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-05-26 23:53:29] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-26 23:53:29] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-05-26 23:53:29] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-05-26 23:53:29] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-26 23:53:29] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2024-05-26 23:53:30] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-26 23:53:30] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-26 23:53:30] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-26 23:53:30] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-26 23:53:30] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-26 23:53:30] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
[2024-05-26 23:53:30] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-26 23:53:30] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-26 23:53:30] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-05-26 23:53:30] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
[2024-05-26 23:53:30] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-26 23:53:30] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 2 ms to minimize.
[2024-05-26 23:53:31] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2024-05-26 23:53:31] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:53:31] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 2 ms to minimize.
[2024-05-26 23:53:31] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-26 23:53:31] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
[2024-05-26 23:53:31] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-26 23:53:31] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-26 23:53:31] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-26 23:53:31] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-26 23:53:32] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-26 23:53:32] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-26 23:53:32] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-26 23:53:32] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-26 23:53:32] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-26 23:53:32] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-26 23:53:32] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-26 23:53:32] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-05-26 23:53:32] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-26 23:53:33] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-26 23:53:33] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2024-05-26 23:53:33] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-26 23:53:33] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:53:34] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-26 23:53:35] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-26 23:53:36] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-26 23:53:36] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-26 23:53:36] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-26 23:53:36] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 2 ms to minimize.
[2024-05-26 23:53:36] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
[2024-05-26 23:53:36] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-26 23:53:36] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-26 23:53:36] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-26 23:53:36] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-26 23:53:36] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-26 23:53:36] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-26 23:53:36] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-26 23:53:37] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-26 23:53:37] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-26 23:53:37] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 17/226 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:53:37] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (OVERLAPS) 1/158 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:53:44] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-26 23:53:44] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2024-05-26 23:53:44] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-26 23:53:44] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 2 ms to minimize.
[2024-05-26 23:53:44] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-05-26 23:53:44] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-05-26 23:53:44] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-05-26 23:53:45] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-26 23:53:45] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-05-26 23:53:45] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-26 23:53:45] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
[2024-05-26 23:53:45] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
[2024-05-26 23:53:45] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-05-26 23:53:45] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-26 23:53:45] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
[2024-05-26 23:53:45] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 2 ms to minimize.
[2024-05-26 23:53:46] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 2 ms to minimize.
[2024-05-26 23:53:46] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-05-26 23:53:46] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-26 23:53:46] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:53:46] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-26 23:53:47] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-26 23:53:47] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-26 23:53:47] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-05-26 23:53:47] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-26 23:53:47] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-26 23:53:47] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-26 23:53:47] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-26 23:53:48] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-05-26 23:53:48] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
[2024-05-26 23:53:48] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-26 23:53:48] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-26 23:53:48] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
[2024-05-26 23:53:48] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-26 23:53:48] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-26 23:53:48] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-05-26 23:53:48] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-05-26 23:53:49] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-26 23:53:49] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-26 23:53:49] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:53:51] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
[2024-05-26 23:53:51] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-26 23:53:52] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 2 ms to minimize.
[2024-05-26 23:53:52] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-26 23:53:52] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
[2024-05-26 23:53:52] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
[2024-05-26 23:53:52] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-05-26 23:53:52] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 8/279 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:53:56] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-05-26 23:53:57] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 2 ms to minimize.
[2024-05-26 23:53:57] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-26 23:53:57] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/470 variables, and 283 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30011 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/158 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 110/110 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 103/272 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:53:59] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
[2024-05-26 23:54:00] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 1/158 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:54:06] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-26 23:54:08] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-26 23:54:08] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-26 23:54:08] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-26 23:54:08] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-26 23:54:09] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-26 23:54:09] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 7/292 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:54:11] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-26 23:54:11] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-05-26 23:54:12] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-26 23:54:12] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
[2024-05-26 23:54:12] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-26 23:54:12] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 6/298 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:54:15] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2024-05-26 23:54:16] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
[2024-05-26 23:54:17] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 13 (OVERLAPS) 312/470 variables, 158/459 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/470 variables, 116/575 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 942 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30054 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 128/128 constraints]
After SMT, in 60185ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60190ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60943 ms. Remains : 158/158 places, 372/372 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1407306 steps, run timeout after 3001 ms. (steps per millisecond=468 ) properties seen :0 out of 1
Probabilistic random walk after 1407306 steps, saw 234644 distinct states, run finished after 3001 ms. (steps per millisecond=468 ) properties seen :0
[2024-05-26 23:54:31] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
[2024-05-26 23:54:31] [INFO ] Invariant cache hit.
[2024-05-26 23:54:31] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/56 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/57 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 126/183 variables, 57/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 24/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 68/251 variables, 20/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 120/371 variables, 24/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/371 variables, 24/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/371 variables, 92/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/371 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 54/425 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/425 variables, 54/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/425 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 3/428 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/428 variables, 3/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/428 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 42/470 variables, 57/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/470 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/470 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 447 constraints, problems are : Problem set: 0 solved, 1 unsolved in 226 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/56 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/57 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 126/183 variables, 57/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 24/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 68/251 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/251 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 120/371 variables, 24/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/371 variables, 24/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/371 variables, 92/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/371 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 54/425 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/425 variables, 54/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 23:54:31] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-26 23:54:31] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2024-05-26 23:54:31] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 2 ms to minimize.
[2024-05-26 23:54:31] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/425 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/425 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 3/428 variables, 3/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/428 variables, 3/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/428 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 42/470 variables, 57/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 23:54:32] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/470 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/470 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/470 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 727 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 963ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 372/372 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 158/158 places, 372/372 transitions.
RANDOM walk for 40000 steps (8 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1406556 steps, run timeout after 3001 ms. (steps per millisecond=468 ) properties seen :0 out of 1
Probabilistic random walk after 1406556 steps, saw 234541 distinct states, run finished after 3004 ms. (steps per millisecond=468 ) properties seen :0
[2024-05-26 23:54:35] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
[2024-05-26 23:54:35] [INFO ] Invariant cache hit.
[2024-05-26 23:54:35] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/56 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/57 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 126/183 variables, 57/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 24/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 68/251 variables, 20/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 120/371 variables, 24/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/371 variables, 24/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/371 variables, 92/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/371 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 54/425 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/425 variables, 54/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/425 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 3/428 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/428 variables, 3/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/428 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 42/470 variables, 57/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/470 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/470 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 447 constraints, problems are : Problem set: 0 solved, 1 unsolved in 229 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/56 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/57 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 126/183 variables, 57/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 24/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 68/251 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/251 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 120/371 variables, 24/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/371 variables, 24/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/371 variables, 92/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/371 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 54/425 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/425 variables, 54/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 23:54:35] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-26 23:54:35] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2024-05-26 23:54:35] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-05-26 23:54:35] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/425 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/425 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 3/428 variables, 3/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/428 variables, 3/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/428 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 42/470 variables, 57/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 23:54:36] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/470 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/470 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/470 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 736 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 975ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 372/372 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 158/158 places, 372/372 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 372/372 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 372/372 (removed 0) transitions.
[2024-05-26 23:54:36] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
[2024-05-26 23:54:36] [INFO ] Invariant cache hit.
[2024-05-26 23:54:36] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-26 23:54:36] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
[2024-05-26 23:54:36] [INFO ] Invariant cache hit.
[2024-05-26 23:54:36] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-26 23:54:36] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
[2024-05-26 23:54:36] [INFO ] Redundant transitions in 3 ms returned []
Running 367 sub problems to find dead transitions.
[2024-05-26 23:54:36] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
[2024-05-26 23:54:36] [INFO ] Invariant cache hit.
[2024-05-26 23:54:36] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:54:38] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2024-05-26 23:54:38] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-26 23:54:39] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-26 23:54:39] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-05-26 23:54:39] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-05-26 23:54:39] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-26 23:54:39] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-26 23:54:39] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 2 ms to minimize.
[2024-05-26 23:54:39] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-26 23:54:39] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-26 23:54:39] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-26 23:54:39] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-26 23:54:39] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-26 23:54:39] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-26 23:54:39] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-26 23:54:39] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-26 23:54:39] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 2 ms to minimize.
[2024-05-26 23:54:40] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-26 23:54:40] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-26 23:54:40] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:54:40] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-26 23:54:40] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-26 23:54:40] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-26 23:54:40] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-26 23:54:40] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-26 23:54:40] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-26 23:54:41] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-26 23:54:41] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-26 23:54:41] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-26 23:54:41] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-26 23:54:41] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-26 23:54:41] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-26 23:54:41] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-26 23:54:41] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
[2024-05-26 23:54:41] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-26 23:54:42] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 2 ms to minimize.
[2024-05-26 23:54:42] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-26 23:54:42] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 2 ms to minimize.
[2024-05-26 23:54:42] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-26 23:54:42] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:54:44] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-26 23:54:44] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-26 23:54:45] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-26 23:54:45] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-26 23:54:45] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-26 23:54:45] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 2 ms to minimize.
[2024-05-26 23:54:45] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-26 23:54:45] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-26 23:54:45] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-26 23:54:45] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-26 23:54:45] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-26 23:54:45] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-26 23:54:46] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-26 23:54:46] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-26 23:54:46] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-26 23:54:46] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-26 23:54:46] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 17/226 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:54:46] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (OVERLAPS) 1/158 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:54:53] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-26 23:54:53] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-05-26 23:54:53] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-26 23:54:53] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-05-26 23:54:53] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-05-26 23:54:54] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-26 23:54:54] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-26 23:54:54] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-05-26 23:54:54] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-26 23:54:54] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-26 23:54:54] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
[2024-05-26 23:54:54] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-05-26 23:54:54] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-05-26 23:54:54] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 2 ms to minimize.
[2024-05-26 23:54:54] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-26 23:54:55] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-26 23:54:55] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-26 23:54:55] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-05-26 23:54:55] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-26 23:54:55] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:54:55] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-05-26 23:54:56] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-26 23:54:56] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-26 23:54:56] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-26 23:54:56] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-26 23:54:56] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-26 23:54:56] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-26 23:54:56] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-26 23:54:57] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-26 23:54:57] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2024-05-26 23:54:57] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-26 23:54:57] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-26 23:54:57] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-26 23:54:57] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-26 23:54:57] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-26 23:54:57] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-26 23:54:57] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-26 23:54:57] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
[2024-05-26 23:54:58] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-26 23:54:58] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:55:00] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-05-26 23:55:00] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-26 23:55:01] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 2 ms to minimize.
[2024-05-26 23:55:01] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-05-26 23:55:01] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 2 ms to minimize.
[2024-05-26 23:55:01] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2024-05-26 23:55:01] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-05-26 23:55:01] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 8/279 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:55:05] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
[2024-05-26 23:55:05] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 2 ms to minimize.
[2024-05-26 23:55:05] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-26 23:55:06] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-26 23:55:06] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/470 variables, and 284 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30011 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/158 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 111/111 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 104/273 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:55:08] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 2 ms to minimize.
[2024-05-26 23:55:09] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 1/158 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 7/286 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:55:16] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-26 23:55:17] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:55:20] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 2 ms to minimize.
[2024-05-26 23:55:20] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-05-26 23:55:20] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-26 23:55:20] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-26 23:55:20] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 5/293 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:55:24] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-26 23:55:24] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:55:28] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-26 23:55:28] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:55:32] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-26 23:55:32] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-26 23:55:32] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:55:35] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 158/470 variables, and 301 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30013 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/158 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/367 constraints, Known Traps: 128/128 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60863 ms. Remains : 158/158 places, 372/372 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 280 edges and 158 vertex of which 98 / 158 are part of one of the 20 SCC in 0 ms
Free SCC test removed 78 places
Drop transitions (Empty/Sink Transition effects.) removed 156 transitions
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 235 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 1 place count 80 transition count 118
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 39 place count 61 transition count 118
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 43 place count 59 transition count 115
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 57 place count 50 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 25 edges and 50 vertex of which 20 / 50 are part of one of the 4 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 59 place count 34 transition count 114
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (trivial) has 53 edges and 31 vertex of which 12 / 31 are part of one of the 4 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 24 rules applied. Total rules applied 83 place count 23 transition count 94
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 2 with 58 rules applied. Total rules applied 141 place count 23 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 23 transition count 33
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 145 place count 23 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 146 place count 22 transition count 32
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 147 place count 22 transition count 32
Applied a total of 147 rules in 18 ms. Remains 22 /158 variables (removed 136) and now considering 32/372 (removed 340) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 32 rows 22 cols
[2024-05-26 23:55:36] [INFO ] Computed 8 invariants in 0 ms
[2024-05-26 23:55:37] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 23:55:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-26 23:55:37] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-26 23:55:37] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-26 23:55:37] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-26 23:55:37] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 106 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 161 ms.
Product exploration explored 100000 steps with 0 reset in 264 ms.
Built C files in :
/tmp/ltsmin16477736286854141679
[2024-05-26 23:55:37] [INFO ] Computing symmetric may disable matrix : 372 transitions.
[2024-05-26 23:55:37] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:55:37] [INFO ] Computing symmetric may enable matrix : 372 transitions.
[2024-05-26 23:55:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:55:37] [INFO ] Computing Do-Not-Accords matrix : 372 transitions.
[2024-05-26 23:55:37] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:55:37] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16477736286854141679
Running compilation step : cd /tmp/ltsmin16477736286854141679;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1594 ms.
Running link step : cd /tmp/ltsmin16477736286854141679;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin16477736286854141679;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6427582425585988128.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 372/372 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 372/372 (removed 0) transitions.
[2024-05-26 23:55:52] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 158 cols
[2024-05-26 23:55:52] [INFO ] Computed 15 invariants in 1 ms
[2024-05-26 23:55:53] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-26 23:55:53] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
[2024-05-26 23:55:53] [INFO ] Invariant cache hit.
[2024-05-26 23:55:53] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-26 23:55:53] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
[2024-05-26 23:55:53] [INFO ] Redundant transitions in 3 ms returned []
Running 367 sub problems to find dead transitions.
[2024-05-26 23:55:53] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
[2024-05-26 23:55:53] [INFO ] Invariant cache hit.
[2024-05-26 23:55:53] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:55:55] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-26 23:55:55] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-26 23:55:55] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-26 23:55:55] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-05-26 23:55:55] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-26 23:55:55] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-26 23:55:55] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-26 23:55:55] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-26 23:55:55] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-26 23:55:55] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-26 23:55:56] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-26 23:55:56] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-26 23:55:56] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-26 23:55:56] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-26 23:55:56] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-05-26 23:55:56] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-26 23:55:56] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 2 ms to minimize.
[2024-05-26 23:55:56] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-26 23:55:56] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-26 23:55:56] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:55:57] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-26 23:55:57] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-26 23:55:57] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
[2024-05-26 23:55:57] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 2 ms to minimize.
[2024-05-26 23:55:57] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-26 23:55:57] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-26 23:55:57] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 2 ms to minimize.
[2024-05-26 23:55:57] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-26 23:55:57] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-26 23:55:57] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-26 23:55:58] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-05-26 23:55:58] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-26 23:55:58] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
[2024-05-26 23:55:58] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-26 23:55:58] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-26 23:55:58] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-26 23:55:58] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-26 23:55:58] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 2 ms to minimize.
[2024-05-26 23:55:59] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-26 23:55:59] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:56:00] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 2 ms to minimize.
[2024-05-26 23:56:01] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-26 23:56:01] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-26 23:56:02] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-26 23:56:02] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-26 23:56:02] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-26 23:56:02] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-26 23:56:02] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-26 23:56:02] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 2 ms to minimize.
[2024-05-26 23:56:02] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-26 23:56:02] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-26 23:56:02] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-26 23:56:02] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-26 23:56:02] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-26 23:56:02] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-26 23:56:03] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-26 23:56:03] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 17/226 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:56:03] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (OVERLAPS) 1/158 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:56:10] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-26 23:56:10] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 1 ms to minimize.
[2024-05-26 23:56:11] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2024-05-26 23:56:11] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-05-26 23:56:11] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-05-26 23:56:11] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-05-26 23:56:11] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-05-26 23:56:11] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-26 23:56:11] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-26 23:56:11] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 2 ms to minimize.
[2024-05-26 23:56:11] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
[2024-05-26 23:56:11] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
[2024-05-26 23:56:11] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-05-26 23:56:11] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 2 ms to minimize.
[2024-05-26 23:56:11] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-26 23:56:12] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-26 23:56:12] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-26 23:56:12] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-05-26 23:56:12] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 2 ms to minimize.
[2024-05-26 23:56:12] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:56:13] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 2 ms to minimize.
[2024-05-26 23:56:13] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-26 23:56:13] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-26 23:56:13] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-26 23:56:13] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-26 23:56:14] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-26 23:56:14] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-26 23:56:14] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 2 ms to minimize.
[2024-05-26 23:56:14] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-26 23:56:14] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-26 23:56:14] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-26 23:56:14] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-26 23:56:14] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-26 23:56:14] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-05-26 23:56:15] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-26 23:56:15] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 2 ms to minimize.
[2024-05-26 23:56:15] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-26 23:56:15] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 2 ms to minimize.
[2024-05-26 23:56:15] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-26 23:56:15] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:56:17] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-26 23:56:18] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-26 23:56:18] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 2 ms to minimize.
[2024-05-26 23:56:18] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-26 23:56:18] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 2 ms to minimize.
[2024-05-26 23:56:18] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-05-26 23:56:19] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-05-26 23:56:19] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 8/279 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-26 23:56:22] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-26 23:56:23] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-26 23:56:23] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 2 ms to minimize.
[2024-05-26 23:56:23] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
SMT process timed out in 30121ms, After SMT, problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 30126ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30921 ms. Remains : 158/158 places, 372/372 transitions.
Built C files in :
/tmp/ltsmin3274306931044952323
[2024-05-26 23:56:23] [INFO ] Computing symmetric may disable matrix : 372 transitions.
[2024-05-26 23:56:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:56:23] [INFO ] Computing symmetric may enable matrix : 372 transitions.
[2024-05-26 23:56:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:56:23] [INFO ] Computing Do-Not-Accords matrix : 372 transitions.
[2024-05-26 23:56:23] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:56:23] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3274306931044952323
Running compilation step : cd /tmp/ltsmin3274306931044952323;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1412 ms.
Running link step : cd /tmp/ltsmin3274306931044952323;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin3274306931044952323;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14078540049615630523.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 23:56:38] [INFO ] Flatten gal took : 26 ms
[2024-05-26 23:56:38] [INFO ] Flatten gal took : 25 ms
[2024-05-26 23:56:38] [INFO ] Time to serialize gal into /tmp/LTL11697210419793046286.gal : 6 ms
[2024-05-26 23:56:38] [INFO ] Time to serialize properties into /tmp/LTL14721593910413133504.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11697210419793046286.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2491661026000258117.hoa' '-atoms' '/tmp/LTL14721593910413133504.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14721593910413133504.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2491661026000258117.hoa
Detected timeout of ITS tools.
[2024-05-26 23:56:54] [INFO ] Flatten gal took : 21 ms
[2024-05-26 23:56:54] [INFO ] Flatten gal took : 19 ms
[2024-05-26 23:56:54] [INFO ] Time to serialize gal into /tmp/LTL15975123908985864463.gal : 5 ms
[2024-05-26 23:56:54] [INFO ] Time to serialize properties into /tmp/LTL11838005038444694160.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15975123908985864463.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11838005038444694160.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(((WantSection_4_F==0)||(Idle_4==0))||(TestIdentity_2_2_2==0))"))))
Formula 0 simplified : GF!"(((WantSection_4_F==0)||(Idle_4==0))||(TestIdentity_2_2_2==0))"
Detected timeout of ITS tools.
[2024-05-26 23:57:09] [INFO ] Flatten gal took : 19 ms
[2024-05-26 23:57:09] [INFO ] Applying decomposition
[2024-05-26 23:57:09] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6599179653667018157.txt' '-o' '/tmp/graph6599179653667018157.bin' '-w' '/tmp/graph6599179653667018157.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6599179653667018157.bin' '-l' '-1' '-v' '-w' '/tmp/graph6599179653667018157.weights' '-q' '0' '-e' '0.001'
[2024-05-26 23:57:09] [INFO ] Decomposing Gal with order
[2024-05-26 23:57:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 23:57:09] [INFO ] Removed a total of 409 redundant transitions.
[2024-05-26 23:57:09] [INFO ] Flatten gal took : 116 ms
[2024-05-26 23:57:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 294 labels/synchronizations in 28 ms.
[2024-05-26 23:57:09] [INFO ] Time to serialize gal into /tmp/LTL7466476483001744526.gal : 9 ms
[2024-05-26 23:57:09] [INFO ] Time to serialize properties into /tmp/LTL7739935876717486414.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7466476483001744526.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7739935876717486414.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("(((i1.u24.WantSection_4_F==0)||(i1.u24.Idle_4==0))||(i1.u0.TestIdentity_2_2_2==0))"))))
Formula 0 simplified : GF!"(((i1.u24.WantSection_4_F==0)||(i1.u24.Idle_4==0))||(i1.u0.TestIdentity_2_2_2==0))"
Detected timeout of ITS tools.
Treatment of property Peterson-PT-4-LTLFireability-13 finished in 308245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F((X(p0) U p1))||G(p2)))&&X(F(p3))))'
Support contains 3 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-05-26 23:57:24] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-05-26 23:57:24] [INFO ] Computed 19 invariants in 3 ms
[2024-05-26 23:57:24] [INFO ] Implicit Places using invariants in 349 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 350 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 365 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p3), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-15
Product exploration explored 100000 steps with 3 reset in 163 ms.
Stack based approach found an accepted trace after 627 steps with 0 reset with depth 628 and stack size 628 in 2 ms.
FORMULA Peterson-PT-4-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-15 finished in 752 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-26 23:57:25] [INFO ] Flatten gal took : 30 ms
Using solver Z3 to compute partial order matrices.
[2024-05-26 23:57:25] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin9755767763742670322
[2024-05-26 23:57:25] [INFO ] Computing symmetric may disable matrix : 690 transitions.
[2024-05-26 23:57:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:57:25] [INFO ] Computing symmetric may enable matrix : 690 transitions.
[2024-05-26 23:57:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:57:25] [INFO ] Flatten gal took : 47 ms
[2024-05-26 23:57:25] [INFO ] Computing Do-Not-Accords matrix : 690 transitions.
[2024-05-26 23:57:25] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:57:25] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9755767763742670322
Running compilation step : cd /tmp/ltsmin9755767763742670322;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16485385579127354512.txt' '-o' '/tmp/graph16485385579127354512.bin' '-w' '/tmp/graph16485385579127354512.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16485385579127354512.bin' '-l' '-1' '-v' '-w' '/tmp/graph16485385579127354512.weights' '-q' '0' '-e' '0.001'
[2024-05-26 23:57:25] [INFO ] Decomposing Gal with order
[2024-05-26 23:57:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 23:57:25] [INFO ] Removed a total of 500 redundant transitions.
[2024-05-26 23:57:25] [INFO ] Flatten gal took : 96 ms
[2024-05-26 23:57:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 19 ms.
[2024-05-26 23:57:25] [INFO ] Time to serialize gal into /tmp/LTLFireability15081556203263495409.gal : 15 ms
[2024-05-26 23:57:25] [INFO ] Time to serialize properties into /tmp/LTLFireability4051041823192296413.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15081556203263495409.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4051041823192296413.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(((i5.u50.WantSection_4_F!=1)||(i5.u50.Idle_4!=1))||(i15.i0.u6.TestIdentity_2_2_2!=1))"))))
Formula 0 simplified : GF!"(((i5.u50.WantSection_4_F!=1)||(i5.u50.Idle_4!=1))||(i15.i0.u6.TestIdentity_2_2_2!=1))"
Compilation finished in 3219 ms.
Running link step : cd /tmp/ltsmin9755767763742670322;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin9755767763742670322;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 857444 ms.
FORMULA Peterson-PT-4-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1585730 ms.
BK_STOP 1716768706662
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-4"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Peterson-PT-4, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r268-smll-171654407300268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-4.tgz
mv Peterson-PT-4 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;