About the Execution of ITS-Tools for LamportFastMutEx-COL-8
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1558.336 | 423987.00 | 613831.00 | 1280.80 | FFFFTFTFTFFFTFFF | 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.r224-tall-171649612400252.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 LamportFastMutEx-COL-8, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-171649612400252
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.1K Apr 13 07:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 13 07:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 13 07:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 13 07:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 07:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 13 07:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 13 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 44K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-00
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-01
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-02
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-03
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-04
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-05
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-06
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-07
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-08
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-09
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-10
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-11
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-12
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-13
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-14
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716568955165
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-8
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-24 16:42:36] [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-24 16:42:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 16:42:36] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-24 16:42:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 16:42:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 575 ms
[2024-05-24 16:42:36] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 315 PT places and 837.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
[2024-05-24 16:42:37] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 5 ms.
[2024-05-24 16:42:37] [INFO ] Skeletonized 14 HLPN properties in 1 ms. Removed 2 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA LamportFastMutEx-COL-8-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 31454 steps (6 resets) in 239 ms. (131 steps per ms) remains 0/12 properties
[2024-05-24 16:42:37] [INFO ] Flatten gal took : 14 ms
[2024-05-24 16:42:37] [INFO ] Flatten gal took : 3 ms
Domain [pid(9), pid(9)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-24 16:42:37] [INFO ] Unfolded HLPN to a Petri net with 315 places and 666 transitions 2934 arcs in 53 ms.
[2024-05-24 16:42:37] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 82 transitions.
Support contains 250 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 12 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2024-05-24 16:42:37] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2024-05-24 16:42:37] [INFO ] Computed 82 invariants in 24 ms
[2024-05-24 16:42:37] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-24 16:42:37] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 16:42:37] [INFO ] Invariant cache hit.
[2024-05-24 16:42:38] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 16:42:38] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
Running 576 sub problems to find dead transitions.
[2024-05-24 16:42:38] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 16:42:38] [INFO ] Invariant cache hit.
[2024-05-24 16:42:38] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-05-24 16:42:41] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 18 ms to minimize.
[2024-05-24 16:42:41] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-05-24 16:42:41] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 2 ms to minimize.
[2024-05-24 16:42:41] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 2 ms to minimize.
[2024-05-24 16:42:42] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-05-24 16:42:42] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 3 ms to minimize.
[2024-05-24 16:42:42] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
[2024-05-24 16:42:42] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 2 ms to minimize.
[2024-05-24 16:42:42] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 1 ms to minimize.
[2024-05-24 16:42:42] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-24 16:42:42] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 2 ms to minimize.
[2024-05-24 16:42:42] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-05-24 16:42:43] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
[2024-05-24 16:42:43] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 2 ms to minimize.
[2024-05-24 16:42:43] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-24 16:42:43] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:42:43] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-24 16:42:43] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-05-24 16:42:43] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-24 16:42:43] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 20/102 constraints. Problems are: Problem set: 5 solved, 571 unsolved
[2024-05-24 16:42:43] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-24 16:42:43] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-24 16:42:44] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-24 16:42:44] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-24 16:42:44] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:42:44] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:42:44] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:42:44] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:42:44] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:42:44] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-24 16:42:44] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-24 16:42:44] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-24 16:42:45] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
[2024-05-24 16:42:45] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:42:45] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2024-05-24 16:42:45] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 2 ms to minimize.
[2024-05-24 16:42:45] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:42:45] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 1 ms to minimize.
[2024-05-24 16:42:45] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-05-24 16:42:45] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 20/122 constraints. Problems are: Problem set: 12 solved, 564 unsolved
[2024-05-24 16:42:46] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-24 16:42:46] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-24 16:42:46] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-24 16:42:46] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-24 16:42:46] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 1 ms to minimize.
[2024-05-24 16:42:46] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:42:46] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:42:46] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
[2024-05-24 16:42:46] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:42:46] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 2 ms to minimize.
[2024-05-24 16:42:47] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 3 ms to minimize.
[2024-05-24 16:42:47] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:42:47] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-05-24 16:42:47] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-24 16:42:47] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 2 ms to minimize.
[2024-05-24 16:42:47] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-05-24 16:42:47] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 5 ms to minimize.
[2024-05-24 16:42:47] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:42:47] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-05-24 16:42:47] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
Problem TDEAD151 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/142 constraints. Problems are: Problem set: 16 solved, 560 unsolved
[2024-05-24 16:42:50] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:42:50] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:42:50] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 2 ms to minimize.
[2024-05-24 16:42:50] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 3 ms to minimize.
[2024-05-24 16:42:51] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:42:51] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:42:51] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:42:51] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:42:51] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:42:51] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:42:51] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:42:51] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:42:51] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-24 16:42:51] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:42:51] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:42:52] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:42:52] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
[2024-05-24 16:42:52] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:42:52] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:42:52] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 20/162 constraints. Problems are: Problem set: 20 solved, 556 unsolved
[2024-05-24 16:42:52] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-05-24 16:42:52] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:42:52] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-24 16:42:53] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 2 ms to minimize.
[2024-05-24 16:42:53] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-24 16:42:53] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:42:53] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:42:53] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:42:53] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-24 16:42:54] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 3 ms to minimize.
[2024-05-24 16:42:54] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 2 ms to minimize.
[2024-05-24 16:42:54] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:42:54] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:42:54] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:42:54] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
[2024-05-24 16:42:54] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:42:54] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 2 ms to minimize.
[2024-05-24 16:42:54] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:42:55] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-24 16:42:55] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 20/182 constraints. Problems are: Problem set: 29 solved, 547 unsolved
[2024-05-24 16:42:55] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:42:55] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-05-24 16:42:55] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
[2024-05-24 16:42:56] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:42:56] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:42:56] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:42:56] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 2 ms to minimize.
[2024-05-24 16:42:56] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:42:56] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:42:56] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:42:56] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 2 ms to minimize.
[2024-05-24 16:42:56] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:42:56] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:42:57] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:42:57] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:42:57] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:42:57] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-05-24 16:42:57] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:42:57] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-05-24 16:42:57] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 20/202 constraints. Problems are: Problem set: 35 solved, 541 unsolved
[2024-05-24 16:43:00] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-05-24 16:43:00] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:43:00] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-05-24 16:43:00] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:43:00] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:43:01] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-05-24 16:43:01] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 1 ms to minimize.
[2024-05-24 16:43:01] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:43:01] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:43:01] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:43:01] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2024-05-24 16:43:01] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2024-05-24 16:43:01] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:43:01] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:43:01] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:43:02] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-05-24 16:43:02] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:43:02] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:43:02] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:43:02] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 20/222 constraints. Problems are: Problem set: 35 solved, 541 unsolved
[2024-05-24 16:43:03] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 3 ms to minimize.
[2024-05-24 16:43:03] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:43:03] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:43:03] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:43:03] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:43:03] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:43:03] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:43:03] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:43:03] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
[2024-05-24 16:43:04] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:43:04] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:43:04] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:43:04] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:43:04] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:43:04] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:43:04] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:43:04] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:43:04] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:43:04] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:43:05] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 20/242 constraints. Problems are: Problem set: 35 solved, 541 unsolved
[2024-05-24 16:43:05] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:43:05] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:43:05] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:43:05] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:43:05] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:43:05] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:43:06] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
[2024-05-24 16:43:06] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:43:06] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:43:06] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:43:06] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:43:06] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:43:06] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:43:06] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:43:06] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-05-24 16:43:07] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:43:07] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:43:07] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:43:07] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:43:07] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
Problem TDEAD155 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD323 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 20/262 constraints. Problems are: Problem set: 38 solved, 538 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 266/682 variables, and 262 constraints, problems are : Problem set: 38 solved, 538 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 0/266 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 180/180 constraints]
Escalating to Integer solving :Problem set: 38 solved, 538 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 10/10 constraints. Problems are: Problem set: 38 solved, 538 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 124/134 constraints. Problems are: Problem set: 38 solved, 538 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 0/134 constraints. Problems are: Problem set: 38 solved, 538 unsolved
At refinement iteration 3 (OVERLAPS) 8/266 variables, 72/206 constraints. Problems are: Problem set: 38 solved, 538 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 56/262 constraints. Problems are: Problem set: 38 solved, 538 unsolved
[2024-05-24 16:43:12] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-24 16:43:12] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:43:12] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:43:12] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:43:12] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:43:12] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:43:12] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:43:12] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:43:12] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:43:13] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:43:13] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-24 16:43:13] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:43:13] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:43:13] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2024-05-24 16:43:13] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2024-05-24 16:43:14] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:43:14] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:43:14] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:43:14] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:43:14] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
Problem TDEAD106 is UNSAT
Problem TDEAD205 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 20/282 constraints. Problems are: Problem set: 40 solved, 536 unsolved
[2024-05-24 16:43:15] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:43:15] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:43:15] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:43:15] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2024-05-24 16:43:15] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-05-24 16:43:15] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 1 ms to minimize.
[2024-05-24 16:43:15] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 2 ms to minimize.
[2024-05-24 16:43:16] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
[2024-05-24 16:43:16] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 2 ms to minimize.
[2024-05-24 16:43:16] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 1 ms to minimize.
[2024-05-24 16:43:16] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 1 ms to minimize.
[2024-05-24 16:43:16] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:43:16] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2024-05-24 16:43:16] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 1 ms to minimize.
[2024-05-24 16:43:16] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
[2024-05-24 16:43:16] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:43:17] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:43:17] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-05-24 16:43:17] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 1 ms to minimize.
[2024-05-24 16:43:17] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 20/302 constraints. Problems are: Problem set: 40 solved, 536 unsolved
[2024-05-24 16:43:17] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
[2024-05-24 16:43:18] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:43:18] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 1 ms to minimize.
[2024-05-24 16:43:18] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 1 ms to minimize.
[2024-05-24 16:43:18] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 2 ms to minimize.
[2024-05-24 16:43:18] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:43:18] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-05-24 16:43:18] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 2 ms to minimize.
[2024-05-24 16:43:19] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 2 ms to minimize.
[2024-05-24 16:43:19] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 1 ms to minimize.
[2024-05-24 16:43:19] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 1 ms to minimize.
[2024-05-24 16:43:19] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2024-05-24 16:43:19] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 2 ms to minimize.
[2024-05-24 16:43:19] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 2 ms to minimize.
[2024-05-24 16:43:19] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 1 ms to minimize.
[2024-05-24 16:43:20] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 1 ms to minimize.
[2024-05-24 16:43:20] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:43:20] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 1 ms to minimize.
[2024-05-24 16:43:20] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 1 ms to minimize.
[2024-05-24 16:43:20] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 20/322 constraints. Problems are: Problem set: 40 solved, 536 unsolved
[2024-05-24 16:43:21] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 2 ms to minimize.
[2024-05-24 16:43:21] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:43:21] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 5 ms to minimize.
[2024-05-24 16:43:21] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-05-24 16:43:21] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:43:21] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2024-05-24 16:43:22] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 1 ms to minimize.
[2024-05-24 16:43:22] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:43:22] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 3 ms to minimize.
[2024-05-24 16:43:22] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 1 ms to minimize.
[2024-05-24 16:43:22] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
[2024-05-24 16:43:22] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 2 ms to minimize.
[2024-05-24 16:43:22] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:43:22] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 2 ms to minimize.
[2024-05-24 16:43:22] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 4 ms to minimize.
[2024-05-24 16:43:23] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 4 ms to minimize.
[2024-05-24 16:43:23] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2024-05-24 16:43:23] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 1 ms to minimize.
[2024-05-24 16:43:23] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 1 ms to minimize.
[2024-05-24 16:43:23] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 20/342 constraints. Problems are: Problem set: 40 solved, 536 unsolved
[2024-05-24 16:43:23] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 1 ms to minimize.
[2024-05-24 16:43:24] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 1 ms to minimize.
[2024-05-24 16:43:24] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:43:24] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 1 ms to minimize.
[2024-05-24 16:43:24] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-05-24 16:43:24] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 1 ms to minimize.
[2024-05-24 16:43:24] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:43:24] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:43:24] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:43:25] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2024-05-24 16:43:25] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 1 ms to minimize.
[2024-05-24 16:43:25] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:43:25] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:43:25] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2024-05-24 16:43:25] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
[2024-05-24 16:43:25] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 1 ms to minimize.
[2024-05-24 16:43:25] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-05-24 16:43:25] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-05-24 16:43:26] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 1 ms to minimize.
[2024-05-24 16:43:26] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 20/362 constraints. Problems are: Problem set: 40 solved, 536 unsolved
[2024-05-24 16:43:26] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 1 ms to minimize.
[2024-05-24 16:43:27] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 1 ms to minimize.
[2024-05-24 16:43:27] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 2 ms to minimize.
[2024-05-24 16:43:27] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-05-24 16:43:27] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
[2024-05-24 16:43:27] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 4 ms to minimize.
[2024-05-24 16:43:27] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:43:27] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:43:27] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:43:28] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2024-05-24 16:43:28] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 2 ms to minimize.
[2024-05-24 16:43:28] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 1 ms to minimize.
[2024-05-24 16:43:28] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 1 ms to minimize.
[2024-05-24 16:43:28] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-05-24 16:43:28] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 1 ms to minimize.
[2024-05-24 16:43:28] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 1 ms to minimize.
[2024-05-24 16:43:28] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 1 ms to minimize.
[2024-05-24 16:43:29] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2024-05-24 16:43:29] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 1 ms to minimize.
[2024-05-24 16:43:29] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD225 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 20/382 constraints. Problems are: Problem set: 42 solved, 534 unsolved
[2024-05-24 16:43:29] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2024-05-24 16:43:29] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
[2024-05-24 16:43:30] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 1 ms to minimize.
[2024-05-24 16:43:30] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 2 ms to minimize.
[2024-05-24 16:43:30] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2024-05-24 16:43:30] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-05-24 16:43:30] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
[2024-05-24 16:43:30] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:43:30] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 1 ms to minimize.
[2024-05-24 16:43:30] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-24 16:43:31] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2024-05-24 16:43:31] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:43:31] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:43:31] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:43:31] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:43:31] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:43:31] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 1 ms to minimize.
[2024-05-24 16:43:31] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:43:31] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:43:31] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 20/402 constraints. Problems are: Problem set: 42 solved, 534 unsolved
[2024-05-24 16:43:32] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 2 ms to minimize.
[2024-05-24 16:43:33] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:43:33] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:43:33] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:43:33] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:43:33] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:43:33] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:43:33] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 19 ms to minimize.
[2024-05-24 16:43:33] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:43:33] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:43:33] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:43:34] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:43:34] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:43:34] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:43:34] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:43:34] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:43:34] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:43:34] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:43:34] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 1 ms to minimize.
[2024-05-24 16:43:35] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 20/422 constraints. Problems are: Problem set: 42 solved, 534 unsolved
[2024-05-24 16:43:35] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 1 ms to minimize.
[2024-05-24 16:43:35] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2024-05-24 16:43:35] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 2 ms to minimize.
[2024-05-24 16:43:35] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:43:35] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:43:36] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:43:36] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 1 ms to minimize.
[2024-05-24 16:43:36] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 2 ms to minimize.
[2024-05-24 16:43:36] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
[2024-05-24 16:43:36] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-05-24 16:43:36] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:43:36] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:43:36] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:43:37] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:43:37] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:43:37] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:43:37] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 1 ms to minimize.
[2024-05-24 16:43:37] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:43:37] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:43:37] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 20/442 constraints. Problems are: Problem set: 42 solved, 534 unsolved
[2024-05-24 16:43:38] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-05-24 16:43:38] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 1 ms to minimize.
[2024-05-24 16:43:38] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
SMT process timed out in 60491ms, After SMT, problems are : Problem set: 42 solved, 534 unsolved
Search for dead transitions found 42 dead transitions in 60513ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in LTL mode, iteration 1 : 266/266 places, 542/584 transitions.
Applied a total of 0 rules in 4 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61091 ms. Remains : 266/266 places, 542/584 transitions.
Support contains 250 out of 266 places after structural reductions.
[2024-05-24 16:43:38] [INFO ] Flatten gal took : 111 ms
[2024-05-24 16:43:39] [INFO ] Flatten gal took : 147 ms
[2024-05-24 16:43:39] [INFO ] Input system was already deterministic with 542 transitions.
Support contains 242 out of 266 places (down from 250) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 20 to 16
RANDOM walk for 40000 steps (8 resets) in 1118 ms. (35 steps per ms) remains 1/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 475 ms. (84 steps per ms) remains 1/1 properties
[2024-05-24 16:43:40] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
// Phase 1: matrix 387 rows 266 cols
[2024-05-24 16:43:40] [INFO ] Computed 82 invariants in 3 ms
[2024-05-24 16:43:40] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 225/250 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:43:40] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 387/637 variables, 250/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/637 variables, 107/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/653 variables, 16/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/653 variables, 8/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/653 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/653 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 653/653 variables, and 456 constraints, problems are : Problem set: 0 solved, 1 unsolved in 641 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 266/266 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 225/250 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 387/637 variables, 250/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/637 variables, 107/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/637 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/653 variables, 16/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/653 variables, 8/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/653 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/653 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 653/653 variables, and 457 constraints, problems are : Problem set: 0 solved, 1 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 266/266 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1252ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 285 ms.
Support contains 25 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 542/542 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 534
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 258 transition count 526
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 32 place count 250 transition count 526
Applied a total of 32 rules in 116 ms. Remains 250 /266 variables (removed 16) and now considering 526/542 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 250/266 places, 526/542 transitions.
RANDOM walk for 40000 steps (8 resets) in 352 ms. (113 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1022754 steps, run timeout after 3001 ms. (steps per millisecond=340 ) properties seen :0 out of 1
Probabilistic random walk after 1022754 steps, saw 504536 distinct states, run finished after 3004 ms. (steps per millisecond=340 ) properties seen :0
[2024-05-24 16:43:45] [INFO ] Flow matrix only has 371 transitions (discarded 155 similar events)
// Phase 1: matrix 371 rows 250 cols
[2024-05-24 16:43:45] [INFO ] Computed 82 invariants in 9 ms
[2024-05-24 16:43:45] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 209/234 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:43:45] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 371/605 variables, 234/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/605 variables, 107/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/605 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/621 variables, 16/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/621 variables, 8/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/621 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/621 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 621/621 variables, and 440 constraints, problems are : Problem set: 0 solved, 1 unsolved in 459 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 250/250 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 209/234 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 371/605 variables, 234/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/605 variables, 107/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/605 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/605 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/621 variables, 16/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/621 variables, 8/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/621 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/621 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 621/621 variables, and 441 constraints, problems are : Problem set: 0 solved, 1 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 250/250 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 861ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 25 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 526/526 transitions.
Applied a total of 0 rules in 20 ms. Remains 250 /250 variables (removed 0) and now considering 526/526 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 250/250 places, 526/526 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 526/526 transitions.
Applied a total of 0 rules in 17 ms. Remains 250 /250 variables (removed 0) and now considering 526/526 (removed 0) transitions.
[2024-05-24 16:43:46] [INFO ] Flow matrix only has 371 transitions (discarded 155 similar events)
[2024-05-24 16:43:46] [INFO ] Invariant cache hit.
[2024-05-24 16:43:46] [INFO ] Implicit Places using invariants in 430 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 433 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 242/250 places, 526/526 transitions.
Applied a total of 0 rules in 16 ms. Remains 242 /242 variables (removed 0) and now considering 526/526 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 467 ms. Remains : 242/250 places, 526/526 transitions.
RANDOM walk for 40000 steps (8 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1072739 steps, run timeout after 3016 ms. (steps per millisecond=355 ) properties seen :0 out of 1
Probabilistic random walk after 1072739 steps, saw 526449 distinct states, run finished after 3017 ms. (steps per millisecond=355 ) properties seen :0
[2024-05-24 16:43:49] [INFO ] Flow matrix only has 371 transitions (discarded 155 similar events)
// Phase 1: matrix 371 rows 242 cols
[2024-05-24 16:43:49] [INFO ] Computed 74 invariants in 21 ms
[2024-05-24 16:43:49] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 201/226 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:43:49] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 371/597 variables, 226/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 43/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/613 variables, 16/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/613 variables, 8/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/613 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/613 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 613/613 variables, and 360 constraints, problems are : Problem set: 0 solved, 1 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 201/226 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 371/597 variables, 226/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 43/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/613 variables, 16/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/613 variables, 8/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/613 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/613 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 613/613 variables, and 361 constraints, problems are : Problem set: 0 solved, 1 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 782ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 94 ms.
Support contains 25 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 526/526 transitions.
Applied a total of 0 rules in 11 ms. Remains 242 /242 variables (removed 0) and now considering 526/526 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 242/242 places, 526/526 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 526/526 transitions.
Applied a total of 0 rules in 10 ms. Remains 242 /242 variables (removed 0) and now considering 526/526 (removed 0) transitions.
[2024-05-24 16:43:50] [INFO ] Flow matrix only has 371 transitions (discarded 155 similar events)
[2024-05-24 16:43:50] [INFO ] Invariant cache hit.
[2024-05-24 16:43:50] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-24 16:43:50] [INFO ] Flow matrix only has 371 transitions (discarded 155 similar events)
[2024-05-24 16:43:50] [INFO ] Invariant cache hit.
[2024-05-24 16:43:51] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 16:43:51] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
[2024-05-24 16:43:51] [INFO ] Redundant transitions in 25 ms returned []
Running 518 sub problems to find dead transitions.
[2024-05-24 16:43:51] [INFO ] Flow matrix only has 371 transitions (discarded 155 similar events)
[2024-05-24 16:43:51] [INFO ] Invariant cache hit.
[2024-05-24 16:43:51] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (OVERLAPS) 8/242 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-24 16:43:56] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-24 16:43:56] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:43:56] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:43:56] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:43:56] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:43:56] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:43:56] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:43:56] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:43:56] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:43:56] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 1 ms to minimize.
[2024-05-24 16:43:57] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:43:57] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-24 16:43:57] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:43:57] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:43:57] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-05-24 16:43:57] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-05-24 16:43:57] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 2 ms to minimize.
[2024-05-24 16:43:57] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:43:57] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-05-24 16:43:57] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-24 16:44:00] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:44:00] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2024-05-24 16:44:00] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:44:00] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:44:00] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:44:00] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-24 16:44:00] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:44:00] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:44:00] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:44:00] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2024-05-24 16:44:00] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-24 16:44:01] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-24 16:44:01] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2024-05-24 16:44:01] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2024-05-24 16:44:01] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 1 ms to minimize.
[2024-05-24 16:44:01] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 1 ms to minimize.
[2024-05-24 16:44:01] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 2 ms to minimize.
[2024-05-24 16:44:01] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-05-24 16:44:02] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 1 ms to minimize.
[2024-05-24 16:44:02] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-24 16:44:02] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-24 16:44:02] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
[2024-05-24 16:44:02] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-24 16:44:03] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 1 ms to minimize.
[2024-05-24 16:44:03] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 1 ms to minimize.
[2024-05-24 16:44:03] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2024-05-24 16:44:03] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 2 ms to minimize.
[2024-05-24 16:44:03] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 1 ms to minimize.
[2024-05-24 16:44:03] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 1 ms to minimize.
[2024-05-24 16:44:03] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 1 ms to minimize.
[2024-05-24 16:44:03] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2024-05-24 16:44:04] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 2 ms to minimize.
[2024-05-24 16:44:04] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 2 ms to minimize.
[2024-05-24 16:44:04] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 1 ms to minimize.
[2024-05-24 16:44:04] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 1 ms to minimize.
[2024-05-24 16:44:04] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2024-05-24 16:44:04] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 2 ms to minimize.
[2024-05-24 16:44:04] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 1 ms to minimize.
[2024-05-24 16:44:04] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 2 ms to minimize.
[2024-05-24 16:44:05] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-24 16:44:05] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2024-05-24 16:44:05] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:44:05] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2024-05-24 16:44:05] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:44:05] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:44:05] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:44:05] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:44:05] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:44:06] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 1 ms to minimize.
[2024-05-24 16:44:06] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:44:06] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 2 ms to minimize.
[2024-05-24 16:44:06] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:44:06] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:44:06] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:44:06] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:44:07] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2024-05-24 16:44:07] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2024-05-24 16:44:07] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 1 ms to minimize.
[2024-05-24 16:44:07] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 1 ms to minimize.
[2024-05-24 16:44:07] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-24 16:44:09] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:44:09] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:44:10] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-24 16:44:10] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 1 ms to minimize.
[2024-05-24 16:44:10] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 1 ms to minimize.
[2024-05-24 16:44:10] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:44:10] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:44:10] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:44:10] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-24 16:44:10] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 0 ms to minimize.
[2024-05-24 16:44:11] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:44:11] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-24 16:44:11] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2024-05-24 16:44:11] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-05-24 16:44:11] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 1 ms to minimize.
[2024-05-24 16:44:11] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 1 ms to minimize.
[2024-05-24 16:44:11] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-05-24 16:44:11] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 1 ms to minimize.
[2024-05-24 16:44:11] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:44:12] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
Problem TDEAD121 is UNSAT
Problem TDEAD210 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/174 constraints. Problems are: Problem set: 2 solved, 516 unsolved
[2024-05-24 16:44:12] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:44:12] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-05-24 16:44:12] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:44:12] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 2 ms to minimize.
[2024-05-24 16:44:12] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-24 16:44:13] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2024-05-24 16:44:13] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 3 ms to minimize.
[2024-05-24 16:44:13] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 1 ms to minimize.
[2024-05-24 16:44:13] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 1 ms to minimize.
[2024-05-24 16:44:13] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:44:13] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 2 ms to minimize.
[2024-05-24 16:44:13] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:44:13] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:44:13] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:44:14] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:44:14] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 1 ms to minimize.
[2024-05-24 16:44:14] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 1 ms to minimize.
[2024-05-24 16:44:14] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:44:14] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-24 16:44:14] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/194 constraints. Problems are: Problem set: 2 solved, 516 unsolved
[2024-05-24 16:44:14] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:44:15] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 1 ms to minimize.
[2024-05-24 16:44:15] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:44:15] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:44:15] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-24 16:44:15] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-05-24 16:44:15] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:44:15] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:44:15] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:44:15] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-05-24 16:44:15] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:44:15] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:44:16] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:44:16] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:44:16] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:44:16] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-24 16:44:16] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 1 ms to minimize.
[2024-05-24 16:44:16] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 1 ms to minimize.
[2024-05-24 16:44:17] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:44:17] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 2 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD220 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 20/214 constraints. Problems are: Problem set: 4 solved, 514 unsolved
[2024-05-24 16:44:19] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:44:19] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:44:19] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:44:20] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 1 ms to minimize.
[2024-05-24 16:44:20] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-05-24 16:44:20] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 15 ms to minimize.
[2024-05-24 16:44:20] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-24 16:44:20] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-24 16:44:20] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:44:20] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:44:20] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:44:21] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:44:21] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:44:21] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:44:21] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-24 16:44:21] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-24 16:44:21] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:44:21] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:44:21] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
SMT process timed out in 30492ms, After SMT, problems are : Problem set: 4 solved, 514 unsolved
Search for dead transitions found 4 dead transitions in 30498ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 242/242 places, 522/526 transitions.
Applied a total of 0 rules in 14 ms. Remains 242 /242 variables (removed 0) and now considering 522/522 (removed 0) transitions.
[2024-05-24 16:44:21] [INFO ] Redundant transitions in 10 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 31236 ms. Remains : 242/242 places, 522/526 transitions.
RANDOM walk for 40000 steps (8 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1127337 steps, run timeout after 3001 ms. (steps per millisecond=375 ) properties seen :0 out of 1
Probabilistic random walk after 1127337 steps, saw 551137 distinct states, run finished after 3001 ms. (steps per millisecond=375 ) properties seen :0
[2024-05-24 16:44:24] [INFO ] Flow matrix only has 369 transitions (discarded 153 similar events)
// Phase 1: matrix 369 rows 242 cols
[2024-05-24 16:44:24] [INFO ] Computed 74 invariants in 6 ms
[2024-05-24 16:44:24] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 201/226 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:44:25] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 369/595 variables, 226/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/595 variables, 41/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/595 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/611 variables, 16/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/611 variables, 8/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/611 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/611 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 611/611 variables, and 358 constraints, problems are : Problem set: 0 solved, 1 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 201/226 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 369/595 variables, 226/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/595 variables, 41/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/595 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/595 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/611 variables, 16/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/611 variables, 8/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/611 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/611 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 611/611 variables, and 359 constraints, problems are : Problem set: 0 solved, 1 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 678ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 25 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 522/522 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 522/522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 242/242 places, 522/522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 522/522 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 522/522 (removed 0) transitions.
[2024-05-24 16:44:25] [INFO ] Flow matrix only has 369 transitions (discarded 153 similar events)
[2024-05-24 16:44:25] [INFO ] Invariant cache hit.
[2024-05-24 16:44:25] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-24 16:44:25] [INFO ] Flow matrix only has 369 transitions (discarded 153 similar events)
[2024-05-24 16:44:25] [INFO ] Invariant cache hit.
[2024-05-24 16:44:25] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-24 16:44:26] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2024-05-24 16:44:26] [INFO ] Redundant transitions in 5 ms returned []
Running 514 sub problems to find dead transitions.
[2024-05-24 16:44:26] [INFO ] Flow matrix only has 369 transitions (discarded 153 similar events)
[2024-05-24 16:44:26] [INFO ] Invariant cache hit.
[2024-05-24 16:44:26] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 2 (OVERLAPS) 8/242 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 514 unsolved
[2024-05-24 16:44:30] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-05-24 16:44:30] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:44:31] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:44:31] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:44:31] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-05-24 16:44:31] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:44:31] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:44:31] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:44:31] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:44:31] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:44:31] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:44:31] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:44:31] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-24 16:44:31] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:44:32] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:44:32] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-24 16:44:32] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:44:32] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:44:32] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:44:32] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 514 unsolved
[2024-05-24 16:44:34] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:44:34] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 1 ms to minimize.
[2024-05-24 16:44:34] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:44:34] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:44:35] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:44:35] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:44:35] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:44:35] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:44:35] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:44:35] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:44:35] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 2 ms to minimize.
[2024-05-24 16:44:35] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2024-05-24 16:44:35] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-05-24 16:44:36] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 2 ms to minimize.
[2024-05-24 16:44:36] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-24 16:44:36] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-24 16:44:36] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-05-24 16:44:36] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 2 ms to minimize.
[2024-05-24 16:44:36] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 1 ms to minimize.
[2024-05-24 16:44:36] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 514 unsolved
[2024-05-24 16:44:36] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-24 16:44:36] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-24 16:44:36] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:44:37] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:44:37] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:44:37] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:44:37] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:44:37] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:44:37] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:44:37] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:44:37] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:44:37] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:44:37] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:44:37] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:44:38] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:44:38] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:44:38] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-05-24 16:44:38] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-24 16:44:38] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 2 ms to minimize.
[2024-05-24 16:44:38] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 514 unsolved
[2024-05-24 16:44:38] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:44:38] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:44:39] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:44:39] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:44:39] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:44:39] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:44:39] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:44:39] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:44:39] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:44:39] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 5 ms to minimize.
[2024-05-24 16:44:39] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:44:39] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:44:40] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:44:40] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:44:40] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:44:40] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-24 16:44:40] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:44:40] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:44:40] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:44:40] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 514 unsolved
[2024-05-24 16:44:42] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 2 ms to minimize.
[2024-05-24 16:44:42] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 1 ms to minimize.
[2024-05-24 16:44:43] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 1 ms to minimize.
[2024-05-24 16:44:43] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2024-05-24 16:44:43] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 2 ms to minimize.
[2024-05-24 16:44:43] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 1 ms to minimize.
[2024-05-24 16:44:43] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:44:43] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
[2024-05-24 16:44:43] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 1 ms to minimize.
[2024-05-24 16:44:43] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:44:43] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:44:44] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:44:44] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:44:44] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:44:44] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:44:44] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:44:44] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 1 ms to minimize.
[2024-05-24 16:44:44] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
[2024-05-24 16:44:44] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:44:44] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 514 unsolved
[2024-05-24 16:44:45] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-24 16:44:45] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
[2024-05-24 16:44:45] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:44:45] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:44:45] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:44:45] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:44:45] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2024-05-24 16:44:45] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:44:45] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 3 ms to minimize.
[2024-05-24 16:44:46] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 1 ms to minimize.
[2024-05-24 16:44:46] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:44:46] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:44:46] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:44:46] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:44:46] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 2 ms to minimize.
[2024-05-24 16:44:46] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:44:46] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 1 ms to minimize.
[2024-05-24 16:44:46] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:44:47] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-24 16:44:47] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 514 unsolved
[2024-05-24 16:44:47] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:44:47] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:44:48] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
[2024-05-24 16:44:48] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2024-05-24 16:44:48] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 2 ms to minimize.
[2024-05-24 16:44:48] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 1 ms to minimize.
[2024-05-24 16:44:48] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 2 ms to minimize.
[2024-05-24 16:44:48] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 1 ms to minimize.
[2024-05-24 16:44:48] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 1 ms to minimize.
[2024-05-24 16:44:49] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:44:49] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:44:49] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2024-05-24 16:44:49] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2024-05-24 16:44:49] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
[2024-05-24 16:44:49] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-24 16:44:49] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 1 ms to minimize.
[2024-05-24 16:44:49] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
[2024-05-24 16:44:49] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:44:50] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 2 ms to minimize.
[2024-05-24 16:44:50] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 514 unsolved
[2024-05-24 16:44:52] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 1 ms to minimize.
[2024-05-24 16:44:52] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-05-24 16:44:52] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:44:52] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 1 ms to minimize.
[2024-05-24 16:44:53] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 1 ms to minimize.
[2024-05-24 16:44:53] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
[2024-05-24 16:44:53] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
[2024-05-24 16:44:53] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:44:53] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:44:53] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:44:53] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:44:53] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:44:53] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:44:53] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:44:54] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:44:54] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:44:54] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 1 ms to minimize.
[2024-05-24 16:44:54] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 1 ms to minimize.
[2024-05-24 16:44:54] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:44:54] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 514 unsolved
[2024-05-24 16:44:54] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:44:54] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:44:55] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:44:55] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:44:55] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 1 ms to minimize.
[2024-05-24 16:44:55] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:44:55] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
[2024-05-24 16:44:55] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 2 ms to minimize.
[2024-05-24 16:44:56] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 2 ms to minimize.
[2024-05-24 16:44:56] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2024-05-24 16:44:56] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 1 ms to minimize.
[2024-05-24 16:44:56] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2024-05-24 16:44:56] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 1 ms to minimize.
SMT process timed out in 30360ms, After SMT, problems are : Problem set: 0 solved, 514 unsolved
Search for dead transitions found 0 dead transitions in 30370ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30935 ms. Remains : 242/242 places, 522/522 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 153 transitions
Reduce isomorphic transitions removed 153 transitions.
Iterating post reduction 0 with 153 rules applied. Total rules applied 153 place count 242 transition count 369
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 64 Pre rules applied. Total rules applied 153 place count 242 transition count 305
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 56 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 1 with 184 rules applied. Total rules applied 337 place count 122 transition count 305
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 32 rules applied. Total rules applied 369 place count 106 transition count 289
Applied a total of 369 rules in 56 ms. Remains 106 /242 variables (removed 136) and now considering 289/522 (removed 233) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 289 rows 106 cols
[2024-05-24 16:44:56] [INFO ] Computed 18 invariants in 3 ms
[2024-05-24 16:44:56] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2024-05-24 16:44:56] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 16:44:56] [INFO ] [Nat]Absence check using 18 positive place invariants in 2 ms returned sat
[2024-05-24 16:44:56] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 16:44:57] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-24 16:44:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
TRAPS : Iteration 1
[2024-05-24 16:44:57] [INFO ] After 274ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 16:44:57] [INFO ] After 365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 597 ms.
Computed a total of 1 stabilizing places and 8 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' '!(G((G(p0)||(X(F(p2))&&p1))))'
Support contains 41 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 17 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-05-24 16:44:57] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
// Phase 1: matrix 387 rows 266 cols
[2024-05-24 16:44:57] [INFO ] Computed 82 invariants in 5 ms
[2024-05-24 16:44:57] [INFO ] Implicit Places using invariants in 168 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 170 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/266 places, 542/542 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 258 transition count 534
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 250 transition count 534
Applied a total of 16 rules in 17 ms. Remains 250 /258 variables (removed 8) and now considering 534/542 (removed 8) transitions.
[2024-05-24 16:44:57] [INFO ] Flow matrix only has 379 transitions (discarded 155 similar events)
// Phase 1: matrix 379 rows 250 cols
[2024-05-24 16:44:57] [INFO ] Computed 74 invariants in 2 ms
[2024-05-24 16:44:57] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-24 16:44:57] [INFO ] Flow matrix only has 379 transitions (discarded 155 similar events)
[2024-05-24 16:44:57] [INFO ] Invariant cache hit.
[2024-05-24 16:44:58] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 16:44:58] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 250/266 places, 534/542 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 718 ms. Remains : 250/266 places, 534/542 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-00
Entered a terminal (fully accepting) state of product in 7779 steps with 2578 reset in 137 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-8-LTLFireability-00 finished in 1163 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((G(!p1)||p0))||G(p2)||F(G(!p1))))'
Support contains 49 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 15 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-05-24 16:44:58] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
// Phase 1: matrix 387 rows 266 cols
[2024-05-24 16:44:58] [INFO ] Computed 82 invariants in 2 ms
[2024-05-24 16:44:58] [INFO ] Implicit Places using invariants in 166 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 167 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/266 places, 542/542 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 258 transition count 534
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 250 transition count 534
Applied a total of 16 rules in 13 ms. Remains 250 /258 variables (removed 8) and now considering 534/542 (removed 8) transitions.
[2024-05-24 16:44:58] [INFO ] Flow matrix only has 379 transitions (discarded 155 similar events)
// Phase 1: matrix 379 rows 250 cols
[2024-05-24 16:44:58] [INFO ] Computed 74 invariants in 2 ms
[2024-05-24 16:44:59] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-24 16:44:59] [INFO ] Flow matrix only has 379 transitions (discarded 155 similar events)
[2024-05-24 16:44:59] [INFO ] Invariant cache hit.
[2024-05-24 16:44:59] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 16:44:59] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 250/266 places, 534/542 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 682 ms. Remains : 250/266 places, 534/542 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p2) p1), p1, (AND p1 (NOT p2)), (AND p1 (NOT p0))]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 323 ms.
Stack based approach found an accepted trace after 1403 steps with 0 reset with depth 1404 and stack size 1404 in 5 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-8-LTLFireability-01 finished in 1211 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 17 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 534
Applied a total of 16 rules in 11 ms. Remains 258 /266 variables (removed 8) and now considering 534/542 (removed 8) transitions.
[2024-05-24 16:44:59] [INFO ] Flow matrix only has 379 transitions (discarded 155 similar events)
// Phase 1: matrix 379 rows 258 cols
[2024-05-24 16:44:59] [INFO ] Computed 82 invariants in 3 ms
[2024-05-24 16:45:00] [INFO ] Implicit Places using invariants in 178 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 181 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 250/266 places, 534/542 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 250 transition count 526
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 242 transition count 526
Applied a total of 16 rules in 10 ms. Remains 242 /250 variables (removed 8) and now considering 526/534 (removed 8) transitions.
[2024-05-24 16:45:00] [INFO ] Flow matrix only has 371 transitions (discarded 155 similar events)
// Phase 1: matrix 371 rows 242 cols
[2024-05-24 16:45:00] [INFO ] Computed 74 invariants in 3 ms
[2024-05-24 16:45:00] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-24 16:45:00] [INFO ] Flow matrix only has 371 transitions (discarded 155 similar events)
[2024-05-24 16:45:00] [INFO ] Invariant cache hit.
[2024-05-24 16:45:00] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 16:45:00] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 242/266 places, 526/542 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 768 ms. Remains : 242/266 places, 526/542 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 606 ms.
Stack based approach found an accepted trace after 1178 steps with 0 reset with depth 1179 and stack size 1179 in 8 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-8-LTLFireability-02 finished in 1471 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((G(!p2)&&F(p3)&&p1))||p0)))'
Support contains 49 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 13 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-05-24 16:45:01] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
// Phase 1: matrix 387 rows 266 cols
[2024-05-24 16:45:01] [INFO ] Computed 82 invariants in 4 ms
[2024-05-24 16:45:01] [INFO ] Implicit Places using invariants in 157 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 158 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/266 places, 542/542 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 258 transition count 534
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 250 transition count 534
Applied a total of 16 rules in 10 ms. Remains 250 /258 variables (removed 8) and now considering 534/542 (removed 8) transitions.
[2024-05-24 16:45:01] [INFO ] Flow matrix only has 379 transitions (discarded 155 similar events)
// Phase 1: matrix 379 rows 250 cols
[2024-05-24 16:45:01] [INFO ] Computed 74 invariants in 2 ms
[2024-05-24 16:45:01] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-24 16:45:01] [INFO ] Flow matrix only has 379 transitions (discarded 155 similar events)
[2024-05-24 16:45:01] [INFO ] Invariant cache hit.
[2024-05-24 16:45:01] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 16:45:02] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 250/266 places, 534/542 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 697 ms. Remains : 250/266 places, 534/542 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (OR (NOT p1) (NOT p3) p2), p2, (NOT p3)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-03
Product exploration explored 100000 steps with 34 reset in 397 ms.
Stack based approach found an accepted trace after 669 steps with 0 reset with depth 670 and stack size 670 in 4 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-8-LTLFireability-03 finished in 1327 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&&F(p1)&&X((F(!p2)||G(p0))))))'
Support contains 34 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 4 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-05-24 16:45:02] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
// Phase 1: matrix 387 rows 266 cols
[2024-05-24 16:45:02] [INFO ] Computed 82 invariants in 4 ms
[2024-05-24 16:45:02] [INFO ] Implicit Places using invariants in 171 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 172 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/266 places, 542/542 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 179 ms. Remains : 258/266 places, 542/542 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 1143 ms.
Product exploration explored 100000 steps with 50000 reset in 1135 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p2))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 26 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-COL-8-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-COL-8-LTLFireability-04 finished in 2738 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))&&(G(p1) U p2)))'
Support contains 34 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 3 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-05-24 16:45:05] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
[2024-05-24 16:45:05] [INFO ] Invariant cache hit.
[2024-05-24 16:45:05] [INFO ] Implicit Places using invariants in 174 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 175 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/266 places, 542/542 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 180 ms. Remains : 258/266 places, 542/542 transitions.
Stuttering acceptance computed with spot in 296 ms :[true, (OR (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), p0, (OR (NOT p1) p0)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-8-LTLFireability-05 finished in 493 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((F(p1)||G(p2)))))'
Support contains 105 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-05-24 16:45:06] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
[2024-05-24 16:45:06] [INFO ] Invariant cache hit.
[2024-05-24 16:45:06] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-24 16:45:06] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
[2024-05-24 16:45:06] [INFO ] Invariant cache hit.
[2024-05-24 16:45:06] [INFO ] State equation strengthened by 107 read => feed constraints.
[2024-05-24 16:45:06] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Running 534 sub problems to find dead transitions.
[2024-05-24 16:45:06] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
[2024-05-24 16:45:06] [INFO ] Invariant cache hit.
[2024-05-24 16:45:06] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (OVERLAPS) 8/266 variables, 72/82 constraints. Problems are: Problem set: 0 solved, 534 unsolved
[2024-05-24 16:45:11] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 2 ms to minimize.
[2024-05-24 16:45:11] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 2 ms to minimize.
[2024-05-24 16:45:11] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:45:11] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:45:11] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:45:12] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-05-24 16:45:12] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:45:12] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 4 ms to minimize.
[2024-05-24 16:45:12] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:45:12] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:45:12] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:45:12] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-05-24 16:45:12] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:45:12] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:45:12] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-05-24 16:45:13] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:45:13] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:45:13] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:45:13] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-05-24 16:45:13] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 534 unsolved
[2024-05-24 16:45:15] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:45:15] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:45:15] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
[2024-05-24 16:45:16] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:45:16] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-05-24 16:45:16] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:45:16] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:45:16] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-24 16:45:16] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-24 16:45:16] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-05-24 16:45:16] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 2 ms to minimize.
[2024-05-24 16:45:16] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-05-24 16:45:16] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-24 16:45:16] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:45:17] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:45:17] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:45:17] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:45:17] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-24 16:45:17] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:45:17] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 534 unsolved
[2024-05-24 16:45:17] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-24 16:45:17] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2024-05-24 16:45:17] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:45:18] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:45:18] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:45:18] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:45:18] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-24 16:45:18] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2024-05-24 16:45:18] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:45:18] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-05-24 16:45:18] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-05-24 16:45:18] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:45:18] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:45:19] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:45:19] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:45:19] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:45:19] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:45:19] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2024-05-24 16:45:19] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:45:19] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 1 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD220 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 20/142 constraints. Problems are: Problem set: 2 solved, 532 unsolved
[2024-05-24 16:45:19] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-24 16:45:19] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-05-24 16:45:20] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:45:20] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:45:20] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 2 ms to minimize.
[2024-05-24 16:45:20] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
[2024-05-24 16:45:20] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:45:20] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:45:20] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:45:20] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:45:20] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:45:20] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-24 16:45:21] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:45:21] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:45:21] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:45:21] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:45:21] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:45:21] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-24 16:45:21] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:45:21] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 20/162 constraints. Problems are: Problem set: 2 solved, 532 unsolved
[2024-05-24 16:45:24] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 1 ms to minimize.
[2024-05-24 16:45:24] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 2 ms to minimize.
[2024-05-24 16:45:24] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:45:24] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:45:24] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:45:24] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:45:24] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:45:25] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:45:25] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:45:25] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:45:25] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:45:25] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:45:25] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-05-24 16:45:25] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-05-24 16:45:26] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-05-24 16:45:26] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:45:26] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:45:26] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:45:26] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:45:26] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 20/182 constraints. Problems are: Problem set: 2 solved, 532 unsolved
[2024-05-24 16:45:27] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 1 ms to minimize.
[2024-05-24 16:45:27] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:45:27] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2024-05-24 16:45:27] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 1 ms to minimize.
[2024-05-24 16:45:27] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 1 ms to minimize.
[2024-05-24 16:45:27] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2024-05-24 16:45:27] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
[2024-05-24 16:45:27] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:45:27] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
[2024-05-24 16:45:28] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:45:28] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:45:28] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2024-05-24 16:45:28] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:45:28] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:45:28] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-24 16:45:28] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:45:28] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:45:28] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:45:28] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:45:28] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 20/202 constraints. Problems are: Problem set: 2 solved, 532 unsolved
[2024-05-24 16:45:29] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2024-05-24 16:45:29] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 1 ms to minimize.
[2024-05-24 16:45:29] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:45:29] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:45:29] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:45:30] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:45:30] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:45:30] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:45:30] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:45:30] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:45:30] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:45:30] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:45:30] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:45:30] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
[2024-05-24 16:45:31] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-24 16:45:31] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 1 ms to minimize.
[2024-05-24 16:45:31] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-24 16:45:31] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:45:31] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:45:31] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 20/222 constraints. Problems are: Problem set: 2 solved, 532 unsolved
[2024-05-24 16:45:34] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2024-05-24 16:45:34] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:45:34] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:45:34] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:45:34] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:45:35] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:45:35] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-24 16:45:35] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-24 16:45:35] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:45:35] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:45:35] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:45:35] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-05-24 16:45:35] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:45:35] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
[2024-05-24 16:45:35] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:45:35] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:45:36] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:45:36] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:45:36] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:45:36] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 20/242 constraints. Problems are: Problem set: 2 solved, 532 unsolved
[2024-05-24 16:45:36] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:45:36] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
SMT process timed out in 30291ms, After SMT, problems are : Problem set: 2 solved, 532 unsolved
Search for dead transitions found 2 dead transitions in 30298ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 266/266 places, 540/542 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 540/540 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30769 ms. Remains : 266/266 places, 540/542 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 290 ms.
Product exploration explored 100000 steps with 50000 reset in 319 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 18 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-COL-8-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-COL-8-LTLFireability-06 finished in 31543 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)&&(p1 U G(!p1))) U p2)))'
Support contains 42 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-05-24 16:45:37] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
[2024-05-24 16:45:37] [INFO ] Invariant cache hit.
[2024-05-24 16:45:37] [INFO ] Implicit Places using invariants in 166 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 167 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/266 places, 542/542 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 172 ms. Remains : 258/266 places, 542/542 transitions.
Stuttering acceptance computed with spot in 314 ms :[(NOT p2), (NOT p2), (NOT p0), p1, p1, true]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-07
Entered a terminal (fully accepting) state of product in 23 steps with 1 reset in 0 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-8-LTLFireability-07 finished in 507 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(X(F(p0))))'
Support contains 8 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-05-24 16:45:38] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
[2024-05-24 16:45:38] [INFO ] Invariant cache hit.
[2024-05-24 16:45:38] [INFO ] Implicit Places using invariants in 209 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 220 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/266 places, 542/542 transitions.
Applied a total of 0 rules in 1 ms. Remains 258 /258 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 225 ms. Remains : 258/266 places, 542/542 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 190 ms.
Product exploration explored 100000 steps with 33333 reset in 212 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-COL-8-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-COL-8-LTLFireability-08 finished in 803 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(((!p2 U (G(!p2)||(!p2&&(X(!p3) U ((p4&&X(!p3))||G(X(!p3)))))))||p1))||p0)))'
Support contains 65 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 3 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-05-24 16:45:38] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
[2024-05-24 16:45:38] [INFO ] Invariant cache hit.
[2024-05-24 16:45:39] [INFO ] Implicit Places using invariants in 147 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 148 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/266 places, 542/542 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 155 ms. Remains : 258/266 places, 542/542 transitions.
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), true, (AND p2 p3), (AND p2 p3), p3, p3]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-09
Product exploration explored 100000 steps with 20187 reset in 532 ms.
Product exploration explored 100000 steps with 20250 reset in 545 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p4) (NOT p3)), (X (NOT p2)), (X (NOT p4)), (X (AND (NOT p1) (NOT p4) (NOT p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p4) (NOT p2) p3)))), (X (X (NOT (AND p2 p3)))), (X (X (AND (NOT p4) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p4) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 137 ms. Reduced automaton from 7 states, 17 edges and 5 AP (stutter sensitive) to 7 states, 17 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), true, (AND p2 p3), (AND p2 p3), p3, p3]
Reduction of identical properties reduced properties to check from 16 to 14
RANDOM walk for 40000 steps (8 resets) in 339 ms. (117 steps per ms) remains 1/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 536 ms. (74 steps per ms) remains 1/1 properties
[2024-05-24 16:45:41] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
// Phase 1: matrix 387 rows 258 cols
[2024-05-24 16:45:41] [INFO ] Computed 74 invariants in 1 ms
[2024-05-24 16:45:41] [INFO ] State equation strengthened by 43 read => feed constraints.
Problem apf6 is UNSAT
After SMT solving in domain Real declared 8/645 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 0/74 constraints, State Equation: 0/258 constraints, ReadFeed: 0/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 39ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p4) (NOT p3)), (X (NOT p2)), (X (NOT p4)), (X (AND (NOT p1) (NOT p4) (NOT p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p4) (NOT p2) p3)))), (X (X (NOT (AND p2 p3)))), (X (X (AND (NOT p4) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p4) p2)))), (G (OR p1 (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3) (NOT p4)))), (F (NOT (OR p2 (NOT p3) p4))), (F p0), (F (NOT (OR (NOT p3) p4))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p4)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p1), (F (NOT (OR (NOT p2) p4))), (F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (OR p2 (NOT p3)))), (F p2), (F p4), (F p3), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p3) (NOT p4))))]
Knowledge based reduction with 17 factoid took 690 ms. Reduced automaton from 7 states, 17 edges and 5 AP (stutter sensitive) to 7 states, 16 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p0) (NOT p1) p2 p3), (AND (NOT p1) p2 p3), true, (AND p2 p3), (AND p2 p3), p3, p3]
Stuttering acceptance computed with spot in 311 ms :[(AND (NOT p0) (NOT p1) p2 p3), (AND (NOT p1) p2 p3), true, (AND p2 p3), (AND p2 p3), p3, p3]
Support contains 65 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 542/542 transitions.
Applied a total of 0 rules in 3 ms. Remains 258 /258 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-05-24 16:45:42] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
[2024-05-24 16:45:42] [INFO ] Invariant cache hit.
[2024-05-24 16:45:42] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-24 16:45:42] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
[2024-05-24 16:45:42] [INFO ] Invariant cache hit.
[2024-05-24 16:45:42] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 16:45:42] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 534 sub problems to find dead transitions.
[2024-05-24 16:45:42] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
[2024-05-24 16:45:42] [INFO ] Invariant cache hit.
[2024-05-24 16:45:42] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (OVERLAPS) 8/258 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 534 unsolved
[2024-05-24 16:45:47] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 1 ms to minimize.
[2024-05-24 16:45:47] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 1 ms to minimize.
[2024-05-24 16:45:48] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 1 ms to minimize.
[2024-05-24 16:45:48] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:45:48] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2024-05-24 16:45:48] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:45:48] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:45:48] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:45:48] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:45:48] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2024-05-24 16:45:48] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:45:49] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
[2024-05-24 16:45:49] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:45:49] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:45:49] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-05-24 16:45:49] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:45:49] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:45:49] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:45:49] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-24 16:45:49] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 534 unsolved
[2024-05-24 16:45:52] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:45:52] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:45:52] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-24 16:45:52] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-24 16:45:52] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-24 16:45:52] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:45:52] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 3 ms to minimize.
[2024-05-24 16:45:52] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:45:52] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:45:52] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:45:52] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:45:52] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:45:53] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:45:53] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
[2024-05-24 16:45:53] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:45:53] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:45:53] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:45:53] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-24 16:45:53] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:45:53] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 534 unsolved
[2024-05-24 16:45:53] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:45:54] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:45:54] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-24 16:45:54] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:45:54] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-24 16:45:54] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-05-24 16:45:54] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:45:54] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-05-24 16:45:54] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:45:54] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-05-24 16:45:54] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-24 16:45:54] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-24 16:45:54] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-24 16:45:55] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:45:55] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-05-24 16:45:55] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-24 16:45:55] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:45:55] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-05-24 16:45:55] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:45:55] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 534 unsolved
[2024-05-24 16:45:56] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:45:56] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:45:56] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:45:56] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
[2024-05-24 16:45:56] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:45:56] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:45:56] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:45:56] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:45:56] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:45:56] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-05-24 16:45:56] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-24 16:45:57] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:45:57] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:45:57] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:45:57] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:45:57] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:45:57] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:45:57] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:45:57] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:45:57] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 534 unsolved
[2024-05-24 16:46:00] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-24 16:46:00] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:46:00] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:46:00] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 1 ms to minimize.
[2024-05-24 16:46:00] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-24 16:46:00] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:46:00] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:46:00] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:46:01] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:46:01] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:46:01] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:46:01] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:46:01] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-24 16:46:01] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:46:01] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:46:02] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:46:02] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-05-24 16:46:02] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:46:02] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:46:02] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
Problem TDEAD121 is UNSAT
Problem TDEAD210 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 20/174 constraints. Problems are: Problem set: 2 solved, 532 unsolved
[2024-05-24 16:46:02] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:46:03] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:46:03] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:46:03] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 1 ms to minimize.
[2024-05-24 16:46:03] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:46:03] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:46:03] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:46:03] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:46:03] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:46:03] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:46:03] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:46:04] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:46:04] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:46:04] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:46:04] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:46:04] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-24 16:46:04] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:46:04] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-24 16:46:04] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:46:04] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 20/194 constraints. Problems are: Problem set: 2 solved, 532 unsolved
[2024-05-24 16:46:05] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:46:05] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:46:05] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:46:05] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:46:05] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-05-24 16:46:05] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:46:05] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 2 ms to minimize.
[2024-05-24 16:46:05] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-24 16:46:05] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:46:05] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:46:06] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:46:06] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-24 16:46:06] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:46:06] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:46:06] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:46:06] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-05-24 16:46:06] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:46:06] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 2 ms to minimize.
[2024-05-24 16:46:06] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:46:07] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 20/214 constraints. Problems are: Problem set: 2 solved, 532 unsolved
[2024-05-24 16:46:10] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:46:10] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:46:10] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:46:10] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-05-24 16:46:10] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:46:10] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:46:10] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-05-24 16:46:10] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 2 ms to minimize.
[2024-05-24 16:46:10] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 2 ms to minimize.
[2024-05-24 16:46:10] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-24 16:46:10] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:46:11] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:46:11] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-05-24 16:46:11] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:46:11] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:46:11] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-05-24 16:46:11] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:46:11] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-24 16:46:11] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-24 16:46:11] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 20/234 constraints. Problems are: Problem set: 2 solved, 532 unsolved
[2024-05-24 16:46:12] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:46:12] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:46:12] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:46:12] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-24 16:46:12] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:46:12] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-24 16:46:12] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2024-05-24 16:46:12] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:46:13] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:46:13] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
SMT process timed out in 30334ms, After SMT, problems are : Problem set: 2 solved, 532 unsolved
Search for dead transitions found 2 dead transitions in 30341ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 258/258 places, 540/542 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 540/540 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30755 ms. Remains : 258/258 places, 540/542 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p4) (NOT p2) (NOT p3)), (X (NOT p4)), (X (NOT p1)), (X (AND (NOT p1) (NOT p4))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND p2 (NOT p4))))), (X (X (AND (NOT p2) (NOT p3) (NOT p4))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 109 ms. Reduced automaton from 7 states, 16 edges and 5 AP (stutter sensitive) to 7 states, 16 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p0) (NOT p1) p2 p3), (AND (NOT p1) p2 p3), true, (AND p2 p3), (AND p2 p3), p3, p3]
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 8140 steps (1 resets) in 52 ms. (153 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p4) (NOT p2) (NOT p3)), (X (NOT p4)), (X (NOT p1)), (X (AND (NOT p1) (NOT p4))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND p2 (NOT p4))))), (X (X (AND (NOT p2) (NOT p3) (NOT p4))))]
False Knowledge obtained : [(F (NOT (AND (NOT p4) (NOT p1)))), (F p0), (F p1), (F (NOT (OR p2 (NOT p3)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p3) p4))), (F (NOT (AND (NOT p2) (NOT p3) (NOT p4)))), (F (NOT (OR (NOT p2) p4))), (F (NOT (OR p2 (NOT p3) p4))), (F p2), (F p4), (F p3), (F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p3) (NOT p4))))]
Knowledge based reduction with 13 factoid took 552 ms. Reduced automaton from 7 states, 16 edges and 5 AP (stutter sensitive) to 7 states, 16 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p0) (NOT p1) p2 p3), (AND (NOT p1) p2 p3), true, (AND p2 p3), (AND p2 p3), p3, p3]
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p1) p2 p3), (AND (NOT p1) p2 p3), true, (AND p2 p3), (AND p2 p3), p3, p3]
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) (NOT p1) p2 p3), (AND (NOT p1) p2 p3), true, (AND p2 p3), (AND p2 p3), p3, p3]
Product exploration explored 100000 steps with 20201 reset in 401 ms.
Product exploration explored 100000 steps with 20140 reset in 423 ms.
Applying partial POR strategy [false, false, true, false, false, true, false]
Stuttering acceptance computed with spot in 404 ms :[(AND (NOT p0) (NOT p1) p2 p3), (AND (NOT p1) p2 p3), true, (AND p2 p3), (AND p2 p3), p3, p3]
Support contains 65 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 540/540 transitions.
Applied a total of 0 rules in 22 ms. Remains 258 /258 variables (removed 0) and now considering 540/540 (removed 0) transitions.
[2024-05-24 16:46:16] [INFO ] Redundant transitions in 3 ms returned []
Running 532 sub problems to find dead transitions.
[2024-05-24 16:46:16] [INFO ] Flow matrix only has 386 transitions (discarded 154 similar events)
// Phase 1: matrix 386 rows 258 cols
[2024-05-24 16:46:16] [INFO ] Computed 74 invariants in 2 ms
[2024-05-24 16:46:16] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 2 (OVERLAPS) 8/258 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 532 unsolved
[2024-05-24 16:46:21] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 2 ms to minimize.
[2024-05-24 16:46:21] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:46:21] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:46:21] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:46:21] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:46:21] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2024-05-24 16:46:21] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:46:22] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:46:22] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:46:22] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:46:22] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 2 ms to minimize.
[2024-05-24 16:46:22] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:46:22] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:46:22] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:46:22] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:46:22] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:46:22] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-05-24 16:46:23] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-24 16:46:23] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-24 16:46:23] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 532 unsolved
[2024-05-24 16:46:25] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:46:25] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-05-24 16:46:25] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:46:25] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:46:25] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:46:25] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-24 16:46:25] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-24 16:46:26] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:46:26] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:46:26] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:46:26] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:46:26] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:46:26] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-24 16:46:26] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:46:26] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:46:26] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:46:26] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-05-24 16:46:26] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:46:27] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:46:27] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 532 unsolved
[2024-05-24 16:46:27] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-24 16:46:27] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:46:27] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:46:27] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:46:28] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:46:28] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:46:28] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:46:28] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:46:28] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-05-24 16:46:28] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:46:28] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
[2024-05-24 16:46:28] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:46:28] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:46:28] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:46:28] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:46:29] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:46:29] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:46:29] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:46:29] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:46:29] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 532 unsolved
[2024-05-24 16:46:29] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-24 16:46:29] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:46:29] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:46:29] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:46:29] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-24 16:46:30] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:46:30] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:46:30] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:46:30] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:46:30] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:46:30] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:46:30] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:46:30] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 2 ms to minimize.
[2024-05-24 16:46:30] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:46:30] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-05-24 16:46:30] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:46:31] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:46:31] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:46:31] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:46:31] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 532 unsolved
[2024-05-24 16:46:33] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-24 16:46:33] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:46:33] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:46:34] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:46:34] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-05-24 16:46:34] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:46:34] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:46:34] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-24 16:46:34] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:46:34] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:46:35] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:46:35] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:46:35] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-24 16:46:35] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:46:35] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:46:35] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:46:35] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:46:35] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:46:35] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
[2024-05-24 16:46:35] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 532 unsolved
[2024-05-24 16:46:36] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:46:36] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:46:36] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
[2024-05-24 16:46:36] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:46:36] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:46:36] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:46:36] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:46:36] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-05-24 16:46:36] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:46:36] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:46:37] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:46:37] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:46:37] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:46:37] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:46:37] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-24 16:46:37] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-24 16:46:37] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:46:37] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-05-24 16:46:38] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:46:38] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 532 unsolved
[2024-05-24 16:46:38] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:46:38] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-05-24 16:46:38] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:46:39] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-05-24 16:46:39] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:46:39] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:46:39] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:46:39] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-24 16:46:39] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:46:39] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:46:39] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:46:39] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:46:39] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 2 ms to minimize.
[2024-05-24 16:46:39] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:46:40] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
[2024-05-24 16:46:40] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:46:40] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:46:40] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-05-24 16:46:40] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:46:40] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 532 unsolved
[2024-05-24 16:46:43] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:46:43] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:46:43] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:46:43] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:46:43] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:46:43] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:46:44] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:46:44] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:46:44] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:46:44] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:46:44] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:46:44] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:46:44] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:46:44] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:46:44] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:46:44] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:46:45] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:46:45] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:46:45] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:46:45] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 532 unsolved
[2024-05-24 16:46:45] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:46:45] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:46:46] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:46:46] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:46:46] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:46:46] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:46:46] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:46:46] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:46:46] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 1 ms to minimize.
SMT process timed out in 30338ms, After SMT, problems are : Problem set: 0 solved, 532 unsolved
Search for dead transitions found 0 dead transitions in 30345ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30375 ms. Remains : 258/258 places, 540/540 transitions.
Built C files in :
/tmp/ltsmin13917937210687296209
[2024-05-24 16:46:46] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13917937210687296209
Running compilation step : cd /tmp/ltsmin13917937210687296209;'/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 1094 ms.
Running link step : cd /tmp/ltsmin13917937210687296209;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin13917937210687296209;'/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/stateBased13000086645406314855.hoa' '--buchi-type=spotba'
LTSmin run took 352 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-8-LTLFireability-09 finished in 69538 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' '!(((!p0&&F(!p1)) U ((p0 U p1)&&X(F(!p1)))))'
Support contains 80 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 4 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-05-24 16:46:48] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
// Phase 1: matrix 387 rows 266 cols
[2024-05-24 16:46:48] [INFO ] Computed 82 invariants in 1 ms
[2024-05-24 16:46:48] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-24 16:46:48] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
[2024-05-24 16:46:48] [INFO ] Invariant cache hit.
[2024-05-24 16:46:48] [INFO ] State equation strengthened by 107 read => feed constraints.
[2024-05-24 16:46:48] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
Running 534 sub problems to find dead transitions.
[2024-05-24 16:46:48] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
[2024-05-24 16:46:48] [INFO ] Invariant cache hit.
[2024-05-24 16:46:48] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (OVERLAPS) 8/266 variables, 72/82 constraints. Problems are: Problem set: 0 solved, 534 unsolved
[2024-05-24 16:46:53] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2024-05-24 16:46:54] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:46:54] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2024-05-24 16:46:54] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:46:54] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:46:54] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:46:54] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:46:54] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:46:54] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:46:54] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-05-24 16:46:54] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:46:55] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:46:55] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:46:55] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:46:55] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-24 16:46:55] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:46:55] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 2 ms to minimize.
[2024-05-24 16:46:55] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-24 16:46:55] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-24 16:46:55] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 534 unsolved
[2024-05-24 16:46:58] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:46:58] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2024-05-24 16:46:58] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:46:58] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:46:58] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:46:58] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:46:58] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:46:58] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:46:58] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:46:58] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-05-24 16:46:58] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:46:59] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:46:59] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-24 16:46:59] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:46:59] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:46:59] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:46:59] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:46:59] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-24 16:46:59] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:46:59] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 534 unsolved
[2024-05-24 16:46:59] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:47:00] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
[2024-05-24 16:47:00] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:47:00] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:47:00] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:47:00] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:47:00] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-24 16:47:00] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:47:00] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:47:00] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:47:00] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:47:01] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:47:01] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:47:01] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:47:01] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:47:01] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:47:01] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-05-24 16:47:01] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:47:01] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:47:01] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 2 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD220 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 20/142 constraints. Problems are: Problem set: 2 solved, 532 unsolved
[2024-05-24 16:47:01] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-24 16:47:02] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:47:02] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:47:02] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:47:02] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:47:02] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-24 16:47:02] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:47:02] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:47:02] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 2 ms to minimize.
[2024-05-24 16:47:02] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:47:02] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-05-24 16:47:03] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:47:03] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:47:03] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:47:03] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:47:03] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:47:03] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:47:03] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:47:03] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:47:03] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 20/162 constraints. Problems are: Problem set: 2 solved, 532 unsolved
[2024-05-24 16:47:06] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 1 ms to minimize.
[2024-05-24 16:47:06] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 1 ms to minimize.
[2024-05-24 16:47:06] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-05-24 16:47:06] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 1 ms to minimize.
[2024-05-24 16:47:06] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:47:06] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 1 ms to minimize.
[2024-05-24 16:47:07] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 2 ms to minimize.
[2024-05-24 16:47:07] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:47:07] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 1 ms to minimize.
[2024-05-24 16:47:07] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2024-05-24 16:47:07] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-05-24 16:47:08] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:47:08] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-05-24 16:47:08] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 1 ms to minimize.
[2024-05-24 16:47:08] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
[2024-05-24 16:47:08] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-05-24 16:47:08] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 2 ms to minimize.
[2024-05-24 16:47:08] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 2 ms to minimize.
[2024-05-24 16:47:08] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-24 16:47:08] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 20/182 constraints. Problems are: Problem set: 2 solved, 532 unsolved
[2024-05-24 16:47:09] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 1 ms to minimize.
[2024-05-24 16:47:09] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2024-05-24 16:47:09] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 2 ms to minimize.
[2024-05-24 16:47:09] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 1 ms to minimize.
[2024-05-24 16:47:10] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 1 ms to minimize.
[2024-05-24 16:47:10] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:47:10] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 2 ms to minimize.
[2024-05-24 16:47:10] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
[2024-05-24 16:47:10] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:47:10] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 1 ms to minimize.
[2024-05-24 16:47:10] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 1 ms to minimize.
[2024-05-24 16:47:10] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 2 ms to minimize.
[2024-05-24 16:47:11] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
[2024-05-24 16:47:11] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-24 16:47:11] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:47:11] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 2 ms to minimize.
[2024-05-24 16:47:11] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:47:11] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:47:11] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 1 ms to minimize.
[2024-05-24 16:47:11] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 20/202 constraints. Problems are: Problem set: 2 solved, 532 unsolved
[2024-05-24 16:47:12] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2024-05-24 16:47:12] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 1 ms to minimize.
[2024-05-24 16:47:12] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 2 ms to minimize.
[2024-05-24 16:47:12] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 2 ms to minimize.
[2024-05-24 16:47:12] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2024-05-24 16:47:12] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 2 ms to minimize.
[2024-05-24 16:47:13] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:47:13] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-05-24 16:47:13] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 1 ms to minimize.
[2024-05-24 16:47:13] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2024-05-24 16:47:13] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2024-05-24 16:47:13] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
[2024-05-24 16:47:13] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:47:13] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 1 ms to minimize.
[2024-05-24 16:47:14] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 2 ms to minimize.
[2024-05-24 16:47:14] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 2 ms to minimize.
[2024-05-24 16:47:14] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 1 ms to minimize.
[2024-05-24 16:47:14] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:47:14] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 1 ms to minimize.
[2024-05-24 16:47:14] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 20/222 constraints. Problems are: Problem set: 2 solved, 532 unsolved
[2024-05-24 16:47:17] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:47:18] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-05-24 16:47:18] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 1 ms to minimize.
[2024-05-24 16:47:18] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
[2024-05-24 16:47:18] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 2 ms to minimize.
[2024-05-24 16:47:18] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2024-05-24 16:47:18] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:47:18] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:47:18] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-05-24 16:47:18] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:47:19] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
[2024-05-24 16:47:19] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
SMT process timed out in 30293ms, After SMT, problems are : Problem set: 2 solved, 532 unsolved
Search for dead transitions found 2 dead transitions in 30300ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 266/266 places, 540/542 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 540/540 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30826 ms. Remains : 266/266 places, 540/542 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, p1, (NOT p1), true]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-10
Product exploration explored 100000 steps with 3787 reset in 329 ms.
Product exploration explored 100000 steps with 3764 reset in 296 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 197 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[p1, p1]
RANDOM walk for 93 steps (0 resets) in 5 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 11 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[p1, p1]
Stuttering acceptance computed with spot in 62 ms :[p1, p1]
[2024-05-24 16:47:20] [INFO ] Flow matrix only has 386 transitions (discarded 154 similar events)
// Phase 1: matrix 386 rows 266 cols
[2024-05-24 16:47:20] [INFO ] Computed 82 invariants in 5 ms
[2024-05-24 16:47:20] [INFO ] [Real]Absence check using 82 positive place invariants in 21 ms returned sat
[2024-05-24 16:47:20] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-24 16:47:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:47:21] [INFO ] [Nat]Absence check using 82 positive place invariants in 23 ms returned sat
[2024-05-24 16:47:21] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2024-05-24 16:47:21] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-24 16:47:21] [INFO ] [Nat]Added 106 Read/Feed constraints in 21 ms returned sat
[2024-05-24 16:47:21] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-05-24 16:47:21] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:47:21] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:47:21] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:47:21] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-24 16:47:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 471 ms
[2024-05-24 16:47:21] [INFO ] Computed and/alt/rep : 274/1602/274 causal constraints (skipped 104 transitions) in 29 ms.
[2024-05-24 16:47:22] [INFO ] Added : 99 causal constraints over 20 iterations in 677 ms. Result :sat
Could not prove EG p1
Support contains 8 out of 266 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 540/540 transitions.
Applied a total of 0 rules in 8 ms. Remains 266 /266 variables (removed 0) and now considering 540/540 (removed 0) transitions.
[2024-05-24 16:47:22] [INFO ] Flow matrix only has 386 transitions (discarded 154 similar events)
[2024-05-24 16:47:22] [INFO ] Invariant cache hit.
[2024-05-24 16:47:22] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-24 16:47:22] [INFO ] Flow matrix only has 386 transitions (discarded 154 similar events)
[2024-05-24 16:47:22] [INFO ] Invariant cache hit.
[2024-05-24 16:47:22] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-24 16:47:23] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
[2024-05-24 16:47:23] [INFO ] Redundant transitions in 3 ms returned []
Running 532 sub problems to find dead transitions.
[2024-05-24 16:47:23] [INFO ] Flow matrix only has 386 transitions (discarded 154 similar events)
[2024-05-24 16:47:23] [INFO ] Invariant cache hit.
[2024-05-24 16:47:23] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 2 (OVERLAPS) 8/266 variables, 72/82 constraints. Problems are: Problem set: 0 solved, 532 unsolved
[2024-05-24 16:47:28] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:47:28] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2024-05-24 16:47:28] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-05-24 16:47:28] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 2 ms to minimize.
[2024-05-24 16:47:28] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-24 16:47:28] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 2 ms to minimize.
[2024-05-24 16:47:29] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-24 16:47:29] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 1 ms to minimize.
[2024-05-24 16:47:29] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 1 ms to minimize.
[2024-05-24 16:47:29] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-05-24 16:47:29] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-24 16:47:29] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-24 16:47:29] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:47:29] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2024-05-24 16:47:29] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 1 ms to minimize.
[2024-05-24 16:47:30] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 2 ms to minimize.
[2024-05-24 16:47:30] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 2 ms to minimize.
[2024-05-24 16:47:30] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
[2024-05-24 16:47:30] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:47:30] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 532 unsolved
[2024-05-24 16:47:32] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
[2024-05-24 16:47:32] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 2 ms to minimize.
[2024-05-24 16:47:33] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2024-05-24 16:47:33] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 2 ms to minimize.
[2024-05-24 16:47:33] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 2 ms to minimize.
[2024-05-24 16:47:33] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 2 ms to minimize.
[2024-05-24 16:47:33] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-24 16:47:33] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 2 ms to minimize.
[2024-05-24 16:47:33] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 2 ms to minimize.
[2024-05-24 16:47:33] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 1 ms to minimize.
[2024-05-24 16:47:34] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:47:34] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 1 ms to minimize.
[2024-05-24 16:47:34] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:47:34] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-05-24 16:47:34] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 1 ms to minimize.
[2024-05-24 16:47:34] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 1 ms to minimize.
[2024-05-24 16:47:34] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2024-05-24 16:47:34] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 2 ms to minimize.
[2024-05-24 16:47:34] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 1 ms to minimize.
[2024-05-24 16:47:35] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 532 unsolved
[2024-05-24 16:47:35] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-24 16:47:35] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-24 16:47:35] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-24 16:47:35] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 1 ms to minimize.
[2024-05-24 16:47:35] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 1 ms to minimize.
[2024-05-24 16:47:35] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 2 ms to minimize.
[2024-05-24 16:47:35] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2024-05-24 16:47:35] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2024-05-24 16:47:36] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 2 ms to minimize.
[2024-05-24 16:47:36] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 1 ms to minimize.
[2024-05-24 16:47:36] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:47:36] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:47:36] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:47:36] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 1 ms to minimize.
[2024-05-24 16:47:36] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-05-24 16:47:36] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 2 ms to minimize.
[2024-05-24 16:47:36] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:47:37] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:47:37] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 1 ms to minimize.
[2024-05-24 16:47:37] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 532 unsolved
[2024-05-24 16:47:37] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
[2024-05-24 16:47:37] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2024-05-24 16:47:37] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 2 ms to minimize.
[2024-05-24 16:47:37] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 2 ms to minimize.
[2024-05-24 16:47:37] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 1 ms to minimize.
[2024-05-24 16:47:38] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
[2024-05-24 16:47:38] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 2 ms to minimize.
[2024-05-24 16:47:38] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:47:38] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 2 ms to minimize.
[2024-05-24 16:47:38] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
[2024-05-24 16:47:38] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-24 16:47:39] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-05-24 16:47:39] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 1 ms to minimize.
[2024-05-24 16:47:39] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 1 ms to minimize.
[2024-05-24 16:47:39] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:47:39] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-05-24 16:47:39] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
[2024-05-24 16:47:39] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:47:39] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:47:39] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 2 ms to minimize.
Problem TDEAD121 is UNSAT
Problem TDEAD209 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 20/162 constraints. Problems are: Problem set: 2 solved, 530 unsolved
[2024-05-24 16:47:42] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 2 ms to minimize.
[2024-05-24 16:47:42] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:47:42] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 1 ms to minimize.
[2024-05-24 16:47:42] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 2 ms to minimize.
[2024-05-24 16:47:42] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:47:42] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:47:43] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:47:43] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 1 ms to minimize.
[2024-05-24 16:47:43] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:47:43] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 1 ms to minimize.
[2024-05-24 16:47:43] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
[2024-05-24 16:47:43] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:47:43] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:47:43] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:47:43] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:47:43] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2024-05-24 16:47:44] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:47:44] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 1 ms to minimize.
[2024-05-24 16:47:44] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 2 ms to minimize.
[2024-05-24 16:47:44] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 20/182 constraints. Problems are: Problem set: 2 solved, 530 unsolved
[2024-05-24 16:47:44] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
[2024-05-24 16:47:44] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-05-24 16:47:45] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2024-05-24 16:47:45] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:47:45] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 1 ms to minimize.
[2024-05-24 16:47:45] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 1 ms to minimize.
[2024-05-24 16:47:45] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 1 ms to minimize.
[2024-05-24 16:47:45] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:47:45] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:47:45] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:47:45] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-24 16:47:45] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:47:46] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 1 ms to minimize.
[2024-05-24 16:47:46] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:47:46] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 1 ms to minimize.
[2024-05-24 16:47:46] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:47:46] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-24 16:47:46] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 1 ms to minimize.
[2024-05-24 16:47:46] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:47:46] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 20/202 constraints. Problems are: Problem set: 2 solved, 530 unsolved
[2024-05-24 16:47:47] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 1 ms to minimize.
[2024-05-24 16:47:47] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 2 ms to minimize.
[2024-05-24 16:47:47] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:47:47] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:47:47] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:47:47] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:47:47] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:47:47] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:47:48] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-05-24 16:47:48] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:47:48] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:47:48] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 1 ms to minimize.
[2024-05-24 16:47:48] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:47:48] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:47:48] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 1 ms to minimize.
[2024-05-24 16:47:48] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:47:48] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
[2024-05-24 16:47:49] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:47:49] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-05-24 16:47:49] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 20/222 constraints. Problems are: Problem set: 2 solved, 530 unsolved
[2024-05-24 16:47:51] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 1 ms to minimize.
[2024-05-24 16:47:52] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 2 ms to minimize.
[2024-05-24 16:47:52] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 2 ms to minimize.
[2024-05-24 16:47:52] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
[2024-05-24 16:47:52] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-05-24 16:47:52] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:47:52] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 1 ms to minimize.
[2024-05-24 16:47:52] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2024-05-24 16:47:52] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:47:52] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:47:53] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:47:53] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 2 ms to minimize.
[2024-05-24 16:47:53] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
SMT process timed out in 30383ms, After SMT, problems are : Problem set: 2 solved, 530 unsolved
Search for dead transitions found 2 dead transitions in 30389ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 266/266 places, 538/540 transitions.
Applied a total of 0 rules in 8 ms. Remains 266 /266 variables (removed 0) and now considering 538/538 (removed 0) transitions.
[2024-05-24 16:47:53] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 31012 ms. Remains : 266/266 places, 538/540 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[p1, p1]
RANDOM walk for 114 steps (0 resets) in 7 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[p1, p1]
Stuttering acceptance computed with spot in 62 ms :[p1, p1]
[2024-05-24 16:47:54] [INFO ] Flow matrix only has 385 transitions (discarded 153 similar events)
// Phase 1: matrix 385 rows 266 cols
[2024-05-24 16:47:54] [INFO ] Computed 82 invariants in 1 ms
[2024-05-24 16:47:54] [INFO ] [Real]Absence check using 82 positive place invariants in 22 ms returned sat
[2024-05-24 16:47:54] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2024-05-24 16:47:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:47:54] [INFO ] [Nat]Absence check using 82 positive place invariants in 21 ms returned sat
[2024-05-24 16:47:54] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2024-05-24 16:47:54] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-05-24 16:47:54] [INFO ] [Nat]Added 105 Read/Feed constraints in 20 ms returned sat
[2024-05-24 16:47:54] [INFO ] Computed and/alt/rep : 273/1593/273 causal constraints (skipped 104 transitions) in 30 ms.
[2024-05-24 16:47:55] [INFO ] Added : 121 causal constraints over 25 iterations in 832 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 66 ms :[p1, p1]
Product exploration explored 100000 steps with 3786 reset in 253 ms.
Product exploration explored 100000 steps with 3785 reset in 278 ms.
Built C files in :
/tmp/ltsmin16297906827494320479
[2024-05-24 16:47:56] [INFO ] Computing symmetric may disable matrix : 538 transitions.
[2024-05-24 16:47:56] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 16:47:56] [INFO ] Computing symmetric may enable matrix : 538 transitions.
[2024-05-24 16:47:56] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 16:47:56] [INFO ] Computing Do-Not-Accords matrix : 538 transitions.
[2024-05-24 16:47:56] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 16:47:56] [INFO ] Built C files in 132ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16297906827494320479
Running compilation step : cd /tmp/ltsmin16297906827494320479;'/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 1528 ms.
Running link step : cd /tmp/ltsmin16297906827494320479;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16297906827494320479;'/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/stateBased4927670807684918906.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 538/538 transitions.
Applied a total of 0 rules in 14 ms. Remains 266 /266 variables (removed 0) and now considering 538/538 (removed 0) transitions.
[2024-05-24 16:48:11] [INFO ] Flow matrix only has 385 transitions (discarded 153 similar events)
[2024-05-24 16:48:11] [INFO ] Invariant cache hit.
[2024-05-24 16:48:11] [INFO ] Implicit Places using invariants in 182 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 183 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/266 places, 538/538 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 258 transition count 530
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 250 transition count 530
Applied a total of 16 rules in 10 ms. Remains 250 /258 variables (removed 8) and now considering 530/538 (removed 8) transitions.
[2024-05-24 16:48:11] [INFO ] Flow matrix only has 377 transitions (discarded 153 similar events)
// Phase 1: matrix 377 rows 250 cols
[2024-05-24 16:48:11] [INFO ] Computed 74 invariants in 2 ms
[2024-05-24 16:48:11] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-24 16:48:11] [INFO ] Flow matrix only has 377 transitions (discarded 153 similar events)
[2024-05-24 16:48:11] [INFO ] Invariant cache hit.
[2024-05-24 16:48:11] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-24 16:48:12] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 250/266 places, 530/538 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 811 ms. Remains : 250/266 places, 530/538 transitions.
Built C files in :
/tmp/ltsmin17735316435022007519
[2024-05-24 16:48:12] [INFO ] Computing symmetric may disable matrix : 530 transitions.
[2024-05-24 16:48:12] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 16:48:12] [INFO ] Computing symmetric may enable matrix : 530 transitions.
[2024-05-24 16:48:12] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 16:48:12] [INFO ] Computing Do-Not-Accords matrix : 530 transitions.
[2024-05-24 16:48:12] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 16:48:12] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17735316435022007519
Running compilation step : cd /tmp/ltsmin17735316435022007519;'/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 1505 ms.
Running link step : cd /tmp/ltsmin17735316435022007519;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17735316435022007519;'/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/stateBased8643310247794788709.hoa' '--buchi-type=spotba'
LTSmin run took 4138 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-8-LTLFireability-10 finished in 89647 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)))'
Support contains 24 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 3 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-05-24 16:48:18] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
// Phase 1: matrix 387 rows 266 cols
[2024-05-24 16:48:18] [INFO ] Computed 82 invariants in 1 ms
[2024-05-24 16:48:18] [INFO ] Implicit Places using invariants in 196 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 197 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/266 places, 542/542 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 203 ms. Remains : 258/266 places, 542/542 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, p0, p0]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-11
Entered a terminal (fully accepting) state of product in 46 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-8-LTLFireability-11 finished in 291 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 72 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 7 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-05-24 16:48:18] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
[2024-05-24 16:48:18] [INFO ] Invariant cache hit.
[2024-05-24 16:48:18] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-24 16:48:18] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
[2024-05-24 16:48:18] [INFO ] Invariant cache hit.
[2024-05-24 16:48:18] [INFO ] State equation strengthened by 107 read => feed constraints.
[2024-05-24 16:48:19] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
[2024-05-24 16:48:19] [INFO ] Redundant transitions in 3 ms returned []
Running 534 sub problems to find dead transitions.
[2024-05-24 16:48:19] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
[2024-05-24 16:48:19] [INFO ] Invariant cache hit.
[2024-05-24 16:48:19] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (OVERLAPS) 8/266 variables, 72/82 constraints. Problems are: Problem set: 0 solved, 534 unsolved
[2024-05-24 16:48:24] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2024-05-24 16:48:24] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 2 ms to minimize.
[2024-05-24 16:48:24] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 2 ms to minimize.
[2024-05-24 16:48:24] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 1 ms to minimize.
[2024-05-24 16:48:24] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2024-05-24 16:48:24] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
[2024-05-24 16:48:24] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2024-05-24 16:48:25] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 1 ms to minimize.
[2024-05-24 16:48:25] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-05-24 16:48:25] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
[2024-05-24 16:48:25] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 1 ms to minimize.
[2024-05-24 16:48:25] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 2 ms to minimize.
[2024-05-24 16:48:25] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:48:25] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-05-24 16:48:25] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2024-05-24 16:48:25] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-05-24 16:48:26] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:48:26] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
[2024-05-24 16:48:26] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-24 16:48:26] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 534 unsolved
[2024-05-24 16:48:28] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-05-24 16:48:28] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:48:28] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 1 ms to minimize.
[2024-05-24 16:48:29] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2024-05-24 16:48:29] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 1 ms to minimize.
[2024-05-24 16:48:29] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:48:29] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 1 ms to minimize.
[2024-05-24 16:48:29] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-24 16:48:29] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2024-05-24 16:48:29] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 2 ms to minimize.
[2024-05-24 16:48:29] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2024-05-24 16:48:29] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 2 ms to minimize.
[2024-05-24 16:48:29] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-24 16:48:30] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:48:30] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:48:30] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:48:30] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
[2024-05-24 16:48:30] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:48:30] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2024-05-24 16:48:30] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 534 unsolved
[2024-05-24 16:48:30] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:48:30] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:48:30] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:48:31] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 2 ms to minimize.
[2024-05-24 16:48:31] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:48:31] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
[2024-05-24 16:48:31] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-24 16:48:31] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2024-05-24 16:48:31] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-05-24 16:48:31] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 2 ms to minimize.
[2024-05-24 16:48:31] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:48:31] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2024-05-24 16:48:32] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 2 ms to minimize.
[2024-05-24 16:48:32] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-24 16:48:32] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:48:32] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 3 ms to minimize.
[2024-05-24 16:48:32] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:48:32] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:48:32] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:48:32] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 1 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD220 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 20/142 constraints. Problems are: Problem set: 2 solved, 532 unsolved
[2024-05-24 16:48:32] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-24 16:48:33] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 1 ms to minimize.
[2024-05-24 16:48:33] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2024-05-24 16:48:33] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 2 ms to minimize.
[2024-05-24 16:48:33] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 2 ms to minimize.
[2024-05-24 16:48:33] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:48:33] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:48:33] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 1 ms to minimize.
[2024-05-24 16:48:33] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:48:33] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-05-24 16:48:34] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 1 ms to minimize.
[2024-05-24 16:48:34] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:48:34] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 1 ms to minimize.
[2024-05-24 16:48:34] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 2 ms to minimize.
[2024-05-24 16:48:34] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 1 ms to minimize.
[2024-05-24 16:48:34] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:48:34] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-05-24 16:48:34] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 1 ms to minimize.
[2024-05-24 16:48:35] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-05-24 16:48:35] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 20/162 constraints. Problems are: Problem set: 2 solved, 532 unsolved
[2024-05-24 16:48:37] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 2 ms to minimize.
[2024-05-24 16:48:37] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:48:37] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 2 ms to minimize.
[2024-05-24 16:48:37] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2024-05-24 16:48:38] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 2 ms to minimize.
[2024-05-24 16:48:38] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 1 ms to minimize.
[2024-05-24 16:48:38] [INFO ] Deduced a trap composed of 45 places in 179 ms of which 3 ms to minimize.
[2024-05-24 16:48:38] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 2 ms to minimize.
[2024-05-24 16:48:38] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-05-24 16:48:39] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-05-24 16:48:39] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2024-05-24 16:48:39] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 1 ms to minimize.
[2024-05-24 16:48:39] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 1 ms to minimize.
[2024-05-24 16:48:39] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:48:39] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 2 ms to minimize.
[2024-05-24 16:48:39] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2024-05-24 16:48:39] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 1 ms to minimize.
[2024-05-24 16:48:40] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:48:40] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:48:40] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 20/182 constraints. Problems are: Problem set: 2 solved, 532 unsolved
[2024-05-24 16:48:40] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 1 ms to minimize.
[2024-05-24 16:48:40] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
[2024-05-24 16:48:41] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
[2024-05-24 16:48:41] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 1 ms to minimize.
[2024-05-24 16:48:41] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 1 ms to minimize.
[2024-05-24 16:48:41] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 2 ms to minimize.
[2024-05-24 16:48:41] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 1 ms to minimize.
[2024-05-24 16:48:41] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-05-24 16:48:41] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 1 ms to minimize.
[2024-05-24 16:48:41] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-05-24 16:48:41] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:48:42] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 1 ms to minimize.
[2024-05-24 16:48:42] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:48:42] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-24 16:48:42] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-24 16:48:42] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 2 ms to minimize.
[2024-05-24 16:48:42] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
[2024-05-24 16:48:42] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:48:42] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 2 ms to minimize.
[2024-05-24 16:48:42] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 20/202 constraints. Problems are: Problem set: 2 solved, 532 unsolved
[2024-05-24 16:48:43] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:48:43] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:48:43] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:48:43] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:48:43] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 1 ms to minimize.
[2024-05-24 16:48:44] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:48:44] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 1 ms to minimize.
[2024-05-24 16:48:44] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 1 ms to minimize.
[2024-05-24 16:48:44] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2024-05-24 16:48:44] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:48:44] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
[2024-05-24 16:48:44] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 1 ms to minimize.
[2024-05-24 16:48:44] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:48:44] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 2 ms to minimize.
[2024-05-24 16:48:45] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 2 ms to minimize.
[2024-05-24 16:48:45] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 2 ms to minimize.
[2024-05-24 16:48:45] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 2 ms to minimize.
[2024-05-24 16:48:45] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:48:45] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 1 ms to minimize.
[2024-05-24 16:48:45] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 20/222 constraints. Problems are: Problem set: 2 solved, 532 unsolved
[2024-05-24 16:48:48] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-24 16:48:48] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
[2024-05-24 16:48:48] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:48:48] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:48:49] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:48:49] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:48:49] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 1 ms to minimize.
[2024-05-24 16:48:49] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
SMT process timed out in 30320ms, After SMT, problems are : Problem set: 2 solved, 532 unsolved
Search for dead transitions found 2 dead transitions in 30326ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 266/266 places, 540/542 transitions.
Applied a total of 0 rules in 8 ms. Remains 266 /266 variables (removed 0) and now considering 540/540 (removed 0) transitions.
[2024-05-24 16:48:49] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 31117 ms. Remains : 266/266 places, 540/542 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-13
Product exploration explored 100000 steps with 1848 reset in 256 ms.
Product exploration explored 100000 steps with 1857 reset in 284 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 244 steps (0 resets) in 6 ms. (34 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
[2024-05-24 16:48:50] [INFO ] Flow matrix only has 386 transitions (discarded 154 similar events)
// Phase 1: matrix 386 rows 266 cols
[2024-05-24 16:48:50] [INFO ] Computed 82 invariants in 3 ms
[2024-05-24 16:48:50] [INFO ] [Real]Absence check using 82 positive place invariants in 32 ms returned sat
[2024-05-24 16:48:50] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2024-05-24 16:48:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:48:51] [INFO ] [Nat]Absence check using 82 positive place invariants in 27 ms returned sat
[2024-05-24 16:48:51] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2024-05-24 16:48:51] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-24 16:48:51] [INFO ] [Nat]Added 106 Read/Feed constraints in 21 ms returned sat
[2024-05-24 16:48:51] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:48:51] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:48:51] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 1 ms to minimize.
[2024-05-24 16:48:51] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:48:52] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:48:52] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:48:52] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:48:52] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:48:52] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:48:52] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-05-24 16:48:52] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:48:52] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:48:52] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:48:53] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:48:53] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:48:53] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:48:53] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:48:53] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:48:53] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:48:53] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:48:53] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 14 ms to minimize.
[2024-05-24 16:48:53] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:48:54] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:48:54] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:48:54] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2600 ms
[2024-05-24 16:48:54] [INFO ] Computed and/alt/rep : 274/1602/274 causal constraints (skipped 104 transitions) in 26 ms.
[2024-05-24 16:48:55] [INFO ] Added : 238 causal constraints over 48 iterations in 1832 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 72 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 540/540 transitions.
Applied a total of 0 rules in 10 ms. Remains 266 /266 variables (removed 0) and now considering 540/540 (removed 0) transitions.
[2024-05-24 16:48:55] [INFO ] Flow matrix only has 386 transitions (discarded 154 similar events)
[2024-05-24 16:48:55] [INFO ] Invariant cache hit.
[2024-05-24 16:48:56] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-24 16:48:56] [INFO ] Flow matrix only has 386 transitions (discarded 154 similar events)
[2024-05-24 16:48:56] [INFO ] Invariant cache hit.
[2024-05-24 16:48:56] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-24 16:48:56] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2024-05-24 16:48:56] [INFO ] Redundant transitions in 5 ms returned []
Running 532 sub problems to find dead transitions.
[2024-05-24 16:48:56] [INFO ] Flow matrix only has 386 transitions (discarded 154 similar events)
[2024-05-24 16:48:56] [INFO ] Invariant cache hit.
[2024-05-24 16:48:56] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 2 (OVERLAPS) 8/266 variables, 72/82 constraints. Problems are: Problem set: 0 solved, 532 unsolved
[2024-05-24 16:49:01] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2024-05-24 16:49:01] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-05-24 16:49:01] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-05-24 16:49:01] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
[2024-05-24 16:49:01] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-24 16:49:02] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 2 ms to minimize.
[2024-05-24 16:49:02] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-05-24 16:49:02] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-05-24 16:49:02] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:49:02] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:49:02] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-24 16:49:02] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-24 16:49:02] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:49:02] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:49:02] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:49:03] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:49:03] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:49:03] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:49:03] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:49:03] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 532 unsolved
[2024-05-24 16:49:05] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-05-24 16:49:05] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:49:05] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:49:06] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:49:06] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:49:06] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:49:06] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-24 16:49:06] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 1 ms to minimize.
[2024-05-24 16:49:06] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:49:06] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-05-24 16:49:06] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:49:06] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2024-05-24 16:49:07] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:49:07] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:49:07] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:49:07] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:49:07] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:49:07] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:49:07] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:49:07] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 532 unsolved
[2024-05-24 16:49:07] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-24 16:49:07] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-24 16:49:07] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-24 16:49:08] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:49:08] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-05-24 16:49:08] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:49:08] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:49:08] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:49:08] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2024-05-24 16:49:08] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2024-05-24 16:49:08] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:49:08] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:49:08] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:49:09] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:49:09] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:49:09] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-05-24 16:49:09] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:49:09] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:49:09] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:49:09] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 532 unsolved
[2024-05-24 16:49:09] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:49:09] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-24 16:49:10] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2024-05-24 16:49:10] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:49:10] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:49:10] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
[2024-05-24 16:49:10] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 1 ms to minimize.
[2024-05-24 16:49:10] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 2 ms to minimize.
[2024-05-24 16:49:10] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 2 ms to minimize.
[2024-05-24 16:49:11] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-05-24 16:49:11] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-24 16:49:11] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2024-05-24 16:49:11] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2024-05-24 16:49:11] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 2 ms to minimize.
[2024-05-24 16:49:11] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:49:11] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 1 ms to minimize.
[2024-05-24 16:49:11] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:49:12] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:49:12] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:49:12] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 1 ms to minimize.
Problem TDEAD121 is UNSAT
Problem TDEAD209 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 20/162 constraints. Problems are: Problem set: 2 solved, 530 unsolved
[2024-05-24 16:49:14] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 2 ms to minimize.
[2024-05-24 16:49:14] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-05-24 16:49:14] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:49:15] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 1 ms to minimize.
[2024-05-24 16:49:15] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2024-05-24 16:49:15] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:49:15] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2024-05-24 16:49:15] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:49:15] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2024-05-24 16:49:15] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 1 ms to minimize.
[2024-05-24 16:49:15] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:49:15] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:49:16] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 1 ms to minimize.
[2024-05-24 16:49:16] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-24 16:49:16] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:49:16] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:49:16] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 1 ms to minimize.
[2024-05-24 16:49:16] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 2 ms to minimize.
[2024-05-24 16:49:16] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:49:16] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 20/182 constraints. Problems are: Problem set: 2 solved, 530 unsolved
[2024-05-24 16:49:17] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:49:17] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:49:17] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 1 ms to minimize.
[2024-05-24 16:49:17] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 1 ms to minimize.
[2024-05-24 16:49:17] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:49:17] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:49:17] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2024-05-24 16:49:17] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 1 ms to minimize.
[2024-05-24 16:49:18] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:49:18] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 1 ms to minimize.
[2024-05-24 16:49:18] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-05-24 16:49:18] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-24 16:49:18] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:49:18] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:49:18] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 1 ms to minimize.
[2024-05-24 16:49:18] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 2 ms to minimize.
[2024-05-24 16:49:18] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 1 ms to minimize.
[2024-05-24 16:49:19] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:49:19] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:49:19] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 20/202 constraints. Problems are: Problem set: 2 solved, 530 unsolved
[2024-05-24 16:49:19] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:49:19] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:49:19] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-24 16:49:19] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
[2024-05-24 16:49:20] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2024-05-24 16:49:20] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-05-24 16:49:20] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:49:20] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:49:20] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:49:20] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:49:20] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:49:20] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:49:20] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:49:20] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:49:21] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:49:21] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:49:21] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:49:21] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:49:21] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:49:21] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 20/222 constraints. Problems are: Problem set: 2 solved, 530 unsolved
[2024-05-24 16:49:24] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 1 ms to minimize.
[2024-05-24 16:49:24] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 2 ms to minimize.
[2024-05-24 16:49:24] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 1 ms to minimize.
[2024-05-24 16:49:24] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-24 16:49:24] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-05-24 16:49:24] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2024-05-24 16:49:24] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-05-24 16:49:25] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:49:25] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-05-24 16:49:25] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:49:25] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:49:25] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 1 ms to minimize.
[2024-05-24 16:49:25] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 1 ms to minimize.
[2024-05-24 16:49:26] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 2 ms to minimize.
[2024-05-24 16:49:26] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:49:26] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 1 ms to minimize.
[2024-05-24 16:49:26] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 4 ms to minimize.
[2024-05-24 16:49:26] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 1 ms to minimize.
[2024-05-24 16:49:26] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 1 ms to minimize.
[2024-05-24 16:49:26] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 2 ms to minimize.
SMT process timed out in 30319ms, After SMT, problems are : Problem set: 2 solved, 530 unsolved
Search for dead transitions found 2 dead transitions in 30331ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 266/266 places, 538/540 transitions.
Applied a total of 0 rules in 12 ms. Remains 266 /266 variables (removed 0) and now considering 538/538 (removed 0) transitions.
[2024-05-24 16:49:26] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 30898 ms. Remains : 266/266 places, 538/540 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 291 steps (0 resets) in 5 ms. (48 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
[2024-05-24 16:49:27] [INFO ] Flow matrix only has 385 transitions (discarded 153 similar events)
// Phase 1: matrix 385 rows 266 cols
[2024-05-24 16:49:27] [INFO ] Computed 82 invariants in 5 ms
[2024-05-24 16:49:27] [INFO ] [Real]Absence check using 82 positive place invariants in 32 ms returned sat
[2024-05-24 16:49:27] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2024-05-24 16:49:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:49:28] [INFO ] [Nat]Absence check using 82 positive place invariants in 28 ms returned sat
[2024-05-24 16:49:28] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2024-05-24 16:49:28] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-05-24 16:49:28] [INFO ] [Nat]Added 105 Read/Feed constraints in 22 ms returned sat
[2024-05-24 16:49:28] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:49:28] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:49:28] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:49:28] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:49:28] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:49:28] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:49:29] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:49:29] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:49:29] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:49:29] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:49:29] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-24 16:49:29] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-24 16:49:29] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-24 16:49:29] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-24 16:49:29] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1299 ms
[2024-05-24 16:49:29] [INFO ] Computed and/alt/rep : 273/1593/273 causal constraints (skipped 104 transitions) in 38 ms.
[2024-05-24 16:49:31] [INFO ] Added : 233 causal constraints over 48 iterations in 1630 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1837 reset in 255 ms.
Product exploration explored 100000 steps with 1833 reset in 275 ms.
Built C files in :
/tmp/ltsmin6493237252824195618
[2024-05-24 16:49:31] [INFO ] Computing symmetric may disable matrix : 538 transitions.
[2024-05-24 16:49:31] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 16:49:31] [INFO ] Computing symmetric may enable matrix : 538 transitions.
[2024-05-24 16:49:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 16:49:31] [INFO ] Computing Do-Not-Accords matrix : 538 transitions.
[2024-05-24 16:49:31] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 16:49:31] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6493237252824195618
Running compilation step : cd /tmp/ltsmin6493237252824195618;'/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 1391 ms.
Running link step : cd /tmp/ltsmin6493237252824195618;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6493237252824195618;'/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/stateBased9690538941543940486.hoa' '--buchi-type=spotba'
LTSmin run took 4162 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-8-LTLFireability-13 finished in 79271 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(G(!p0))))'
Support contains 17 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 4 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-05-24 16:49:37] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
// Phase 1: matrix 387 rows 266 cols
[2024-05-24 16:49:37] [INFO ] Computed 82 invariants in 1 ms
[2024-05-24 16:49:37] [INFO ] Implicit Places using invariants in 163 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 190 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/266 places, 542/542 transitions.
Applied a total of 0 rules in 1 ms. Remains 258 /258 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 195 ms. Remains : 258/266 places, 542/542 transitions.
Stuttering acceptance computed with spot in 69 ms :[true, p0, true]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-14
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-8-LTLFireability-14 finished in 279 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 8 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 6 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-05-24 16:49:37] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
[2024-05-24 16:49:37] [INFO ] Invariant cache hit.
[2024-05-24 16:49:38] [INFO ] Implicit Places using invariants in 298 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 307 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/266 places, 542/542 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 258 transition count 534
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 250 transition count 534
Applied a total of 16 rules in 8 ms. Remains 250 /258 variables (removed 8) and now considering 534/542 (removed 8) transitions.
[2024-05-24 16:49:38] [INFO ] Flow matrix only has 379 transitions (discarded 155 similar events)
// Phase 1: matrix 379 rows 250 cols
[2024-05-24 16:49:38] [INFO ] Computed 74 invariants in 3 ms
[2024-05-24 16:49:38] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-24 16:49:38] [INFO ] Flow matrix only has 379 transitions (discarded 155 similar events)
[2024-05-24 16:49:38] [INFO ] Invariant cache hit.
[2024-05-24 16:49:38] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 16:49:38] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 250/266 places, 534/542 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 920 ms. Remains : 250/266 places, 534/542 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 247 ms.
Stack based approach found an accepted trace after 338 steps with 0 reset with depth 339 and stack size 339 in 1 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-8-LTLFireability-15 finished in 1213 ms.
All properties solved by simple procedures.
Total runtime 422813 ms.
BK_STOP 1716569379152
--------------------
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="LamportFastMutEx-COL-8"
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 LamportFastMutEx-COL-8, 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 r224-tall-171649612400252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-8.tgz
mv LamportFastMutEx-COL-8 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 ;