About the Execution of ITS-Tools for CANInsertWithFailure-PT-020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12945.123 | 3600000.00 | 6465242.00 | 6948.90 | FF?T?FFFF?F?FTFT | 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.r070-tall-171620505200107.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 CANInsertWithFailure-PT-020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505200107
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.6M 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 CANInsertWithFailure-PT-020-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716238638190
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-20 20:57:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 20:57:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 20:57:19] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2024-05-20 20:57:19] [INFO ] Transformed 1044 places.
[2024-05-20 20:57:19] [INFO ] Transformed 2520 transitions.
[2024-05-20 20:57:19] [INFO ] Parsed PT model containing 1044 places and 2520 transitions and 6800 arcs in 291 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 1044 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1044/1044 places, 2520/2520 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1043 transition count 2520
Applied a total of 1 rules in 107 ms. Remains 1043 /1044 variables (removed 1) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2024-05-20 20:57:20] [INFO ] Computed 22 invariants in 79 ms
[2024-05-20 20:57:20] [INFO ] Implicit Places using invariants in 577 ms returned []
[2024-05-20 20:57:20] [INFO ] Invariant cache hit.
[2024-05-20 20:57:21] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 20:57:23] [INFO ] Implicit Places using invariants and state equation in 3372 ms returned []
Implicit Place search using SMT with State Equation took 3976 ms to find 0 implicit places.
Running 2500 sub problems to find dead transitions.
[2024-05-20 20:57:24] [INFO ] Invariant cache hit.
[2024-05-20 20:57:24] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
SMT process timed out in 31064ms, After SMT, problems are : Problem set: 0 solved, 2500 unsolved
Search for dead transitions found 0 dead transitions in 31102ms
Starting structural reductions in LTL mode, iteration 1 : 1043/1044 places, 2520/2520 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35226 ms. Remains : 1043/1044 places, 2520/2520 transitions.
Support contains 35 out of 1043 places after structural reductions.
[2024-05-20 20:57:55] [INFO ] Flatten gal took : 144 ms
[2024-05-20 20:57:55] [INFO ] Flatten gal took : 91 ms
[2024-05-20 20:57:55] [INFO ] Input system was already deterministic with 2520 transitions.
Support contains 34 out of 1043 places (down from 35) after GAL structural reductions.
RANDOM walk for 40000 steps (82 resets) in 2231 ms. (17 steps per ms) remains 10/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 9/9 properties
[2024-05-20 20:57:56] [INFO ] Invariant cache hit.
[2024-05-20 20:57:56] [INFO ] State equation strengthened by 780 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 992/1005 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1005 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 34/1039 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1039 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/1041 variables, 2/22 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1041 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 2520/3561 variables, 1041/1063 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3561 variables, 780/1843 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3561 variables, 0/1843 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 2/3563 variables, 2/1845 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3563 variables, 0/1845 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/3563 variables, 0/1845 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3563/3563 variables, and 1845 constraints, problems are : Problem set: 1 solved, 8 unsolved in 3002 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1043/1043 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 992/1005 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-20 20:58:00] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 16 ms to minimize.
[2024-05-20 20:58:00] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-05-20 20:58:00] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 2 ms to minimize.
[2024-05-20 20:58:00] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:58:00] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:58:00] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:58:00] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:58:00] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:58:00] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:58:00] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:58:00] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-05-20 20:58:00] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:58:00] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:58:01] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:58:01] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:58:01] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:58:01] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:58:01] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1005 variables, 18/21 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1005 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 34/1039 variables, 17/38 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1039 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/1041 variables, 2/40 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-20 20:58:02] [INFO ] Deduced a trap composed of 46 places in 350 ms of which 5 ms to minimize.
[2024-05-20 20:58:02] [INFO ] Deduced a trap composed of 43 places in 343 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1041 variables, 2/42 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1041 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 2520/3561 variables, 1041/1083 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3561 variables, 780/1863 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3561 variables, 8/1871 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3561/3563 variables, and 1871 constraints, problems are : Problem set: 1 solved, 8 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1041/1043 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 20/20 constraints]
After SMT, in 8072ms problems are : Problem set: 1 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 1043 transition count 2386
Reduce places removed 134 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 135 rules applied. Total rules applied 269 place count 909 transition count 2385
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 270 place count 908 transition count 2385
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 1 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 3 with 710 rules applied. Total rules applied 980 place count 553 transition count 2030
Drop transitions (Redundant composition of simpler transitions.) removed 321 transitions
Redundant transition composition rules discarded 321 transitions
Iterating global reduction 3 with 321 rules applied. Total rules applied 1301 place count 553 transition count 1709
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 1304 place count 553 transition count 1706
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1307 place count 550 transition count 1706
Partial Free-agglomeration rule applied 471 times.
Drop transitions (Partial Free agglomeration) removed 471 transitions
Iterating global reduction 4 with 471 rules applied. Total rules applied 1778 place count 550 transition count 1706
Applied a total of 1778 rules in 381 ms. Remains 550 /1043 variables (removed 493) and now considering 1706/2520 (removed 814) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 381 ms. Remains : 550/1043 places, 1706/2520 transitions.
RANDOM walk for 40000 steps (388 resets) in 497 ms. (80 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (14 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (17 resets) in 84 ms. (470 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (16 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (16 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (17 resets) in 103 ms. (384 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (17 resets) in 97 ms. (408 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (15 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (17 resets) in 95 ms. (416 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 336409 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 8
Probabilistic random walk after 336409 steps, saw 48490 distinct states, run finished after 3004 ms. (steps per millisecond=111 ) properties seen :0
// Phase 1: matrix 1706 rows 550 cols
[2024-05-20 20:58:08] [INFO ] Computed 22 invariants in 28 ms
[2024-05-20 20:58:08] [INFO ] State equation strengthened by 1581 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 501/514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 32/546 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/548 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1706/2254 variables, 548/570 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2254 variables, 1581/2151 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2254 variables, 0/2151 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 2/2256 variables, 2/2153 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2256 variables, 0/2153 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/2256 variables, 0/2153 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2256/2256 variables, and 2153 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1780 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 550/550 constraints, ReadFeed: 1581/1581 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 501/514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-20 20:58:10] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 32/546 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/548 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-20 20:58:11] [INFO ] Deduced a trap composed of 30 places in 194 ms of which 3 ms to minimize.
[2024-05-20 20:58:11] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1706/2254 variables, 548/573 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2254 variables, 1581/2154 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2254 variables, 8/2162 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2254 variables, 0/2162 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 2/2256 variables, 2/2164 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2256 variables, 0/2164 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/2256 variables, 0/2164 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2256/2256 variables, and 2164 constraints, problems are : Problem set: 0 solved, 8 unsolved in 10160 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 550/550 constraints, ReadFeed: 1581/1581 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 12001ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 1 properties in 1884 ms.
Support contains 9 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 1706/1706 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 548 transition count 1704
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 548 transition count 1704
Applied a total of 7 rules in 92 ms. Remains 548 /550 variables (removed 2) and now considering 1704/1706 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 548/550 places, 1704/1706 transitions.
RANDOM walk for 40000 steps (387 resets) in 461 ms. (86 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (15 resets) in 85 ms. (465 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (17 resets) in 68 ms. (579 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (17 resets) in 76 ms. (519 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (17 resets) in 65 ms. (606 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (16 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (17 resets) in 61 ms. (645 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (16 resets) in 63 ms. (625 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 371823 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 7
Probabilistic random walk after 371823 steps, saw 52563 distinct states, run finished after 3004 ms. (steps per millisecond=123 ) properties seen :0
// Phase 1: matrix 1704 rows 548 cols
[2024-05-20 20:58:26] [INFO ] Computed 22 invariants in 36 ms
[2024-05-20 20:58:26] [INFO ] State equation strengthened by 1588 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 503/512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-20 20:58:26] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 32/544 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/546 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-20 20:58:26] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 2 ms to minimize.
[2024-05-20 20:58:26] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 2 ms to minimize.
[2024-05-20 20:58:27] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 2 ms to minimize.
[2024-05-20 20:58:27] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 2 ms to minimize.
[2024-05-20 20:58:27] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 3 ms to minimize.
[2024-05-20 20:58:27] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 2 ms to minimize.
[2024-05-20 20:58:27] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 2 ms to minimize.
[2024-05-20 20:58:27] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 2 ms to minimize.
[2024-05-20 20:58:28] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 2 ms to minimize.
[2024-05-20 20:58:28] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 2 ms to minimize.
[2024-05-20 20:58:28] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 4 ms to minimize.
[2024-05-20 20:58:28] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
[2024-05-20 20:58:28] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 1 ms to minimize.
[2024-05-20 20:58:28] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 1 ms to minimize.
[2024-05-20 20:58:28] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 1 ms to minimize.
[2024-05-20 20:58:28] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-05-20 20:58:28] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-20 20:58:29] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 2 ms to minimize.
[2024-05-20 20:58:29] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-20 20:58:29] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-20 20:58:29] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-20 20:58:29] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2024-05-20 20:58:29] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2024-05-20 20:58:29] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 2 ms to minimize.
[2024-05-20 20:58:29] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2024-05-20 20:58:29] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-05-20 20:58:29] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-05-20 20:58:30] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-05-20 20:58:30] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:58:30] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-05-20 20:58:30] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-20 20:58:30] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
[2024-05-20 20:58:30] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 3 ms to minimize.
[2024-05-20 20:58:30] [INFO ] Deduced a trap composed of 30 places in 240 ms of which 3 ms to minimize.
[2024-05-20 20:58:30] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:58:31] [INFO ] Deduced a trap composed of 26 places in 201 ms of which 3 ms to minimize.
[2024-05-20 20:58:31] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 2 ms to minimize.
[2024-05-20 20:58:31] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 18/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1704/2250 variables, 546/607 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2250 variables, 1588/2195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2250 variables, 0/2195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 2/2252 variables, 2/2197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2252 variables, 0/2197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/2252 variables, 0/2197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2252/2252 variables, and 2197 constraints, problems are : Problem set: 0 solved, 7 unsolved in 6656 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 548/548 constraints, ReadFeed: 1588/1588 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 503/512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 32/544 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/546 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 37/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1704/2250 variables, 546/607 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2250 variables, 1588/2195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2250 variables, 7/2202 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2250 variables, 0/2202 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 2/2252 variables, 2/2204 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2252 variables, 0/2204 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/2252 variables, 0/2204 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2252/2252 variables, and 2204 constraints, problems are : Problem set: 0 solved, 7 unsolved in 9499 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 548/548 constraints, ReadFeed: 1588/1588 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 39/39 constraints]
After SMT, in 16224ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 879 ms.
Support contains 9 out of 548 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 548/548 places, 1704/1704 transitions.
Applied a total of 0 rules in 23 ms. Remains 548 /548 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 548/548 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 548/548 places, 1704/1704 transitions.
Applied a total of 0 rules in 22 ms. Remains 548 /548 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2024-05-20 20:58:43] [INFO ] Invariant cache hit.
[2024-05-20 20:58:43] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-05-20 20:58:43] [INFO ] Invariant cache hit.
[2024-05-20 20:58:44] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2024-05-20 20:58:48] [INFO ] Implicit Places using invariants and state equation in 4536 ms returned []
Implicit Place search using SMT with State Equation took 4936 ms to find 0 implicit places.
[2024-05-20 20:58:48] [INFO ] Redundant transitions in 127 ms returned []
Running 1684 sub problems to find dead transitions.
[2024-05-20 20:58:48] [INFO ] Invariant cache hit.
[2024-05-20 20:58:48] [INFO ] State equation strengthened by 1588 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/547 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1684 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/547 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1684 unsolved
[2024-05-20 20:59:03] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 3 ms to minimize.
[2024-05-20 20:59:03] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:59:03] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2024-05-20 20:59:03] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-20 20:59:03] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-20 20:59:03] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-20 20:59:03] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-05-20 20:59:03] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-05-20 20:59:03] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:59:04] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:59:04] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:59:04] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-20 20:59:04] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:59:04] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:59:04] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-05-20 20:59:04] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:59:04] [INFO ] Deduced a trap composed of 2 places in 193 ms of which 3 ms to minimize.
[2024-05-20 20:59:04] [INFO ] Deduced a trap composed of 2 places in 211 ms of which 3 ms to minimize.
[2024-05-20 20:59:05] [INFO ] Deduced a trap composed of 26 places in 212 ms of which 3 ms to minimize.
[2024-05-20 20:59:05] [INFO ] Deduced a trap composed of 22 places in 213 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1684 unsolved
[2024-05-20 20:59:05] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2024-05-20 20:59:06] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 1 ms to minimize.
[2024-05-20 20:59:06] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 2 ms to minimize.
[2024-05-20 20:59:06] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 3 ms to minimize.
[2024-05-20 20:59:06] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 2 ms to minimize.
[2024-05-20 20:59:06] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 2 ms to minimize.
[2024-05-20 20:59:06] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 2 ms to minimize.
[2024-05-20 20:59:06] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 2 ms to minimize.
[2024-05-20 20:59:07] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 2 ms to minimize.
[2024-05-20 20:59:07] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 2 ms to minimize.
[2024-05-20 20:59:07] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 2 ms to minimize.
[2024-05-20 20:59:07] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 2 ms to minimize.
[2024-05-20 20:59:07] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 1 ms to minimize.
[2024-05-20 20:59:07] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 2 ms to minimize.
[2024-05-20 20:59:07] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 1 ms to minimize.
[2024-05-20 20:59:08] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2024-05-20 20:59:08] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
[2024-05-20 20:59:08] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 2 ms to minimize.
[2024-05-20 20:59:08] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-05-20 20:59:08] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1684 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 547/2252 variables, and 62 constraints, problems are : Problem set: 0 solved, 1684 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/548 constraints, ReadFeed: 0/1588 constraints, PredecessorRefiner: 1684/1684 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1684 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/547 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1684 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/547 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1684 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1684 unsolved
[2024-05-20 20:59:20] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-20 20:59:20] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:59:20] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 3 ms to minimize.
[2024-05-20 20:59:21] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 3 ms to minimize.
[2024-05-20 20:59:21] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 2 ms to minimize.
[2024-05-20 20:59:21] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-20 20:59:21] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 2 ms to minimize.
[2024-05-20 20:59:21] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-20 20:59:21] [INFO ] Deduced a trap composed of 2 places in 124 ms of which 2 ms to minimize.
[2024-05-20 20:59:21] [INFO ] Deduced a trap composed of 2 places in 138 ms of which 3 ms to minimize.
[2024-05-20 20:59:22] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 3 ms to minimize.
[2024-05-20 20:59:22] [INFO ] Deduced a trap composed of 2 places in 164 ms of which 3 ms to minimize.
[2024-05-20 20:59:22] [INFO ] Deduced a trap composed of 2 places in 171 ms of which 3 ms to minimize.
[2024-05-20 20:59:22] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 3 ms to minimize.
[2024-05-20 20:59:22] [INFO ] Deduced a trap composed of 2 places in 200 ms of which 3 ms to minimize.
[2024-05-20 20:59:23] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 3 ms to minimize.
[2024-05-20 20:59:23] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 2 ms to minimize.
[2024-05-20 20:59:23] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 2 ms to minimize.
[2024-05-20 20:59:23] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 2 ms to minimize.
[2024-05-20 20:59:23] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1684 unsolved
[2024-05-20 20:59:24] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
[2024-05-20 20:59:24] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-05-20 20:59:24] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2024-05-20 20:59:24] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-20 20:59:24] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-20 20:59:24] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-05-20 20:59:24] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-20 20:59:24] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-20 20:59:24] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:59:25] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:59:25] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-20 20:59:25] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:59:25] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:59:25] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:59:25] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:59:25] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:59:25] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 3 ms to minimize.
[2024-05-20 20:59:28] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 3 ms to minimize.
[2024-05-20 20:59:29] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 3 ms to minimize.
[2024-05-20 20:59:31] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/547 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1684 unsolved
[2024-05-20 20:59:32] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-20 20:59:32] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-05-20 20:59:32] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-20 20:59:32] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-20 20:59:32] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-05-20 20:59:32] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2024-05-20 20:59:32] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-20 20:59:32] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-20 20:59:32] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-20 20:59:33] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-20 20:59:33] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-20 20:59:33] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-20 20:59:33] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-20 20:59:33] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-05-20 20:59:33] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-20 20:59:33] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-20 20:59:33] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:59:33] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:59:33] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 0 ms to minimize.
[2024-05-20 20:59:33] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1684 unsolved
[2024-05-20 20:59:34] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-20 20:59:34] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-05-20 20:59:34] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-05-20 20:59:34] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-05-20 20:59:34] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-20 20:59:34] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
[2024-05-20 20:59:34] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 2 ms to minimize.
[2024-05-20 20:59:35] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-20 20:59:35] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-20 20:59:35] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:59:35] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:59:35] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-20 20:59:35] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 2 ms to minimize.
[2024-05-20 20:59:35] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-20 20:59:35] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-20 20:59:35] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:59:35] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:59:35] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:59:35] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 3 ms to minimize.
[2024-05-20 20:59:36] [INFO ] Deduced a trap composed of 31 places in 208 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1684 unsolved
[2024-05-20 20:59:36] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2024-05-20 20:59:37] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-05-20 20:59:37] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2024-05-20 20:59:37] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-05-20 20:59:37] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2024-05-20 20:59:37] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2024-05-20 20:59:37] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2024-05-20 20:59:37] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-20 20:59:37] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-05-20 20:59:37] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2024-05-20 20:59:37] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-05-20 20:59:37] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-20 20:59:38] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-20 20:59:38] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-05-20 20:59:38] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-20 20:59:38] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-20 20:59:38] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-05-20 20:59:38] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 547/2252 variables, and 160 constraints, problems are : Problem set: 0 solved, 1684 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/548 constraints, ReadFeed: 0/1588 constraints, PredecessorRefiner: 0/1684 constraints, Known Traps: 138/138 constraints]
After SMT, in 60747ms problems are : Problem set: 0 solved, 1684 unsolved
Search for dead transitions found 0 dead transitions in 60762ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65860 ms. Remains : 548/548 places, 1704/1704 transitions.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 82 stabilizing places and 140 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' '!(F(G(p0)))'
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Iterating post reduction 1 with 138 rules applied. Total rules applied 276 place count 905 transition count 2382
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 276 place count 905 transition count 2381
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 1 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 2 with 758 rules applied. Total rules applied 1036 place count 525 transition count 2002
Drop transitions (Redundant composition of simpler transitions.) removed 342 transitions
Redundant transition composition rules discarded 342 transitions
Iterating global reduction 2 with 342 rules applied. Total rules applied 1378 place count 525 transition count 1660
Applied a total of 1378 rules in 142 ms. Remains 525 /1043 variables (removed 518) and now considering 1660/2520 (removed 860) transitions.
// Phase 1: matrix 1660 rows 525 cols
[2024-05-20 20:59:49] [INFO ] Computed 22 invariants in 16 ms
[2024-05-20 20:59:49] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-20 20:59:49] [INFO ] Invariant cache hit.
[2024-05-20 20:59:50] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 20:59:51] [INFO ] Implicit Places using invariants and state equation in 1899 ms returned []
Implicit Place search using SMT with State Equation took 2144 ms to find 0 implicit places.
[2024-05-20 20:59:51] [INFO ] Redundant transitions in 78 ms returned []
Running 1640 sub problems to find dead transitions.
[2024-05-20 20:59:51] [INFO ] Invariant cache hit.
[2024-05-20 20:59:51] [INFO ] State equation strengthened by 1177 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/524 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/524 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-20 21:00:05] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:00:05] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:00:05] [INFO ] Deduced a trap composed of 2 places in 182 ms of which 3 ms to minimize.
[2024-05-20 21:00:05] [INFO ] Deduced a trap composed of 2 places in 182 ms of which 3 ms to minimize.
[2024-05-20 21:00:05] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 2 ms to minimize.
[2024-05-20 21:00:05] [INFO ] Deduced a trap composed of 2 places in 191 ms of which 3 ms to minimize.
[2024-05-20 21:00:05] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:00:06] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:00:06] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-05-20 21:00:06] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:00:06] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:00:06] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:00:06] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-05-20 21:00:06] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:00:06] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:00:06] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:00:06] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:00:06] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 1 ms to minimize.
[2024-05-20 21:00:07] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-20 21:00:07] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/524 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-20 21:00:07] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:00:07] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:00:08] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-05-20 21:00:08] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:00:08] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-05-20 21:00:08] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
[2024-05-20 21:00:08] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:00:08] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:00:08] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:00:08] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:00:08] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-05-20 21:00:08] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 2 ms to minimize.
[2024-05-20 21:00:08] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:00:08] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:00:09] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 3 ms to minimize.
[2024-05-20 21:00:09] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 3 ms to minimize.
[2024-05-20 21:00:09] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 2 ms to minimize.
[2024-05-20 21:00:09] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 3 ms to minimize.
[2024-05-20 21:00:09] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 2 ms to minimize.
[2024-05-20 21:00:10] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/524 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 524/2185 variables, and 62 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/525 constraints, ReadFeed: 0/1177 constraints, PredecessorRefiner: 1640/1640 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1640 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/524 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/524 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/524 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-20 21:00:23] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 2 ms to minimize.
[2024-05-20 21:00:23] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 1 ms to minimize.
[2024-05-20 21:00:23] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 1 ms to minimize.
[2024-05-20 21:00:24] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-05-20 21:00:24] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 1 ms to minimize.
[2024-05-20 21:00:24] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2024-05-20 21:00:24] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
[2024-05-20 21:00:24] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-05-20 21:00:24] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 3 ms to minimize.
[2024-05-20 21:00:24] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-05-20 21:00:24] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-05-20 21:00:25] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2024-05-20 21:00:25] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-05-20 21:00:25] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-05-20 21:00:25] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-05-20 21:00:25] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 3 ms to minimize.
[2024-05-20 21:00:25] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-05-20 21:00:25] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:00:25] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:00:25] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/524 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-20 21:00:26] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2024-05-20 21:00:26] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
[2024-05-20 21:00:26] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 1 ms to minimize.
[2024-05-20 21:00:26] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:00:26] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-05-20 21:00:26] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2024-05-20 21:00:27] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 2 ms to minimize.
[2024-05-20 21:00:27] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 1 ms to minimize.
[2024-05-20 21:00:27] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:00:27] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2024-05-20 21:00:27] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-05-20 21:00:27] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2024-05-20 21:00:27] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-05-20 21:00:27] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-05-20 21:00:28] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:00:28] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:00:28] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-20 21:00:28] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:00:28] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
[2024-05-20 21:00:28] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-20 21:00:29] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:00:29] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-05-20 21:00:29] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-20 21:00:29] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 2 ms to minimize.
[2024-05-20 21:00:29] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 2 ms to minimize.
[2024-05-20 21:00:29] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 2 ms to minimize.
[2024-05-20 21:00:29] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 2 ms to minimize.
[2024-05-20 21:00:29] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:00:30] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 2 ms to minimize.
[2024-05-20 21:00:30] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 2 ms to minimize.
[2024-05-20 21:00:30] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
[2024-05-20 21:00:30] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
[2024-05-20 21:00:30] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
[2024-05-20 21:00:30] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-05-20 21:00:30] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2024-05-20 21:00:30] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:00:30] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:00:31] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:00:31] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:00:31] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-20 21:00:31] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:00:31] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:00:31] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2024-05-20 21:00:32] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:00:32] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-05-20 21:00:32] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 1 ms to minimize.
[2024-05-20 21:00:32] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:00:32] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-05-20 21:00:32] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2024-05-20 21:00:32] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:00:32] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-05-20 21:00:32] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:00:32] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-20 21:00:33] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-05-20 21:00:33] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:00:33] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 1 ms to minimize.
[2024-05-20 21:00:33] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:00:33] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
[2024-05-20 21:00:33] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2024-05-20 21:00:33] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-20 21:00:34] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-20 21:00:34] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:00:34] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
[2024-05-20 21:00:34] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 1 ms to minimize.
[2024-05-20 21:00:34] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
[2024-05-20 21:00:35] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2024-05-20 21:00:35] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 2 ms to minimize.
[2024-05-20 21:00:35] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 1 ms to minimize.
[2024-05-20 21:00:35] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2024-05-20 21:00:35] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-05-20 21:00:35] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:00:35] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:00:35] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:00:35] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:00:35] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:00:36] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:00:36] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:00:36] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2024-05-20 21:00:36] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:00:36] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-20 21:00:37] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:00:37] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2024-05-20 21:00:37] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:00:37] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:00:37] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:00:37] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:00:37] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:00:37] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-05-20 21:00:38] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:00:38] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:00:38] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:00:38] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:00:38] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 1 ms to minimize.
[2024-05-20 21:00:38] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-20 21:00:38] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:00:38] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-05-20 21:00:38] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:00:38] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
[2024-05-20 21:00:38] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:00:38] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-20 21:00:39] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:00:39] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:00:40] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:00:40] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:00:40] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:00:40] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:00:40] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-05-20 21:00:40] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:00:40] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:00:40] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:00:40] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:00:40] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:00:40] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-05-20 21:00:40] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:00:41] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:00:41] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:00:41] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:00:41] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:00:41] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-20 21:00:41] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/524 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-20 21:00:42] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2024-05-20 21:00:42] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 524/2185 variables, and 204 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/525 constraints, ReadFeed: 0/1177 constraints, PredecessorRefiner: 0/1640 constraints, Known Traps: 182/182 constraints]
After SMT, in 60564ms problems are : Problem set: 0 solved, 1640 unsolved
Search for dead transitions found 0 dead transitions in 60578ms
Starting structural reductions in SI_LTL mode, iteration 1 : 525/1043 places, 1660/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62956 ms. Remains : 525/1043 places, 1660/2520 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-01
Stuttering criterion allowed to conclude after 119 steps with 0 reset in 7 ms.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-01 finished in 63191 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 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 19 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2024-05-20 21:00:52] [INFO ] Computed 22 invariants in 36 ms
[2024-05-20 21:00:52] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-20 21:00:52] [INFO ] Invariant cache hit.
[2024-05-20 21:00:53] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 21:00:56] [INFO ] Implicit Places using invariants and state equation in 3294 ms returned []
Implicit Place search using SMT with State Equation took 3636 ms to find 0 implicit places.
Running 2500 sub problems to find dead transitions.
[2024-05-20 21:00:56] [INFO ] Invariant cache hit.
[2024-05-20 21:00:56] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
SMT process timed out in 30814ms, After SMT, problems are : Problem set: 0 solved, 2500 unsolved
Search for dead transitions found 0 dead transitions in 30837ms
Finished structural reductions in LTL mode , in 1 iterations and 34500 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, p0, p0]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-02
Product exploration explored 100000 steps with 215 reset in 415 ms.
Product exploration explored 100000 steps with 211 reset in 375 ms.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[true, p0]
RANDOM walk for 40000 steps (83 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 188141 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 1
Probabilistic random walk after 188141 steps, saw 48227 distinct states, run finished after 3002 ms. (steps per millisecond=62 ) properties seen :0
[2024-05-20 21:01:31] [INFO ] Invariant cache hit.
[2024-05-20 21:01:31] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 999/1001 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 21:01:31] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 0 ms to minimize.
[2024-05-20 21:01:31] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:01:31] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-20 21:01:31] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:01:31] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:01:31] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:01:31] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-05-20 21:01:31] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:01:31] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:01:31] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-20 21:01:31] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-20 21:01:31] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/1039 variables, 19/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1039 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1041 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 21:01:32] [INFO ] Deduced a trap composed of 5 places in 428 ms of which 5 ms to minimize.
[2024-05-20 21:01:32] [INFO ] Deduced a trap composed of 5 places in 447 ms of which 6 ms to minimize.
[2024-05-20 21:01:33] [INFO ] Deduced a trap composed of 5 places in 435 ms of which 6 ms to minimize.
[2024-05-20 21:01:33] [INFO ] Deduced a trap composed of 5 places in 451 ms of which 5 ms to minimize.
[2024-05-20 21:01:34] [INFO ] Deduced a trap composed of 5 places in 462 ms of which 6 ms to minimize.
[2024-05-20 21:01:34] [INFO ] Deduced a trap composed of 5 places in 509 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1041 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1041 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2520/3561 variables, 1041/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3561 variables, 780/1861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 100.0 833.0))
(s3 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3561/3563 variables, and 1861 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1041/1043 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 999/1001 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/1039 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1039 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1041 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 21:01:36] [INFO ] Deduced a trap composed of 47 places in 405 ms of which 6 ms to minimize.
[2024-05-20 21:01:37] [INFO ] Deduced a trap composed of 58 places in 379 ms of which 5 ms to minimize.
[2024-05-20 21:01:37] [INFO ] Deduced a trap composed of 40 places in 399 ms of which 5 ms to minimize.
[2024-05-20 21:01:38] [INFO ] Deduced a trap composed of 49 places in 347 ms of which 6 ms to minimize.
[2024-05-20 21:01:38] [INFO ] Deduced a trap composed of 58 places in 362 ms of which 5 ms to minimize.
[2024-05-20 21:01:38] [INFO ] Deduced a trap composed of 45 places in 374 ms of which 5 ms to minimize.
[2024-05-20 21:01:39] [INFO ] Deduced a trap composed of 52 places in 362 ms of which 5 ms to minimize.
[2024-05-20 21:01:39] [INFO ] Deduced a trap composed of 49 places in 349 ms of which 5 ms to minimize.
[2024-05-20 21:01:39] [INFO ] Deduced a trap composed of 49 places in 369 ms of which 5 ms to minimize.
[2024-05-20 21:01:40] [INFO ] Deduced a trap composed of 46 places in 370 ms of which 5 ms to minimize.
[2024-05-20 21:01:40] [INFO ] Deduced a trap composed of 41 places in 373 ms of which 5 ms to minimize.
[2024-05-20 21:01:41] [INFO ] Deduced a trap composed of 49 places in 346 ms of which 4 ms to minimize.
[2024-05-20 21:01:41] [INFO ] Deduced a trap composed of 43 places in 378 ms of which 5 ms to minimize.
SMT process timed out in 10330ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 277 place count 905 transition count 2381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Deduced a syphon composed of 360 places in 0 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 3 with 720 rules applied. Total rules applied 998 place count 544 transition count 2021
Drop transitions (Redundant composition of simpler transitions.) removed 324 transitions
Redundant transition composition rules discarded 324 transitions
Iterating global reduction 3 with 324 rules applied. Total rules applied 1322 place count 544 transition count 1697
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1324 place count 544 transition count 1695
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1326 place count 542 transition count 1695
Partial Free-agglomeration rule applied 459 times.
Drop transitions (Partial Free agglomeration) removed 459 transitions
Iterating global reduction 4 with 459 rules applied. Total rules applied 1785 place count 542 transition count 1695
Applied a total of 1785 rules in 155 ms. Remains 542 /1043 variables (removed 501) and now considering 1695/2520 (removed 825) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 542/1043 places, 1695/2520 transitions.
RANDOM walk for 40000 steps (388 resets) in 265 ms. (150 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (15 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 370507 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 1
Probabilistic random walk after 370507 steps, saw 52656 distinct states, run finished after 3002 ms. (steps per millisecond=123 ) properties seen :0
// Phase 1: matrix 1695 rows 542 cols
[2024-05-20 21:01:44] [INFO ] Computed 22 invariants in 21 ms
[2024-05-20 21:01:44] [INFO ] State equation strengthened by 1594 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 500/502 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 21:01:44] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-20 21:01:44] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 36/538 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/540 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 21:01:45] [INFO ] Deduced a trap composed of 27 places in 203 ms of which 3 ms to minimize.
[2024-05-20 21:01:45] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 2 ms to minimize.
[2024-05-20 21:01:45] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1695/2235 variables, 540/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2235 variables, 1594/2161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2235 variables, 0/2161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/2237 variables, 2/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2237 variables, 0/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2237 variables, 0/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2237/2237 variables, and 2163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1222 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 542/542 constraints, ReadFeed: 1594/1594 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 500/502 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 36/538 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/540 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 21:01:46] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1695/2235 variables, 540/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2235 variables, 1594/2162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2235 variables, 1/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2235 variables, 0/2163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/2237 variables, 2/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2237 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2237 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2237/2237 variables, and 2165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1161 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 542/542 constraints, ReadFeed: 1594/1594 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 2433ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 2 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 1695/1695 transitions.
Applied a total of 0 rules in 22 ms. Remains 542 /542 variables (removed 0) and now considering 1695/1695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 542/542 places, 1695/1695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 1695/1695 transitions.
Applied a total of 0 rules in 22 ms. Remains 542 /542 variables (removed 0) and now considering 1695/1695 (removed 0) transitions.
[2024-05-20 21:01:47] [INFO ] Invariant cache hit.
[2024-05-20 21:01:47] [INFO ] Implicit Places using invariants in 479 ms returned []
[2024-05-20 21:01:47] [INFO ] Invariant cache hit.
[2024-05-20 21:01:48] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2024-05-20 21:01:51] [INFO ] Implicit Places using invariants and state equation in 4136 ms returned []
Implicit Place search using SMT with State Equation took 4618 ms to find 0 implicit places.
[2024-05-20 21:01:51] [INFO ] Redundant transitions in 26 ms returned []
Running 1675 sub problems to find dead transitions.
[2024-05-20 21:01:51] [INFO ] Invariant cache hit.
[2024-05-20 21:01:51] [INFO ] State equation strengthened by 1594 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/541 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1675 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/541 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1675 unsolved
[2024-05-20 21:02:05] [INFO ] Deduced a trap composed of 28 places in 177 ms of which 3 ms to minimize.
[2024-05-20 21:02:05] [INFO ] Deduced a trap composed of 27 places in 201 ms of which 2 ms to minimize.
[2024-05-20 21:02:06] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 3 ms to minimize.
[2024-05-20 21:02:06] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 3 ms to minimize.
[2024-05-20 21:02:06] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 2 ms to minimize.
[2024-05-20 21:02:06] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 3 ms to minimize.
[2024-05-20 21:02:06] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2024-05-20 21:02:06] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 2 ms to minimize.
[2024-05-20 21:02:07] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:02:07] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2024-05-20 21:02:07] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 1 ms to minimize.
[2024-05-20 21:02:07] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-20 21:02:07] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:02:07] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2024-05-20 21:02:07] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-20 21:02:07] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2024-05-20 21:02:07] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-05-20 21:02:08] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:02:08] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2024-05-20 21:02:08] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/541 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1675 unsolved
[2024-05-20 21:02:08] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2024-05-20 21:02:08] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 2 ms to minimize.
[2024-05-20 21:02:08] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 2 ms to minimize.
[2024-05-20 21:02:09] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 2 ms to minimize.
[2024-05-20 21:02:09] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 2 ms to minimize.
[2024-05-20 21:02:09] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
[2024-05-20 21:02:09] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
[2024-05-20 21:02:09] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:02:09] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 1 ms to minimize.
[2024-05-20 21:02:09] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 2 ms to minimize.
[2024-05-20 21:02:09] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
[2024-05-20 21:02:09] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-05-20 21:02:10] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:02:10] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:02:10] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:02:10] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:02:10] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:02:10] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:02:10] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:02:10] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/541 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1675 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 541/2237 variables, and 62 constraints, problems are : Problem set: 0 solved, 1675 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/542 constraints, ReadFeed: 0/1594 constraints, PredecessorRefiner: 1675/1675 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1675 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/541 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1675 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/541 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1675 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/541 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1675 unsolved
[2024-05-20 21:02:23] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2024-05-20 21:02:24] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2024-05-20 21:02:24] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:02:24] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:02:24] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:02:24] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-05-20 21:02:24] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:02:24] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:02:24] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-05-20 21:02:24] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:02:24] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 2 ms to minimize.
[2024-05-20 21:02:25] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 2 ms to minimize.
[2024-05-20 21:02:25] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 3 ms to minimize.
[2024-05-20 21:02:25] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2024-05-20 21:02:25] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 3 ms to minimize.
[2024-05-20 21:02:25] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 2 ms to minimize.
[2024-05-20 21:02:25] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 2 ms to minimize.
[2024-05-20 21:02:25] [INFO ] Deduced a trap composed of 2 places in 111 ms of which 2 ms to minimize.
[2024-05-20 21:02:26] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
[2024-05-20 21:02:26] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/541 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1675 unsolved
[2024-05-20 21:02:26] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:02:26] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 2 ms to minimize.
[2024-05-20 21:02:26] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 2 ms to minimize.
[2024-05-20 21:02:27] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 2 ms to minimize.
[2024-05-20 21:02:27] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 2 ms to minimize.
[2024-05-20 21:02:27] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
[2024-05-20 21:02:27] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 2 ms to minimize.
[2024-05-20 21:02:27] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 3 ms to minimize.
[2024-05-20 21:02:27] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 2 ms to minimize.
[2024-05-20 21:02:27] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 2 ms to minimize.
[2024-05-20 21:02:28] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 2 ms to minimize.
[2024-05-20 21:02:28] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 2 ms to minimize.
[2024-05-20 21:02:28] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-05-20 21:02:28] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 2 ms to minimize.
[2024-05-20 21:02:28] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-05-20 21:02:28] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 1 ms to minimize.
[2024-05-20 21:02:28] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 2 ms to minimize.
[2024-05-20 21:02:28] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 3 ms to minimize.
[2024-05-20 21:02:29] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 2 ms to minimize.
[2024-05-20 21:02:29] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1675 unsolved
[2024-05-20 21:02:29] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-05-20 21:02:29] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 2 ms to minimize.
[2024-05-20 21:02:30] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-05-20 21:02:30] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:02:30] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2024-05-20 21:02:30] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 1 ms to minimize.
[2024-05-20 21:02:30] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:02:30] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:02:30] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:02:30] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-20 21:02:30] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-20 21:02:30] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:02:31] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 3 ms to minimize.
[2024-05-20 21:02:31] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:02:31] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
[2024-05-20 21:02:31] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:02:31] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-20 21:02:31] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-20 21:02:31] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2024-05-20 21:02:31] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1675 unsolved
[2024-05-20 21:02:32] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 3 ms to minimize.
[2024-05-20 21:02:32] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 2 ms to minimize.
[2024-05-20 21:02:32] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 3 ms to minimize.
[2024-05-20 21:02:32] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 2 ms to minimize.
[2024-05-20 21:02:33] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 2 ms to minimize.
[2024-05-20 21:02:33] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 3 ms to minimize.
[2024-05-20 21:02:33] [INFO ] Deduced a trap composed of 28 places in 178 ms of which 3 ms to minimize.
[2024-05-20 21:02:33] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 3 ms to minimize.
[2024-05-20 21:02:33] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 2 ms to minimize.
[2024-05-20 21:02:33] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 3 ms to minimize.
[2024-05-20 21:02:34] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 2 ms to minimize.
[2024-05-20 21:02:34] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 2 ms to minimize.
[2024-05-20 21:02:34] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 2 ms to minimize.
[2024-05-20 21:02:34] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 3 ms to minimize.
[2024-05-20 21:02:34] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 2 ms to minimize.
[2024-05-20 21:02:34] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 2 ms to minimize.
[2024-05-20 21:02:34] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 1 ms to minimize.
[2024-05-20 21:02:34] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2024-05-20 21:02:35] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-05-20 21:02:35] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1675 unsolved
[2024-05-20 21:02:35] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 3 ms to minimize.
[2024-05-20 21:02:35] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 2 ms to minimize.
[2024-05-20 21:02:36] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 2 ms to minimize.
[2024-05-20 21:02:36] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 2 ms to minimize.
[2024-05-20 21:02:36] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 2 ms to minimize.
[2024-05-20 21:02:36] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 1 ms to minimize.
[2024-05-20 21:02:36] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-05-20 21:02:36] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:02:36] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 2 ms to minimize.
[2024-05-20 21:02:37] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 2 ms to minimize.
[2024-05-20 21:02:37] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
[2024-05-20 21:02:37] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-05-20 21:02:37] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-05-20 21:02:37] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:02:37] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:02:37] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:02:37] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:02:37] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:02:37] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:02:37] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1675 unsolved
[2024-05-20 21:02:38] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 2 ms to minimize.
[2024-05-20 21:02:38] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 3 ms to minimize.
[2024-05-20 21:02:38] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 2 ms to minimize.
[2024-05-20 21:02:38] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 2 ms to minimize.
[2024-05-20 21:02:38] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 2 ms to minimize.
[2024-05-20 21:02:39] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 2 ms to minimize.
[2024-05-20 21:02:39] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 3 ms to minimize.
[2024-05-20 21:02:39] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 2 ms to minimize.
[2024-05-20 21:02:39] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:02:39] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 1 ms to minimize.
[2024-05-20 21:02:39] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:02:39] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:02:39] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:02:39] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-20 21:02:40] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:02:40] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-05-20 21:02:40] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-20 21:02:40] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-05-20 21:02:40] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:02:40] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1675 unsolved
[2024-05-20 21:02:41] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 2 ms to minimize.
[2024-05-20 21:02:41] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 2 ms to minimize.
[2024-05-20 21:02:41] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 3 ms to minimize.
[2024-05-20 21:02:41] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-20 21:02:41] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 2 ms to minimize.
[2024-05-20 21:02:41] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 1 ms to minimize.
[2024-05-20 21:02:41] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-20 21:02:42] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:02:42] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:02:42] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:02:42] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:02:42] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:02:42] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2024-05-20 21:02:42] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:02:42] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:02:42] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:02:42] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:02:42] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:02:42] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:02:43] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1675 unsolved
[2024-05-20 21:02:43] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 2 ms to minimize.
[2024-05-20 21:02:43] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 3 ms to minimize.
[2024-05-20 21:02:43] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 2 ms to minimize.
[2024-05-20 21:02:44] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
[2024-05-20 21:02:44] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 2 ms to minimize.
[2024-05-20 21:02:44] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-20 21:02:44] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-20 21:02:44] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-05-20 21:02:44] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:02:44] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-05-20 21:02:44] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:02:44] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:02:44] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:02:45] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:02:45] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:02:45] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 3 ms to minimize.
[2024-05-20 21:02:45] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:02:45] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-20 21:02:45] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:02:45] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 1675 unsolved
[2024-05-20 21:02:46] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-20 21:02:46] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 2 ms to minimize.
[2024-05-20 21:02:46] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:02:46] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-05-20 21:02:46] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 2 ms to minimize.
[2024-05-20 21:02:46] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2024-05-20 21:02:46] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-20 21:02:46] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2024-05-20 21:02:46] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:02:46] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:02:46] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:02:47] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2024-05-20 21:02:47] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-20 21:02:47] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:02:47] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:02:47] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:02:47] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:02:47] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:02:47] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:02:47] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 1675 unsolved
[2024-05-20 21:02:48] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 1 ms to minimize.
[2024-05-20 21:02:48] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-05-20 21:02:48] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
[2024-05-20 21:02:48] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-20 21:02:48] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
[2024-05-20 21:02:48] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 1 ms to minimize.
[2024-05-20 21:02:48] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2024-05-20 21:02:49] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:02:49] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:02:49] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:02:49] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
[2024-05-20 21:02:49] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:02:49] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:02:49] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:02:49] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:02:49] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:02:49] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-20 21:02:49] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:02:49] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:02:49] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 1675 unsolved
[2024-05-20 21:02:50] [INFO ] Deduced a trap composed of 28 places in 196 ms of which 3 ms to minimize.
[2024-05-20 21:02:51] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 2 ms to minimize.
[2024-05-20 21:02:51] [INFO ] Deduced a trap composed of 29 places in 166 ms of which 2 ms to minimize.
[2024-05-20 21:02:51] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 2 ms to minimize.
[2024-05-20 21:02:51] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 2 ms to minimize.
[2024-05-20 21:02:51] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-05-20 21:02:51] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 1 ms to minimize.
[2024-05-20 21:02:51] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 2 ms to minimize.
[2024-05-20 21:02:51] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
[2024-05-20 21:02:52] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-20 21:02:52] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:02:52] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:02:52] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:02:52] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:02:52] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:02:52] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:02:52] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
SMT process timed out in 60742ms, After SMT, problems are : Problem set: 0 solved, 1675 unsolved
Search for dead transitions found 0 dead transitions in 60758ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65431 ms. Remains : 542/542 places, 1695/1695 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1536 edges and 542 vertex of which 437 / 542 are part of one of the 2 SCC in 3 ms
Free SCC test removed 435 places
Drop transitions (Empty/Sink Transition effects.) removed 1121 transitions
Ensure Unique test removed 406 transitions
Reduce isomorphic transitions removed 1527 transitions.
Graph (complete) has 291 edges and 107 vertex of which 49 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.0 ms
Discarding 58 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Drop transitions (Empty/Sink Transition effects.) removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 49 transition count 92
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 95 place count 15 transition count 41
Iterating global reduction 1 with 34 rules applied. Total rules applied 129 place count 15 transition count 41
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 146 place count 15 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 14 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 150 place count 13 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 151 place count 13 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 13 transition count 19
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 13 transition count 18
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 156 place count 12 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 10 transition count 15
Applied a total of 158 rules in 25 ms. Remains 10 /542 variables (removed 532) and now considering 15/1695 (removed 1680) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 10 cols
[2024-05-20 21:02:52] [INFO ] Computed 2 invariants in 0 ms
[2024-05-20 21:02:52] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 21:02:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 21:02:52] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 21:02:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 21:02:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 21:02:52] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 21:02:52] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 21:02:52] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 131 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 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 50 ms :[true, p0]
Stuttering acceptance computed with spot in 52 ms :[true, p0]
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 277 place count 905 transition count 2381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Deduced a syphon composed of 360 places in 1 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 3 with 720 rules applied. Total rules applied 998 place count 544 transition count 2021
Drop transitions (Redundant composition of simpler transitions.) removed 324 transitions
Redundant transition composition rules discarded 324 transitions
Iterating global reduction 3 with 324 rules applied. Total rules applied 1322 place count 544 transition count 1697
Partial Post-agglomeration rule applied 38 times.
Drop transitions (Partial Post agglomeration) removed 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 1360 place count 544 transition count 1697
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 1378 place count 526 transition count 1679
Iterating global reduction 3 with 18 rules applied. Total rules applied 1396 place count 526 transition count 1679
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 1414 place count 526 transition count 1661
Applied a total of 1414 rules in 190 ms. Remains 526 /1043 variables (removed 517) and now considering 1661/2520 (removed 859) transitions.
// Phase 1: matrix 1661 rows 526 cols
[2024-05-20 21:02:53] [INFO ] Computed 22 invariants in 18 ms
[2024-05-20 21:02:53] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-20 21:02:53] [INFO ] Invariant cache hit.
[2024-05-20 21:02:53] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 21:02:55] [INFO ] Implicit Places using invariants and state equation in 1859 ms returned []
Implicit Place search using SMT with State Equation took 2097 ms to find 0 implicit places.
[2024-05-20 21:02:55] [INFO ] Redundant transitions in 26 ms returned []
Running 1641 sub problems to find dead transitions.
[2024-05-20 21:02:55] [INFO ] Invariant cache hit.
[2024-05-20 21:02:55] [INFO ] State equation strengthened by 1177 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:03:08] [INFO ] Deduced a trap composed of 22 places in 212 ms of which 3 ms to minimize.
[2024-05-20 21:03:09] [INFO ] Deduced a trap composed of 22 places in 218 ms of which 2 ms to minimize.
[2024-05-20 21:03:09] [INFO ] Deduced a trap composed of 22 places in 192 ms of which 3 ms to minimize.
[2024-05-20 21:03:09] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 3 ms to minimize.
[2024-05-20 21:03:09] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:03:09] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:03:09] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:03:09] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:03:10] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 3 ms to minimize.
[2024-05-20 21:03:11] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 3 ms to minimize.
[2024-05-20 21:03:11] [INFO ] Deduced a trap composed of 27 places in 207 ms of which 2 ms to minimize.
[2024-05-20 21:03:11] [INFO ] Deduced a trap composed of 26 places in 210 ms of which 3 ms to minimize.
[2024-05-20 21:03:19] [INFO ] Deduced a trap composed of 26 places in 188 ms of which 3 ms to minimize.
[2024-05-20 21:03:19] [INFO ] Deduced a trap composed of 28 places in 211 ms of which 3 ms to minimize.
[2024-05-20 21:03:19] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 3 ms to minimize.
[2024-05-20 21:03:20] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 3 ms to minimize.
[2024-05-20 21:03:20] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 3 ms to minimize.
[2024-05-20 21:03:20] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 3 ms to minimize.
[2024-05-20 21:03:20] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 3 ms to minimize.
[2024-05-20 21:03:20] [INFO ] Deduced a trap composed of 29 places in 209 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:03:21] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 3 ms to minimize.
[2024-05-20 21:03:21] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 2 ms to minimize.
[2024-05-20 21:03:21] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 2 ms to minimize.
[2024-05-20 21:03:21] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:03:21] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
[2024-05-20 21:03:21] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:03:22] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
[2024-05-20 21:03:22] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2024-05-20 21:03:22] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 1 ms to minimize.
[2024-05-20 21:03:22] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 1 ms to minimize.
[2024-05-20 21:03:22] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-05-20 21:03:22] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2024-05-20 21:03:22] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
[2024-05-20 21:03:22] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-05-20 21:03:22] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-05-20 21:03:23] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-05-20 21:03:23] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:03:23] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 3 ms to minimize.
[2024-05-20 21:03:23] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-20 21:03:23] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/2187 variables, and 62 constraints, problems are : Problem set: 0 solved, 1641 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/526 constraints, ReadFeed: 0/1177 constraints, PredecessorRefiner: 1641/1641 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1641 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:03:27] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2024-05-20 21:03:27] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:03:27] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
[2024-05-20 21:03:27] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-05-20 21:03:27] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-05-20 21:03:27] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:03:27] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:03:27] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:03:27] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 2 ms to minimize.
[2024-05-20 21:03:28] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:03:28] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:03:28] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:03:28] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:03:28] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:03:28] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:03:28] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:03:28] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:03:28] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:03:28] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:03:28] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:03:29] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2024-05-20 21:03:29] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-05-20 21:03:29] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-20 21:03:29] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-20 21:03:29] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2024-05-20 21:03:29] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-05-20 21:03:29] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-20 21:03:30] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 1 ms to minimize.
[2024-05-20 21:03:30] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-05-20 21:03:30] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-20 21:03:30] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:03:30] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:03:30] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:03:30] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:03:30] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:03:30] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:03:30] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-05-20 21:03:30] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:03:30] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:03:31] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:03:31] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 2 ms to minimize.
[2024-05-20 21:03:31] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2024-05-20 21:03:31] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:03:32] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
[2024-05-20 21:03:32] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 2 ms to minimize.
[2024-05-20 21:03:32] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:03:32] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-05-20 21:03:32] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 2 ms to minimize.
[2024-05-20 21:03:32] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 2 ms to minimize.
[2024-05-20 21:03:32] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 2 ms to minimize.
[2024-05-20 21:03:32] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2024-05-20 21:03:33] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:03:33] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:03:33] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
[2024-05-20 21:03:33] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-20 21:03:33] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2024-05-20 21:03:33] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:03:33] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:03:33] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:03:33] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:03:34] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:03:34] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:03:34] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:03:34] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:03:34] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:03:34] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:03:35] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:03:35] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:03:35] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:03:35] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:03:35] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:03:35] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:03:35] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:03:35] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:03:35] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:03:35] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-20 21:03:35] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
[2024-05-20 21:03:35] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:03:35] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-20 21:03:35] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:03:36] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2024-05-20 21:03:36] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-20 21:03:36] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-05-20 21:03:36] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2024-05-20 21:03:36] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2024-05-20 21:03:37] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:03:37] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:03:37] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-05-20 21:03:37] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:03:37] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-05-20 21:03:37] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:03:37] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:03:37] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-20 21:03:37] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:03:37] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 2 ms to minimize.
[2024-05-20 21:03:38] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:03:38] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:03:38] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2024-05-20 21:03:38] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:03:38] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:03:39] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 1 ms to minimize.
[2024-05-20 21:03:39] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-05-20 21:03:39] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 1 ms to minimize.
[2024-05-20 21:03:39] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 2 ms to minimize.
[2024-05-20 21:03:39] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 1 ms to minimize.
[2024-05-20 21:03:39] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:03:39] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:03:39] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:03:40] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-20 21:03:40] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-05-20 21:03:40] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
[2024-05-20 21:03:40] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:03:40] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:03:40] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:03:40] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:03:40] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:03:40] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:03:40] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:03:40] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-20 21:03:40] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:03:41] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-05-20 21:03:41] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:03:41] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:03:41] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:03:41] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:03:41] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:03:42] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:03:42] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:03:42] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:03:42] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-20 21:03:42] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:03:42] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:03:42] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:03:42] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:03:42] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:03:42] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:03:42] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:03:42] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:03:43] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:03:43] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:03:43] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:03:43] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2024-05-20 21:03:43] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:03:44] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:03:44] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2024-05-20 21:03:44] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:03:44] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-05-20 21:03:44] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-05-20 21:03:44] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:03:44] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:03:44] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:03:44] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:03:44] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:03:45] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:03:45] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:03:45] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:03:45] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-20 21:03:45] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:03:45] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-05-20 21:03:45] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:03:45] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2024-05-20 21:03:46] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2024-05-20 21:03:46] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:03:46] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:03:46] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2024-05-20 21:03:46] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-05-20 21:03:46] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:03:46] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:03:46] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-20 21:03:46] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:03:46] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2024-05-20 21:03:46] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:03:46] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:03:46] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:03:47] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:03:47] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:03:47] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:03:47] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:03:47] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-05-20 21:03:47] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/525 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:03:48] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2024-05-20 21:03:48] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-05-20 21:03:48] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:03:48] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:03:48] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:03:48] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-05-20 21:03:48] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-05-20 21:03:49] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:03:49] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:03:49] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:03:49] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-20 21:03:49] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:03:49] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 2 ms to minimize.
[2024-05-20 21:03:49] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
[2024-05-20 21:03:49] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2024-05-20 21:03:49] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-05-20 21:03:49] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2024-05-20 21:03:50] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:03:50] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:03:50] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:03:51] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-20 21:03:51] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 2 ms to minimize.
[2024-05-20 21:03:51] [INFO ] Deduced a trap composed of 2 places in 124 ms of which 2 ms to minimize.
[2024-05-20 21:03:52] [INFO ] Deduced a trap composed of 2 places in 169 ms of which 3 ms to minimize.
[2024-05-20 21:03:52] [INFO ] Deduced a trap composed of 2 places in 184 ms of which 3 ms to minimize.
[2024-05-20 21:03:52] [INFO ] Deduced a trap composed of 2 places in 179 ms of which 3 ms to minimize.
[2024-05-20 21:03:52] [INFO ] Deduced a trap composed of 3 places in 193 ms of which 3 ms to minimize.
[2024-05-20 21:03:53] [INFO ] Deduced a trap composed of 2 places in 187 ms of which 3 ms to minimize.
[2024-05-20 21:03:53] [INFO ] Deduced a trap composed of 2 places in 178 ms of which 3 ms to minimize.
[2024-05-20 21:03:53] [INFO ] Deduced a trap composed of 2 places in 189 ms of which 2 ms to minimize.
[2024-05-20 21:03:53] [INFO ] Deduced a trap composed of 2 places in 187 ms of which 2 ms to minimize.
[2024-05-20 21:03:53] [INFO ] Deduced a trap composed of 2 places in 197 ms of which 2 ms to minimize.
[2024-05-20 21:03:54] [INFO ] Deduced a trap composed of 2 places in 205 ms of which 2 ms to minimize.
[2024-05-20 21:03:54] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 3 ms to minimize.
[2024-05-20 21:03:54] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 3 ms to minimize.
[2024-05-20 21:03:54] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 2 ms to minimize.
[2024-05-20 21:03:54] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 2 ms to minimize.
[2024-05-20 21:03:55] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 2 ms to minimize.
[2024-05-20 21:03:55] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 2 ms to minimize.
[2024-05-20 21:03:55] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/2187 variables, and 282 constraints, problems are : Problem set: 0 solved, 1641 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/526 constraints, ReadFeed: 0/1177 constraints, PredecessorRefiner: 0/1641 constraints, Known Traps: 260/260 constraints]
After SMT, in 60588ms problems are : Problem set: 0 solved, 1641 unsolved
Search for dead transitions found 0 dead transitions in 60606ms
Starting structural reductions in SI_LTL mode, iteration 1 : 526/1043 places, 1661/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62934 ms. Remains : 526/1043 places, 1661/2520 transitions.
Computed a total of 60 stabilizing places and 99 stable transitions
Computed a total of 60 stabilizing places and 99 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 190 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 37 ms :[true, p0]
RANDOM walk for 40000 steps (378 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (17 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 360160 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 1
Probabilistic random walk after 360160 steps, saw 53427 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
[2024-05-20 21:03:59] [INFO ] Invariant cache hit.
[2024-05-20 21:03:59] [INFO ] State equation strengthened by 1177 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 482/484 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 21:03:59] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 0 ms to minimize.
[2024-05-20 21:03:59] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-05-20 21:03:59] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-05-20 21:03:59] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-20 21:03:59] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-20 21:03:59] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-05-20 21:03:59] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-20 21:03:59] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-20 21:03:59] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-20 21:03:59] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-20 21:03:59] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-20 21:03:59] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/484 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/522 variables, 19/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/524 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 21:04:00] [INFO ] Deduced a trap composed of 2 places in 231 ms of which 3 ms to minimize.
[2024-05-20 21:04:00] [INFO ] Deduced a trap composed of 2 places in 220 ms of which 3 ms to minimize.
[2024-05-20 21:04:00] [INFO ] Deduced a trap composed of 2 places in 225 ms of which 3 ms to minimize.
[2024-05-20 21:04:00] [INFO ] Deduced a trap composed of 2 places in 222 ms of which 3 ms to minimize.
[2024-05-20 21:04:01] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 3 ms to minimize.
[2024-05-20 21:04:01] [INFO ] Deduced a trap composed of 3 places in 237 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1661/2185 variables, 524/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2185 variables, 1177/1741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2185 variables, 0/1741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/2187 variables, 2/1743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2187 variables, 0/1743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2187 variables, 0/1743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2187/2187 variables, and 1743 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2477 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 526/526 constraints, ReadFeed: 1177/1177 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 482/484 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/484 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 21:04:01] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-20 21:04:01] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/522 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/524 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/524 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 21:04:02] [INFO ] Deduced a trap composed of 29 places in 208 ms of which 2 ms to minimize.
[2024-05-20 21:04:02] [INFO ] Deduced a trap composed of 33 places in 205 ms of which 3 ms to minimize.
[2024-05-20 21:04:02] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/524 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/524 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1661/2185 variables, 524/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2185 variables, 1177/1746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2185 variables, 1/1747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2185 variables, 0/1747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/2187 variables, 2/1749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2187 variables, 0/1749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2187 variables, 0/1749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2187/2187 variables, and 1749 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1419 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 526/526 constraints, ReadFeed: 1177/1177 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 23/23 constraints]
After SMT, in 3912ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1661/1661 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 526 transition count 1659
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 524 transition count 1659
Partial Free-agglomeration rule applied 421 times.
Drop transitions (Partial Free agglomeration) removed 421 transitions
Iterating global reduction 1 with 421 rules applied. Total rules applied 425 place count 524 transition count 1659
Applied a total of 425 rules in 68 ms. Remains 524 /526 variables (removed 2) and now considering 1659/1661 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 524/526 places, 1659/1661 transitions.
RANDOM walk for 40000 steps (410 resets) in 300 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (15 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 369823 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 1
Probabilistic random walk after 369823 steps, saw 52543 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
// Phase 1: matrix 1659 rows 524 cols
[2024-05-20 21:04:06] [INFO ] Computed 22 invariants in 18 ms
[2024-05-20 21:04:06] [INFO ] State equation strengthened by 1577 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 482/484 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 21:04:06] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/484 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 36/520 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/522 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 21:04:06] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 3 ms to minimize.
[2024-05-20 21:04:06] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 3 ms to minimize.
[2024-05-20 21:04:07] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 3 ms to minimize.
[2024-05-20 21:04:07] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 2 ms to minimize.
[2024-05-20 21:04:07] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 2 ms to minimize.
[2024-05-20 21:04:07] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 2 ms to minimize.
[2024-05-20 21:04:07] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 2 ms to minimize.
[2024-05-20 21:04:08] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 2 ms to minimize.
[2024-05-20 21:04:08] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 2 ms to minimize.
[2024-05-20 21:04:08] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 2 ms to minimize.
[2024-05-20 21:04:08] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 2 ms to minimize.
[2024-05-20 21:04:08] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 2 ms to minimize.
[2024-05-20 21:04:08] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 2 ms to minimize.
[2024-05-20 21:04:08] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 2 ms to minimize.
[2024-05-20 21:04:09] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 2 ms to minimize.
[2024-05-20 21:04:09] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
[2024-05-20 21:04:09] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 1 ms to minimize.
[2024-05-20 21:04:09] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:04:09] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2024-05-20 21:04:09] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 21:04:09] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2024-05-20 21:04:09] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-05-20 21:04:09] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-20 21:04:10] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:04:10] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:04:10] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/522 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/522 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1659/2181 variables, 522/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2181 variables, 1577/2148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/2181 variables, 0/2148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/2183 variables, 2/2150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2183 variables, 0/2150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2183 variables, 0/2150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2183/2183 variables, and 2150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4261 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 524/524 constraints, ReadFeed: 1577/1577 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 482/484 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/484 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 21:04:10] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/520 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/522 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/522 variables, 26/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/522 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1659/2181 variables, 522/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2181 variables, 1577/2149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2181 variables, 1/2150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2181 variables, 0/2150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/2183 variables, 2/2152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2183 variables, 0/2152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2183 variables, 0/2152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2183/2183 variables, and 2152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1377 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 524/524 constraints, ReadFeed: 1577/1577 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 28/28 constraints]
After SMT, in 5683ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 74 ms.
Support contains 2 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1659/1659 transitions.
Applied a total of 0 rules in 29 ms. Remains 524 /524 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 524/524 places, 1659/1659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1659/1659 transitions.
Applied a total of 0 rules in 31 ms. Remains 524 /524 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2024-05-20 21:04:12] [INFO ] Invariant cache hit.
[2024-05-20 21:04:12] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-20 21:04:12] [INFO ] Invariant cache hit.
[2024-05-20 21:04:12] [INFO ] State equation strengthened by 1577 read => feed constraints.
[2024-05-20 21:04:16] [INFO ] Implicit Places using invariants and state equation in 4306 ms returned []
Implicit Place search using SMT with State Equation took 4665 ms to find 0 implicit places.
[2024-05-20 21:04:16] [INFO ] Redundant transitions in 27 ms returned []
Running 1639 sub problems to find dead transitions.
[2024-05-20 21:04:16] [INFO ] Invariant cache hit.
[2024-05-20 21:04:16] [INFO ] State equation strengthened by 1577 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:04:30] [INFO ] Deduced a trap composed of 38 places in 197 ms of which 3 ms to minimize.
[2024-05-20 21:04:30] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:04:30] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 2 ms to minimize.
[2024-05-20 21:04:30] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 2 ms to minimize.
[2024-05-20 21:04:31] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:04:31] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:04:31] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:04:31] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:04:31] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:04:31] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:04:31] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:04:31] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 2 ms to minimize.
[2024-05-20 21:04:31] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-05-20 21:04:31] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:04:31] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:04:31] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2024-05-20 21:04:32] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 2 ms to minimize.
[2024-05-20 21:04:32] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 3 ms to minimize.
[2024-05-20 21:04:32] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 2 ms to minimize.
[2024-05-20 21:04:32] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/523 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:04:32] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-05-20 21:04:33] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:04:33] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2024-05-20 21:04:33] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
[2024-05-20 21:04:33] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
[2024-05-20 21:04:33] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
[2024-05-20 21:04:33] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:04:33] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:04:34] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 2 ms to minimize.
[2024-05-20 21:04:34] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2024-05-20 21:04:34] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-20 21:04:34] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-05-20 21:04:34] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-05-20 21:04:34] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:04:34] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:04:34] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:04:34] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:04:34] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:04:34] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:04:35] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 523/2183 variables, and 62 constraints, problems are : Problem set: 0 solved, 1639 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/524 constraints, ReadFeed: 0/1577 constraints, PredecessorRefiner: 1639/1639 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1639 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/523 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:04:48] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:04:48] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:04:49] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 3 ms to minimize.
[2024-05-20 21:04:49] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 3 ms to minimize.
[2024-05-20 21:04:49] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 3 ms to minimize.
[2024-05-20 21:04:49] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 3 ms to minimize.
[2024-05-20 21:04:49] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 3 ms to minimize.
[2024-05-20 21:04:50] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 3 ms to minimize.
[2024-05-20 21:04:50] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 3 ms to minimize.
[2024-05-20 21:04:50] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-05-20 21:04:50] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 2 ms to minimize.
[2024-05-20 21:04:50] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-20 21:04:50] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 3 ms to minimize.
[2024-05-20 21:04:50] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 3 ms to minimize.
[2024-05-20 21:04:50] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:04:51] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 3 ms to minimize.
[2024-05-20 21:04:51] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 3 ms to minimize.
[2024-05-20 21:04:51] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 2 ms to minimize.
[2024-05-20 21:04:51] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-05-20 21:04:51] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:04:52] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 2 ms to minimize.
[2024-05-20 21:04:52] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-20 21:04:52] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 2 ms to minimize.
[2024-05-20 21:04:52] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 2 ms to minimize.
[2024-05-20 21:04:52] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 1 ms to minimize.
[2024-05-20 21:04:52] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-20 21:04:52] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:04:52] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2024-05-20 21:04:53] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-20 21:04:53] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:04:53] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-05-20 21:04:53] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:04:53] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:04:53] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:04:53] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:04:53] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:04:53] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:04:53] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:04:53] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-20 21:04:53] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/523 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:04:54] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2024-05-20 21:04:54] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:04:54] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-20 21:04:54] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-05-20 21:04:54] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2024-05-20 21:04:54] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:04:55] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:04:55] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-05-20 21:04:55] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
[2024-05-20 21:04:55] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-05-20 21:04:55] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:04:55] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:04:55] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:04:55] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:04:55] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:04:55] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:04:55] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:04:55] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:04:56] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:04:56] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/523 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:04:56] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 2 ms to minimize.
[2024-05-20 21:04:56] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 2 ms to minimize.
[2024-05-20 21:04:56] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 2 ms to minimize.
[2024-05-20 21:04:57] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 2 ms to minimize.
[2024-05-20 21:04:57] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:04:57] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 2 ms to minimize.
[2024-05-20 21:04:57] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 2 ms to minimize.
[2024-05-20 21:04:57] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 1 ms to minimize.
[2024-05-20 21:04:57] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:04:57] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:04:57] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2024-05-20 21:04:57] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:04:57] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-20 21:04:58] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:04:58] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:04:58] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-05-20 21:04:58] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:04:58] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:04:58] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:04:58] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:04:59] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:04:59] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-20 21:04:59] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-05-20 21:04:59] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:04:59] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:04:59] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:04:59] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2024-05-20 21:04:59] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:04:59] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:04:59] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:05:00] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:05:00] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-20 21:05:00] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:05:00] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:05:00] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:05:00] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:05:00] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:05:00] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-05-20 21:05:00] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2024-05-20 21:05:00] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:05:01] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:05:01] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2024-05-20 21:05:01] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 1 ms to minimize.
[2024-05-20 21:05:01] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2024-05-20 21:05:01] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:05:02] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:05:02] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:05:02] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
[2024-05-20 21:05:02] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:05:02] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:05:02] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:05:02] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:05:02] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:05:02] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:05:02] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-20 21:05:02] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:05:02] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:05:02] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
[2024-05-20 21:05:02] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-20 21:05:02] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/523 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:05:03] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-20 21:05:03] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:05:03] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:05:03] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
[2024-05-20 21:05:04] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:05:04] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:05:04] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:05:04] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:05:04] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:05:04] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:05:04] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-05-20 21:05:04] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:05:04] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:05:04] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-05-20 21:05:04] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:05:04] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-05-20 21:05:04] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-05-20 21:05:11] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 2 ms to minimize.
[2024-05-20 21:05:11] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 1 ms to minimize.
[2024-05-20 21:05:11] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/523 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:05:12] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 3 ms to minimize.
[2024-05-20 21:05:12] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 3 ms to minimize.
[2024-05-20 21:05:12] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 2 ms to minimize.
[2024-05-20 21:05:12] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 2 ms to minimize.
[2024-05-20 21:05:12] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 2 ms to minimize.
[2024-05-20 21:05:13] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 2 ms to minimize.
[2024-05-20 21:05:13] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-05-20 21:05:13] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2024-05-20 21:05:13] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-05-20 21:05:13] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2024-05-20 21:05:13] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:05:13] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:05:13] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-05-20 21:05:13] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:05:14] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:05:14] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:05:14] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:05:14] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:05:14] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:05:14] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/523 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:05:15] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:05:15] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 1 ms to minimize.
[2024-05-20 21:05:15] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2024-05-20 21:05:15] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-05-20 21:05:15] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2024-05-20 21:05:15] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2024-05-20 21:05:15] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-05-20 21:05:15] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2024-05-20 21:05:15] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 1 ms to minimize.
[2024-05-20 21:05:16] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:05:16] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 1 ms to minimize.
[2024-05-20 21:05:16] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 1 ms to minimize.
[2024-05-20 21:05:16] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:05:16] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-05-20 21:05:16] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-20 21:05:16] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
[2024-05-20 21:05:16] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2024-05-20 21:05:16] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:05:16] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:05:17] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/523 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 523/2183 variables, and 242 constraints, problems are : Problem set: 0 solved, 1639 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/524 constraints, ReadFeed: 0/1577 constraints, PredecessorRefiner: 0/1639 constraints, Known Traps: 220/220 constraints]
After SMT, in 60697ms problems are : Problem set: 0 solved, 1639 unsolved
Search for dead transitions found 0 dead transitions in 60710ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65446 ms. Remains : 524/524 places, 1659/1659 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1519 edges and 524 vertex of which 418 / 524 are part of one of the 2 SCC in 1 ms
Free SCC test removed 416 places
Drop transitions (Empty/Sink Transition effects.) removed 1084 transitions
Ensure Unique test removed 408 transitions
Reduce isomorphic transitions removed 1492 transitions.
Graph (complete) has 291 edges and 108 vertex of which 50 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.1 ms
Discarding 58 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Drop transitions (Empty/Sink Transition effects.) removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 50 transition count 91
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 95 place count 16 transition count 40
Iterating global reduction 1 with 34 rules applied. Total rules applied 129 place count 16 transition count 40
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 146 place count 16 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 15 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 150 place count 14 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 14 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 14 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 154 place count 13 transition count 18
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 13 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 156 place count 12 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 10 transition count 15
Applied a total of 158 rules in 16 ms. Remains 10 /524 variables (removed 514) and now considering 15/1659 (removed 1644) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 10 cols
[2024-05-20 21:05:17] [INFO ] Computed 2 invariants in 0 ms
[2024-05-20 21:05:17] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 21:05:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 21:05:17] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 21:05:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 21:05:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 21:05:17] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 21:05:17] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 21:05:17] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 74 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 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 48 ms :[true, p0]
Stuttering acceptance computed with spot in 109 ms :[true, p0]
Stuttering acceptance computed with spot in 50 ms :[true, p0]
Product exploration explored 100000 steps with 949 reset in 396 ms.
Product exploration explored 100000 steps with 958 reset in 424 ms.
Built C files in :
/tmp/ltsmin17930783845450577465
[2024-05-20 21:05:18] [INFO ] Too many transitions (1661) to apply POR reductions. Disabling POR matrices.
[2024-05-20 21:05:18] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17930783845450577465
Running compilation step : cd /tmp/ltsmin17930783845450577465;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17930783845450577465;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17930783845450577465;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 1661/1661 transitions.
Applied a total of 0 rules in 20 ms. Remains 526 /526 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
// Phase 1: matrix 1661 rows 526 cols
[2024-05-20 21:05:21] [INFO ] Computed 22 invariants in 12 ms
[2024-05-20 21:05:22] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-20 21:05:22] [INFO ] Invariant cache hit.
[2024-05-20 21:05:22] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 21:05:23] [INFO ] Implicit Places using invariants and state equation in 1751 ms returned []
Implicit Place search using SMT with State Equation took 1985 ms to find 0 implicit places.
[2024-05-20 21:05:23] [INFO ] Redundant transitions in 19 ms returned []
Running 1641 sub problems to find dead transitions.
[2024-05-20 21:05:23] [INFO ] Invariant cache hit.
[2024-05-20 21:05:24] [INFO ] State equation strengthened by 1177 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:05:37] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 3 ms to minimize.
[2024-05-20 21:05:37] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 2 ms to minimize.
[2024-05-20 21:05:37] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 2 ms to minimize.
[2024-05-20 21:05:37] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 2 ms to minimize.
[2024-05-20 21:05:37] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-05-20 21:05:38] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:05:38] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:05:38] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:05:39] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 3 ms to minimize.
[2024-05-20 21:05:39] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 3 ms to minimize.
[2024-05-20 21:05:39] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 3 ms to minimize.
[2024-05-20 21:05:39] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 3 ms to minimize.
[2024-05-20 21:05:47] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 3 ms to minimize.
[2024-05-20 21:05:47] [INFO ] Deduced a trap composed of 28 places in 179 ms of which 3 ms to minimize.
[2024-05-20 21:05:47] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 3 ms to minimize.
[2024-05-20 21:05:47] [INFO ] Deduced a trap composed of 30 places in 183 ms of which 2 ms to minimize.
[2024-05-20 21:05:48] [INFO ] Deduced a trap composed of 30 places in 188 ms of which 3 ms to minimize.
[2024-05-20 21:05:48] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 3 ms to minimize.
[2024-05-20 21:05:48] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 3 ms to minimize.
[2024-05-20 21:05:48] [INFO ] Deduced a trap composed of 29 places in 185 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:05:49] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 3 ms to minimize.
[2024-05-20 21:05:49] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 3 ms to minimize.
[2024-05-20 21:05:49] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 2 ms to minimize.
[2024-05-20 21:05:49] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 2 ms to minimize.
[2024-05-20 21:05:49] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 1 ms to minimize.
[2024-05-20 21:05:49] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:05:49] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 2 ms to minimize.
[2024-05-20 21:05:49] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2024-05-20 21:05:50] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-20 21:05:50] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-20 21:05:50] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2024-05-20 21:05:50] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:05:50] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
[2024-05-20 21:05:50] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-20 21:05:50] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:05:50] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-20 21:05:50] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-20 21:05:50] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-05-20 21:05:51] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-20 21:05:51] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
(s193 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 12.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0timeout
)
(s194 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/2187 variables, and 62 constraints, problems are : Problem set: 0 solved, 1641 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/526 constraints, ReadFeed: 0/1177 constraints, PredecessorRefiner: 1641/1641 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1641 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:05:55] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:05:55] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:05:56] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:05:56] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:05:56] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:05:56] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2024-05-20 21:05:56] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-05-20 21:05:56] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:05:56] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:05:56] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-20 21:05:56] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:05:56] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:05:56] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:05:56] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 2 ms to minimize.
[2024-05-20 21:05:57] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:05:57] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:05:57] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-20 21:05:57] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:05:57] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:05:57] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:05:57] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-05-20 21:05:58] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-20 21:05:58] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
[2024-05-20 21:05:58] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-20 21:05:58] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:05:58] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 1 ms to minimize.
[2024-05-20 21:05:58] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2024-05-20 21:05:58] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2024-05-20 21:05:58] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2024-05-20 21:05:58] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2024-05-20 21:05:58] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:05:59] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:05:59] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-05-20 21:05:59] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:05:59] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:05:59] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:05:59] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:05:59] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:05:59] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:05:59] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:06:00] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 2 ms to minimize.
[2024-05-20 21:06:00] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:06:00] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 2 ms to minimize.
[2024-05-20 21:06:00] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-20 21:06:00] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 2 ms to minimize.
[2024-05-20 21:06:00] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 1 ms to minimize.
[2024-05-20 21:06:01] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 1 ms to minimize.
[2024-05-20 21:06:01] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-05-20 21:06:01] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 2 ms to minimize.
[2024-05-20 21:06:01] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 2 ms to minimize.
[2024-05-20 21:06:01] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-05-20 21:06:01] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-05-20 21:06:01] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-20 21:06:01] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-20 21:06:01] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:06:02] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:06:02] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-20 21:06:02] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:06:02] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:06:02] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:06:02] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:06:03] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:06:03] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:06:03] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:06:03] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:06:03] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:06:03] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:06:03] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:06:03] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:06:03] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:06:03] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:06:03] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:06:03] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:06:03] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:06:04] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:06:04] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:06:04] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:06:04] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-20 21:06:04] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:06:04] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:06:04] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2024-05-20 21:06:05] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-20 21:06:05] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-05-20 21:06:05] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-05-20 21:06:05] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-05-20 21:06:05] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-05-20 21:06:05] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-05-20 21:06:05] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:06:05] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:06:05] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-20 21:06:05] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:06:06] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-05-20 21:06:06] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:06:06] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-20 21:06:06] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-05-20 21:06:06] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:06:06] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-05-20 21:06:06] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-20 21:06:06] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 2 ms to minimize.
[2024-05-20 21:06:06] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:06:07] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-05-20 21:06:07] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2024-05-20 21:06:07] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-05-20 21:06:07] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2024-05-20 21:06:07] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2024-05-20 21:06:08] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-20 21:06:08] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
[2024-05-20 21:06:08] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:06:08] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-05-20 21:06:08] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:06:08] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:06:08] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:06:08] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:06:08] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:06:08] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:06:08] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:06:08] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:06:08] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:06:08] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-05-20 21:06:09] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:06:09] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:06:09] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:06:09] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:06:09] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:06:09] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
[2024-05-20 21:06:10] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:06:10] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:06:10] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:06:10] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 2 ms to minimize.
[2024-05-20 21:06:10] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:06:10] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:06:10] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:06:10] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:06:10] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:06:10] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-05-20 21:06:10] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:06:10] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:06:10] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:06:11] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:06:11] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:06:11] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:06:11] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-05-20 21:06:12] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:06:12] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:06:12] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-05-20 21:06:12] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:06:12] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:06:12] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:06:12] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:06:12] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:06:12] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:06:12] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:06:12] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:06:12] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:06:12] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2024-05-20 21:06:13] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:06:13] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:06:13] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-20 21:06:13] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-20 21:06:13] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:06:13] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:06:13] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
[2024-05-20 21:06:13] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:06:14] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:06:14] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:06:14] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-05-20 21:06:14] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:06:14] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:06:14] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:06:14] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:06:14] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:06:14] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:06:14] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:06:14] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:06:14] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:06:14] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:06:14] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:06:15] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:06:15] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:06:15] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/525 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:06:16] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2024-05-20 21:06:16] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:06:16] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:06:16] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-05-20 21:06:16] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-05-20 21:06:16] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
[2024-05-20 21:06:16] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
[2024-05-20 21:06:16] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:06:16] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:06:16] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:06:16] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:06:16] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:06:17] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 2 ms to minimize.
[2024-05-20 21:06:17] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-20 21:06:17] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-05-20 21:06:17] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2024-05-20 21:06:17] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-05-20 21:06:17] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:06:17] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:06:17] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:06:18] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
[2024-05-20 21:06:18] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 1 ms to minimize.
[2024-05-20 21:06:19] [INFO ] Deduced a trap composed of 2 places in 111 ms of which 2 ms to minimize.
[2024-05-20 21:06:19] [INFO ] Deduced a trap composed of 2 places in 156 ms of which 2 ms to minimize.
[2024-05-20 21:06:19] [INFO ] Deduced a trap composed of 2 places in 157 ms of which 3 ms to minimize.
[2024-05-20 21:06:20] [INFO ] Deduced a trap composed of 2 places in 165 ms of which 3 ms to minimize.
[2024-05-20 21:06:20] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 3 ms to minimize.
[2024-05-20 21:06:20] [INFO ] Deduced a trap composed of 2 places in 154 ms of which 3 ms to minimize.
[2024-05-20 21:06:20] [INFO ] Deduced a trap composed of 2 places in 168 ms of which 3 ms to minimize.
[2024-05-20 21:06:20] [INFO ] Deduced a trap composed of 2 places in 178 ms of which 3 ms to minimize.
[2024-05-20 21:06:21] [INFO ] Deduced a trap composed of 2 places in 177 ms of which 3 ms to minimize.
[2024-05-20 21:06:21] [INFO ] Deduced a trap composed of 2 places in 185 ms of which 3 ms to minimize.
[2024-05-20 21:06:21] [INFO ] Deduced a trap composed of 2 places in 197 ms of which 3 ms to minimize.
[2024-05-20 21:06:21] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 3 ms to minimize.
[2024-05-20 21:06:21] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 3 ms to minimize.
[2024-05-20 21:06:21] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 3 ms to minimize.
[2024-05-20 21:06:22] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 3 ms to minimize.
[2024-05-20 21:06:22] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2024-05-20 21:06:22] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:06:22] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:06:23] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:06:23] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:06:23] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:06:23] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:06:24] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 2 ms to minimize.
[2024-05-20 21:06:24] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:06:24] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:06:24] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:06:24] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:06:24] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:06:24] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 2 ms to minimize.
SMT process timed out in 60514ms, After SMT, problems are : Problem set: 0 solved, 1641 unsolved
Search for dead transitions found 0 dead transitions in 60529ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62569 ms. Remains : 526/526 places, 1661/1661 transitions.
Built C files in :
/tmp/ltsmin255803956484313822
[2024-05-20 21:06:24] [INFO ] Too many transitions (1661) to apply POR reductions. Disabling POR matrices.
[2024-05-20 21:06:24] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin255803956484313822
Running compilation step : cd /tmp/ltsmin255803956484313822;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin255803956484313822;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin255803956484313822;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-20 21:06:27] [INFO ] Flatten gal took : 51 ms
[2024-05-20 21:06:27] [INFO ] Flatten gal took : 54 ms
[2024-05-20 21:06:27] [INFO ] Time to serialize gal into /tmp/LTL17183154917253031551.gal : 14 ms
[2024-05-20 21:06:27] [INFO ] Time to serialize properties into /tmp/LTL5154627013695889305.prop : 24 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17183154917253031551.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14601314230648311691.hoa' '-atoms' '/tmp/LTL5154627013695889305.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL5154627013695889305.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14601314230648311691.hoa
Detected timeout of ITS tools.
[2024-05-20 21:06:42] [INFO ] Flatten gal took : 42 ms
[2024-05-20 21:06:43] [INFO ] Flatten gal took : 40 ms
[2024-05-20 21:06:43] [INFO ] Time to serialize gal into /tmp/LTL17964076630434365361.gal : 9 ms
[2024-05-20 21:06:43] [INFO ] Time to serialize properties into /tmp/LTL3374378165958637521.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17964076630434365361.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3374378165958637521.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G("((Node17OKshare<3)&&(Node0DHTinfo2<3))"))))
Formula 0 simplified : XF!"((Node17OKshare<3)&&(Node0DHTinfo2<3))"
Detected timeout of ITS tools.
[2024-05-20 21:06:58] [INFO ] Flatten gal took : 33 ms
[2024-05-20 21:06:58] [INFO ] Applying decomposition
[2024-05-20 21:06:58] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13582205138483101512.txt' '-o' '/tmp/graph13582205138483101512.bin' '-w' '/tmp/graph13582205138483101512.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13582205138483101512.bin' '-l' '-1' '-v' '-w' '/tmp/graph13582205138483101512.weights' '-q' '0' '-e' '0.001'
[2024-05-20 21:06:58] [INFO ] Decomposing Gal with order
[2024-05-20 21:06:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 21:06:58] [INFO ] Removed a total of 1200 redundant transitions.
[2024-05-20 21:06:58] [INFO ] Flatten gal took : 356 ms
[2024-05-20 21:06:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 800 labels/synchronizations in 58 ms.
[2024-05-20 21:06:58] [INFO ] Time to serialize gal into /tmp/LTL15296783454563602987.gal : 11 ms
[2024-05-20 21:06:58] [INFO ] Time to serialize properties into /tmp/LTL14009820578319195296.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15296783454563602987.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14009820578319195296.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G("((u19.Node17OKshare<3)&&(i0.u2.Node0DHTinfo2<3))"))))
Formula 0 simplified : XF!"((u19.Node17OKshare<3)&&(i0.u2.Node0DHTinfo2<3))"
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-02 finished in 381428 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 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 24 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2024-05-20 21:07:14] [INFO ] Computed 22 invariants in 35 ms
[2024-05-20 21:07:14] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-20 21:07:14] [INFO ] Invariant cache hit.
[2024-05-20 21:07:14] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 21:07:17] [INFO ] Implicit Places using invariants and state equation in 3455 ms returned []
Implicit Place search using SMT with State Equation took 3807 ms to find 0 implicit places.
Running 2500 sub problems to find dead transitions.
[2024-05-20 21:07:17] [INFO ] Invariant cache hit.
[2024-05-20 21:07:17] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
SMT process timed out in 30772ms, After SMT, problems are : Problem set: 0 solved, 2500 unsolved
Search for dead transitions found 0 dead transitions in 30795ms
Finished structural reductions in LTL mode , in 1 iterations and 34636 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-03
Product exploration explored 100000 steps with 33333 reset in 378 ms.
Product exploration explored 100000 steps with 33333 reset in 413 ms.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 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 12 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-03 finished in 35564 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)||G(F(p1)))))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1043 transition count 2380
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 903 transition count 2380
Performed 378 Post agglomeration using F-continuation condition.Transition count delta: 378
Deduced a syphon composed of 378 places in 0 ms
Reduce places removed 378 places and 0 transitions.
Iterating global reduction 2 with 756 rules applied. Total rules applied 1036 place count 525 transition count 2002
Drop transitions (Redundant composition of simpler transitions.) removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 2 with 341 rules applied. Total rules applied 1377 place count 525 transition count 1661
Applied a total of 1377 rules in 87 ms. Remains 525 /1043 variables (removed 518) and now considering 1661/2520 (removed 859) transitions.
// Phase 1: matrix 1661 rows 525 cols
[2024-05-20 21:07:49] [INFO ] Computed 22 invariants in 15 ms
[2024-05-20 21:07:49] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-20 21:07:49] [INFO ] Invariant cache hit.
[2024-05-20 21:07:50] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2024-05-20 21:07:51] [INFO ] Implicit Places using invariants and state equation in 1707 ms returned []
Implicit Place search using SMT with State Equation took 1975 ms to find 0 implicit places.
[2024-05-20 21:07:51] [INFO ] Redundant transitions in 20 ms returned []
Running 1641 sub problems to find dead transitions.
[2024-05-20 21:07:51] [INFO ] Invariant cache hit.
[2024-05-20 21:07:51] [INFO ] State equation strengthened by 1175 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/524 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/524 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:08:05] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 4 ms to minimize.
[2024-05-20 21:08:05] [INFO ] Deduced a trap composed of 2 places in 201 ms of which 5 ms to minimize.
[2024-05-20 21:08:05] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:08:05] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:08:05] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
[2024-05-20 21:08:05] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:08:05] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:08:06] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:08:06] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:08:06] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-20 21:08:06] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-05-20 21:08:06] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 2 ms to minimize.
[2024-05-20 21:08:06] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2024-05-20 21:08:06] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:08:06] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:08:06] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-05-20 21:08:06] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:08:06] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:08:06] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:08:06] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/524 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:08:07] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 3 ms to minimize.
[2024-05-20 21:08:07] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-05-20 21:08:07] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:08:07] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 0 ms to minimize.
[2024-05-20 21:08:07] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-20 21:08:09] [INFO ] Deduced a trap composed of 30 places in 193 ms of which 3 ms to minimize.
[2024-05-20 21:08:10] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 3 ms to minimize.
[2024-05-20 21:08:11] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 3 ms to minimize.
[2024-05-20 21:08:11] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 3 ms to minimize.
[2024-05-20 21:08:11] [INFO ] Deduced a trap composed of 28 places in 202 ms of which 3 ms to minimize.
[2024-05-20 21:08:11] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 3 ms to minimize.
[2024-05-20 21:08:11] [INFO ] Deduced a trap composed of 27 places in 196 ms of which 3 ms to minimize.
[2024-05-20 21:08:12] [INFO ] Deduced a trap composed of 36 places in 196 ms of which 3 ms to minimize.
[2024-05-20 21:08:12] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 3 ms to minimize.
[2024-05-20 21:08:12] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 3 ms to minimize.
[2024-05-20 21:08:12] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 3 ms to minimize.
[2024-05-20 21:08:13] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 3 ms to minimize.
[2024-05-20 21:08:13] [INFO ] Deduced a trap composed of 27 places in 193 ms of which 3 ms to minimize.
[2024-05-20 21:08:13] [INFO ] Deduced a trap composed of 28 places in 195 ms of which 3 ms to minimize.
[2024-05-20 21:08:13] [INFO ] Deduced a trap composed of 28 places in 196 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/524 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 524/2186 variables, and 62 constraints, problems are : Problem set: 0 solved, 1641 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/525 constraints, ReadFeed: 0/1175 constraints, PredecessorRefiner: 1641/1641 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1641 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/524 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/524 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/524 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:08:23] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 1 ms to minimize.
[2024-05-20 21:08:23] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:08:23] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:08:23] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2024-05-20 21:08:23] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2024-05-20 21:08:23] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:08:24] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:08:24] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:08:24] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:08:24] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:08:24] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-20 21:08:24] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:08:24] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-05-20 21:08:24] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:08:24] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:08:24] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:08:24] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
[2024-05-20 21:08:24] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:08:24] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:08:25] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/524 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:08:25] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-05-20 21:08:25] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-05-20 21:08:25] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:08:25] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-20 21:08:25] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:08:25] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:08:25] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:08:25] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:08:26] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-05-20 21:08:26] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-20 21:08:26] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-20 21:08:26] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:08:26] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:08:26] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:08:26] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2024-05-20 21:08:26] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 2 ms to minimize.
[2024-05-20 21:08:26] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 3 ms to minimize.
[2024-05-20 21:08:27] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 2 ms to minimize.
[2024-05-20 21:08:27] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-20 21:08:27] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:08:27] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2024-05-20 21:08:28] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2024-05-20 21:08:28] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-05-20 21:08:28] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-20 21:08:28] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:08:28] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:08:28] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:08:28] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:08:28] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:08:28] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:08:28] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-20 21:08:28] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2024-05-20 21:08:28] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 2 ms to minimize.
[2024-05-20 21:08:29] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:08:29] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 2 ms to minimize.
[2024-05-20 21:08:29] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2024-05-20 21:08:29] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
[2024-05-20 21:08:29] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2024-05-20 21:08:29] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2024-05-20 21:08:29] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:08:30] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
[2024-05-20 21:08:30] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:08:30] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:08:30] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:08:30] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:08:30] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:08:30] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:08:30] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 2 ms to minimize.
[2024-05-20 21:08:30] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:08:31] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:08:31] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:08:31] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:08:31] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 0 ms to minimize.
[2024-05-20 21:08:31] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:08:31] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:08:31] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:08:31] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:08:31] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:08:31] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:08:31] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:08:32] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:08:32] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:08:32] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-20 21:08:32] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-20 21:08:32] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-20 21:08:32] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:08:32] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:08:32] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-20 21:08:32] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-20 21:08:32] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-20 21:08:32] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-20 21:08:32] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-05-20 21:08:34] [INFO ] Deduced a trap composed of 26 places in 206 ms of which 3 ms to minimize.
[2024-05-20 21:08:34] [INFO ] Deduced a trap composed of 28 places in 192 ms of which 3 ms to minimize.
[2024-05-20 21:08:34] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 3 ms to minimize.
[2024-05-20 21:08:42] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 3 ms to minimize.
[2024-05-20 21:08:44] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 1 ms to minimize.
[2024-05-20 21:08:44] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2024-05-20 21:08:44] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
[2024-05-20 21:08:44] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:08:45] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 3 ms to minimize.
[2024-05-20 21:08:45] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 2 ms to minimize.
[2024-05-20 21:08:45] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 3 ms to minimize.
[2024-05-20 21:08:45] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 3 ms to minimize.
[2024-05-20 21:08:46] [INFO ] Deduced a trap composed of 2 places in 190 ms of which 3 ms to minimize.
[2024-05-20 21:08:46] [INFO ] Deduced a trap composed of 2 places in 191 ms of which 3 ms to minimize.
[2024-05-20 21:08:46] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 3 ms to minimize.
[2024-05-20 21:08:46] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 3 ms to minimize.
[2024-05-20 21:08:46] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 3 ms to minimize.
[2024-05-20 21:08:47] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 2 ms to minimize.
[2024-05-20 21:08:47] [INFO ] Deduced a trap composed of 27 places in 183 ms of which 3 ms to minimize.
[2024-05-20 21:08:47] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-20 21:08:47] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:08:47] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:08:47] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:08:47] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:08:47] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:08:47] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-20 21:08:47] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 1 ms to minimize.
[2024-05-20 21:08:48] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:08:48] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:08:48] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:08:48] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:08:48] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:08:49] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:08:49] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:08:49] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-20 21:08:49] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 524/2186 variables, and 190 constraints, problems are : Problem set: 0 solved, 1641 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/525 constraints, ReadFeed: 0/1175 constraints, PredecessorRefiner: 0/1641 constraints, Known Traps: 168/168 constraints]
After SMT, in 60514ms problems are : Problem set: 0 solved, 1641 unsolved
Search for dead transitions found 0 dead transitions in 60527ms
Starting structural reductions in SI_LTL mode, iteration 1 : 525/1043 places, 1661/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62621 ms. Remains : 525/1043 places, 1661/2520 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-04
Product exploration explored 100000 steps with 968 reset in 447 ms.
Product exploration explored 100000 steps with 966 reset in 421 ms.
Computed a total of 63 stabilizing places and 100 stable transitions
Computed a total of 63 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 87 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (384 resets) in 344 ms. (115 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (17 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (17 resets) in 130 ms. (305 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (18 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
[2024-05-20 21:08:53] [INFO ] Invariant cache hit.
[2024-05-20 21:08:53] [INFO ] State equation strengthened by 1175 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 480/483 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/483 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 38/521 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:08:53] [INFO ] Deduced a trap composed of 2 places in 194 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/521 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/521 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/523 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1661/2184 variables, 523/546 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2184 variables, 1175/1721 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2184 variables, 0/1721 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/2186 variables, 2/1723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2186 variables, 0/1723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/2186 variables, 0/1723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2186/2186 variables, and 1723 constraints, problems are : Problem set: 0 solved, 3 unsolved in 963 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 525/525 constraints, ReadFeed: 1175/1175 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 480/483 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/483 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:08:54] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 0 ms to minimize.
[2024-05-20 21:08:54] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-20 21:08:54] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-20 21:08:54] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-20 21:08:54] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-20 21:08:54] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-05-20 21:08:54] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-20 21:08:54] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-20 21:08:54] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-05-20 21:08:54] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-20 21:08:54] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-05-20 21:08:54] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2024-05-20 21:08:54] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-20 21:08:55] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-20 21:08:55] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-20 21:08:55] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-20 21:08:55] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/483 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 38/521 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/523 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:08:55] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 3 ms to minimize.
[2024-05-20 21:08:55] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 2 ms to minimize.
[2024-05-20 21:08:55] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 2 ms to minimize.
[2024-05-20 21:08:56] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 3 ms to minimize.
[2024-05-20 21:08:56] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 2 ms to minimize.
[2024-05-20 21:08:56] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 3 ms to minimize.
[2024-05-20 21:08:56] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 2 ms to minimize.
[2024-05-20 21:08:56] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 2 ms to minimize.
[2024-05-20 21:08:56] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 2 ms to minimize.
[2024-05-20 21:08:56] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:08:56] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2024-05-20 21:08:57] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-05-20 21:08:57] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:08:57] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-05-20 21:08:57] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-05-20 21:08:57] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-05-20 21:08:57] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:08:57] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-05-20 21:08:57] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:08:57] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/523 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:08:57] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-20 21:08:58] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:08:58] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:08:58] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:08:58] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:08:58] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:08:58] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:08:58] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 2 ms to minimize.
[2024-05-20 21:08:58] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:08:58] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:08:58] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/523 variables, 11/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/523 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1661/2184 variables, 523/594 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2184 variables, 1175/1769 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2184 variables, 3/1772 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2184 variables, 0/1772 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/2186 variables, 2/1774 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2186 variables, 0/1774 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2186/2186 variables, and 1774 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 525/525 constraints, ReadFeed: 1175/1175 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 49/49 constraints]
After SMT, in 5988ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 525 transition count 1660
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 524 transition count 1660
Partial Free-agglomeration rule applied 420 times.
Drop transitions (Partial Free agglomeration) removed 420 transitions
Iterating global reduction 1 with 420 rules applied. Total rules applied 422 place count 524 transition count 1660
Applied a total of 422 rules in 67 ms. Remains 524 /525 variables (removed 1) and now considering 1660/1661 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 524/525 places, 1660/1661 transitions.
RANDOM walk for 40000 steps (415 resets) in 974 ms. (41 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (15 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (17 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (16 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 305337 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :0 out of 3
Probabilistic random walk after 305337 steps, saw 42392 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
// Phase 1: matrix 1660 rows 524 cols
[2024-05-20 21:09:02] [INFO ] Computed 22 invariants in 20 ms
[2024-05-20 21:09:03] [INFO ] State equation strengthened by 1594 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 479/482 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 38/520 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1660/2182 variables, 522/544 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2182 variables, 1594/2138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2182 variables, 0/2138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/2184 variables, 2/2140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2184 variables, 0/2140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/2184 variables, 0/2140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2184/2184 variables, and 2140 constraints, problems are : Problem set: 0 solved, 3 unsolved in 757 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 524/524 constraints, ReadFeed: 1594/1594 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 479/482 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:09:03] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-20 21:09:03] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-05-20 21:09:04] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
[2024-05-20 21:09:04] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-05-20 21:09:04] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-20 21:09:04] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-05-20 21:09:04] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
[2024-05-20 21:09:04] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2024-05-20 21:09:04] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-20 21:09:04] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
[2024-05-20 21:09:04] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-20 21:09:04] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-20 21:09:04] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-20 21:09:04] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
[2024-05-20 21:09:04] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-05-20 21:09:04] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-20 21:09:04] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2024-05-20 21:09:04] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 38/520 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/522 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:09:05] [INFO ] Deduced a trap composed of 26 places in 209 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/522 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1660/2182 variables, 522/563 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2182 variables, 1594/2157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2182 variables, 3/2160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2182 variables, 0/2160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/2184 variables, 2/2162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2184 variables, 0/2162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/2184 variables, 0/2162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2184/2184 variables, and 2162 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2501 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 524/524 constraints, ReadFeed: 1594/1594 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 19/19 constraints]
After SMT, in 3304ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 134 ms.
Support contains 3 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 19 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 524/524 places, 1660/1660 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 19 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
[2024-05-20 21:09:06] [INFO ] Invariant cache hit.
[2024-05-20 21:09:06] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-20 21:09:06] [INFO ] Invariant cache hit.
[2024-05-20 21:09:07] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2024-05-20 21:09:10] [INFO ] Implicit Places using invariants and state equation in 3985 ms returned []
Implicit Place search using SMT with State Equation took 4329 ms to find 0 implicit places.
[2024-05-20 21:09:10] [INFO ] Redundant transitions in 23 ms returned []
Running 1640 sub problems to find dead transitions.
[2024-05-20 21:09:10] [INFO ] Invariant cache hit.
[2024-05-20 21:09:10] [INFO ] State equation strengthened by 1594 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-20 21:09:24] [INFO ] Deduced a trap composed of 2 places in 210 ms of which 3 ms to minimize.
[2024-05-20 21:09:24] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 3 ms to minimize.
[2024-05-20 21:09:24] [INFO ] Deduced a trap composed of 25 places in 189 ms of which 3 ms to minimize.
[2024-05-20 21:09:24] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 3 ms to minimize.
[2024-05-20 21:09:25] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 2 ms to minimize.
[2024-05-20 21:09:25] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-05-20 21:09:25] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 2 ms to minimize.
[2024-05-20 21:09:25] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 1 ms to minimize.
[2024-05-20 21:09:25] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:09:25] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 1 ms to minimize.
[2024-05-20 21:09:25] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-20 21:09:26] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:09:26] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 2 ms to minimize.
[2024-05-20 21:09:26] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:09:26] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
[2024-05-20 21:09:26] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 2 ms to minimize.
[2024-05-20 21:09:26] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:09:26] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-05-20 21:09:26] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-05-20 21:09:26] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/523 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-20 21:09:27] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 3 ms to minimize.
[2024-05-20 21:09:27] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 4 ms to minimize.
[2024-05-20 21:09:27] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 3 ms to minimize.
[2024-05-20 21:09:28] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 3 ms to minimize.
[2024-05-20 21:09:28] [INFO ] Deduced a trap composed of 33 places in 200 ms of which 3 ms to minimize.
[2024-05-20 21:09:28] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 2 ms to minimize.
[2024-05-20 21:09:28] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 2 ms to minimize.
[2024-05-20 21:09:28] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 3 ms to minimize.
[2024-05-20 21:09:29] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 3 ms to minimize.
[2024-05-20 21:09:29] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 3 ms to minimize.
[2024-05-20 21:09:29] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 2 ms to minimize.
[2024-05-20 21:09:29] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2024-05-20 21:09:29] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 1 ms to minimize.
[2024-05-20 21:09:29] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2024-05-20 21:09:29] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 1 ms to minimize.
[2024-05-20 21:09:29] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 1 ms to minimize.
[2024-05-20 21:09:30] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:09:30] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:09:30] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:09:30] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 523/2184 variables, and 62 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/524 constraints, ReadFeed: 0/1594 constraints, PredecessorRefiner: 1640/1640 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1640 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/523 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-20 21:09:42] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 2 ms to minimize.
[2024-05-20 21:09:42] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2024-05-20 21:09:43] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 1 ms to minimize.
[2024-05-20 21:09:43] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-05-20 21:09:43] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2024-05-20 21:09:43] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:09:43] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:09:43] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:09:43] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:09:43] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:09:43] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:09:43] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:09:43] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:09:44] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:09:44] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:09:44] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:09:44] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:09:44] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:09:44] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2024-05-20 21:09:44] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-20 21:09:44] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 3 ms to minimize.
[2024-05-20 21:09:45] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 3 ms to minimize.
[2024-05-20 21:09:45] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 2 ms to minimize.
[2024-05-20 21:09:45] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 3 ms to minimize.
[2024-05-20 21:09:45] [INFO ] Deduced a trap composed of 48 places in 150 ms of which 2 ms to minimize.
[2024-05-20 21:09:45] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 3 ms to minimize.
[2024-05-20 21:09:45] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 3 ms to minimize.
[2024-05-20 21:09:46] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 2 ms to minimize.
[2024-05-20 21:09:46] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 2 ms to minimize.
[2024-05-20 21:09:46] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 2 ms to minimize.
[2024-05-20 21:09:46] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 2 ms to minimize.
[2024-05-20 21:09:46] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 2 ms to minimize.
[2024-05-20 21:09:46] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 2 ms to minimize.
[2024-05-20 21:09:46] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-05-20 21:09:46] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 2 ms to minimize.
[2024-05-20 21:09:47] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-05-20 21:09:47] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 2 ms to minimize.
[2024-05-20 21:09:47] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-05-20 21:09:47] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-05-20 21:09:47] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/523 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-20 21:09:48] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 3 ms to minimize.
[2024-05-20 21:09:48] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 2 ms to minimize.
[2024-05-20 21:09:48] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 2 ms to minimize.
[2024-05-20 21:09:48] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 2 ms to minimize.
[2024-05-20 21:09:48] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 2 ms to minimize.
[2024-05-20 21:09:48] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 2 ms to minimize.
[2024-05-20 21:09:48] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 2 ms to minimize.
[2024-05-20 21:09:48] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 2 ms to minimize.
[2024-05-20 21:09:49] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:09:49] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2024-05-20 21:09:49] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2024-05-20 21:09:49] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-05-20 21:09:49] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
[2024-05-20 21:09:49] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:09:49] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:09:49] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:09:49] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:09:49] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:09:49] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-05-20 21:09:50] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/523 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-20 21:09:50] [INFO ] Deduced a trap composed of 29 places in 172 ms of which 3 ms to minimize.
[2024-05-20 21:09:50] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 3 ms to minimize.
[2024-05-20 21:09:50] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 3 ms to minimize.
[2024-05-20 21:09:51] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 2 ms to minimize.
[2024-05-20 21:09:51] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 3 ms to minimize.
[2024-05-20 21:09:51] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 2 ms to minimize.
[2024-05-20 21:09:51] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 2 ms to minimize.
[2024-05-20 21:09:51] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 2 ms to minimize.
[2024-05-20 21:09:51] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 3 ms to minimize.
[2024-05-20 21:09:52] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 3 ms to minimize.
[2024-05-20 21:09:52] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 3 ms to minimize.
[2024-05-20 21:09:52] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 2 ms to minimize.
[2024-05-20 21:09:52] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 2 ms to minimize.
[2024-05-20 21:09:52] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-20 21:09:52] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-05-20 21:09:52] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-20 21:09:52] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 2 ms to minimize.
[2024-05-20 21:09:53] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2024-05-20 21:09:53] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 2 ms to minimize.
[2024-05-20 21:09:53] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-20 21:09:53] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 2 ms to minimize.
[2024-05-20 21:09:53] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 2 ms to minimize.
[2024-05-20 21:09:54] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-05-20 21:09:54] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-05-20 21:09:54] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-05-20 21:09:54] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
[2024-05-20 21:09:54] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:09:54] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:09:54] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:09:54] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:09:54] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-05-20 21:09:55] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:09:55] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:09:55] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2024-05-20 21:09:55] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:09:55] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-05-20 21:09:55] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:09:55] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-20 21:09:55] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:09:55] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 523/2184 variables, and 162 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/524 constraints, ReadFeed: 0/1594 constraints, PredecessorRefiner: 0/1640 constraints, Known Traps: 140/140 constraints]
After SMT, in 60668ms problems are : Problem set: 0 solved, 1640 unsolved
Search for dead transitions found 0 dead transitions in 60681ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65066 ms. Remains : 524/524 places, 1660/1660 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1529 edges and 524 vertex of which 437 / 524 are part of one of the 2 SCC in 0 ms
Free SCC test removed 435 places
Drop transitions (Empty/Sink Transition effects.) removed 1153 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 1562 transitions.
Graph (complete) has 220 edges and 89 vertex of which 28 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 28 transition count 38
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 9 transition count 19
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 9 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 8 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 8 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 8 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 89 place count 7 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 6 transition count 12
Applied a total of 90 rules in 6 ms. Remains 6 /524 variables (removed 518) and now considering 12/1660 (removed 1648) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 12 rows 6 cols
[2024-05-20 21:10:11] [INFO ] Computed 0 invariants in 1 ms
[2024-05-20 21:10:11] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 21:10:11] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-20 21:10:11] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-20 21:10:11] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 71 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 122 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 525 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 20 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
// Phase 1: matrix 1661 rows 525 cols
[2024-05-20 21:10:11] [INFO ] Computed 22 invariants in 20 ms
[2024-05-20 21:10:12] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-20 21:10:12] [INFO ] Invariant cache hit.
[2024-05-20 21:10:12] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2024-05-20 21:10:13] [INFO ] Implicit Places using invariants and state equation in 1791 ms returned []
Implicit Place search using SMT with State Equation took 2031 ms to find 0 implicit places.
[2024-05-20 21:10:13] [INFO ] Redundant transitions in 24 ms returned []
Running 1641 sub problems to find dead transitions.
[2024-05-20 21:10:13] [INFO ] Invariant cache hit.
[2024-05-20 21:10:13] [INFO ] State equation strengthened by 1175 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/524 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/524 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:10:27] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:10:27] [INFO ] Deduced a trap composed of 2 places in 203 ms of which 3 ms to minimize.
[2024-05-20 21:10:27] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:10:27] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:10:27] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-05-20 21:10:28] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:10:28] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:10:28] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:10:28] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-20 21:10:28] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:10:28] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:10:28] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:10:28] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:10:28] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:10:28] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:10:28] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:10:28] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:10:28] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:10:29] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:10:29] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/524 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:10:29] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:10:29] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-20 21:10:29] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:10:29] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:10:29] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:10:32] [INFO ] Deduced a trap composed of 30 places in 196 ms of which 3 ms to minimize.
[2024-05-20 21:10:33] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 3 ms to minimize.
[2024-05-20 21:10:33] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 3 ms to minimize.
[2024-05-20 21:10:33] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 3 ms to minimize.
[2024-05-20 21:10:33] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 4 ms to minimize.
[2024-05-20 21:10:34] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 3 ms to minimize.
[2024-05-20 21:10:34] [INFO ] Deduced a trap composed of 27 places in 203 ms of which 3 ms to minimize.
[2024-05-20 21:10:34] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 3 ms to minimize.
[2024-05-20 21:10:34] [INFO ] Deduced a trap composed of 31 places in 204 ms of which 3 ms to minimize.
[2024-05-20 21:10:34] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 3 ms to minimize.
[2024-05-20 21:10:35] [INFO ] Deduced a trap composed of 28 places in 210 ms of which 3 ms to minimize.
[2024-05-20 21:10:35] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 3 ms to minimize.
[2024-05-20 21:10:35] [INFO ] Deduced a trap composed of 27 places in 206 ms of which 3 ms to minimize.
[2024-05-20 21:10:35] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 3 ms to minimize.
[2024-05-20 21:10:35] [INFO ] Deduced a trap composed of 28 places in 202 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/524 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 524/2186 variables, and 62 constraints, problems are : Problem set: 0 solved, 1641 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/525 constraints, ReadFeed: 0/1175 constraints, PredecessorRefiner: 1641/1641 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1641 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/524 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/524 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/524 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:10:45] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2024-05-20 21:10:46] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2024-05-20 21:10:46] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-05-20 21:10:46] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2024-05-20 21:10:46] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:10:46] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:10:46] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:10:46] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:10:46] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:10:46] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:10:46] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:10:46] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:10:47] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-05-20 21:10:47] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:10:47] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:10:47] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:10:47] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:10:47] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2024-05-20 21:10:47] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2024-05-20 21:10:47] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/524 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:10:47] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:10:48] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2024-05-20 21:10:48] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-20 21:10:48] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-20 21:10:48] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:10:48] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:10:48] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:10:48] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:10:48] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:10:48] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:10:48] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2024-05-20 21:10:48] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-20 21:10:49] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:10:49] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:10:49] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:10:49] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 3 ms to minimize.
[2024-05-20 21:10:49] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 2 ms to minimize.
[2024-05-20 21:10:49] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 3 ms to minimize.
[2024-05-20 21:10:49] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-05-20 21:10:50] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:10:50] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2024-05-20 21:10:50] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:10:50] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:10:50] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-20 21:10:50] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:10:51] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:10:51] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:10:51] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:10:51] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:10:51] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:10:51] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:10:51] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 2 ms to minimize.
[2024-05-20 21:10:51] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 2 ms to minimize.
[2024-05-20 21:10:51] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2024-05-20 21:10:51] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2024-05-20 21:10:52] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 1 ms to minimize.
[2024-05-20 21:10:52] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 2 ms to minimize.
[2024-05-20 21:10:52] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:10:52] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2024-05-20 21:10:52] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:10:53] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:10:53] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:10:53] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:10:53] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-05-20 21:10:53] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:10:53] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:10:53] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:10:53] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:10:53] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:10:53] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:10:53] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-20 21:10:53] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:10:53] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-20 21:10:53] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:10:53] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:10:54] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2024-05-20 21:10:54] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:10:54] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:10:54] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:10:54] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:10:54] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:10:55] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:10:55] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:10:55] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:10:55] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-20 21:10:55] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:10:55] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-20 21:10:55] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-20 21:10:55] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-20 21:10:55] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-20 21:10:55] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:10:55] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-20 21:10:57] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 3 ms to minimize.
[2024-05-20 21:10:57] [INFO ] Deduced a trap composed of 28 places in 201 ms of which 2 ms to minimize.
[2024-05-20 21:10:57] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 3 ms to minimize.
[2024-05-20 21:11:04] [INFO ] Deduced a trap composed of 30 places in 186 ms of which 3 ms to minimize.
[2024-05-20 21:11:06] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 2 ms to minimize.
[2024-05-20 21:11:06] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
[2024-05-20 21:11:07] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2024-05-20 21:11:07] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:11:07] [INFO ] Deduced a trap composed of 3 places in 194 ms of which 3 ms to minimize.
[2024-05-20 21:11:08] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 3 ms to minimize.
[2024-05-20 21:11:08] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 3 ms to minimize.
[2024-05-20 21:11:08] [INFO ] Deduced a trap composed of 22 places in 184 ms of which 3 ms to minimize.
[2024-05-20 21:11:08] [INFO ] Deduced a trap composed of 2 places in 189 ms of which 3 ms to minimize.
[2024-05-20 21:11:08] [INFO ] Deduced a trap composed of 2 places in 188 ms of which 3 ms to minimize.
[2024-05-20 21:11:09] [INFO ] Deduced a trap composed of 3 places in 194 ms of which 3 ms to minimize.
[2024-05-20 21:11:09] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 3 ms to minimize.
[2024-05-20 21:11:09] [INFO ] Deduced a trap composed of 3 places in 196 ms of which 3 ms to minimize.
[2024-05-20 21:11:09] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 2 ms to minimize.
[2024-05-20 21:11:09] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 2 ms to minimize.
[2024-05-20 21:11:10] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-05-20 21:11:10] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:11:10] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-20 21:11:10] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:11:10] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:11:10] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:11:10] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:11:10] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:11:10] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:11:11] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:11:11] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:11:11] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:11:11] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-20 21:11:11] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:11:11] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:11:11] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:11:11] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 524/2186 variables, and 190 constraints, problems are : Problem set: 0 solved, 1641 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/525 constraints, ReadFeed: 0/1175 constraints, PredecessorRefiner: 0/1641 constraints, Known Traps: 168/168 constraints]
After SMT, in 60526ms problems are : Problem set: 0 solved, 1641 unsolved
Search for dead transitions found 0 dead transitions in 60539ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62625 ms. Remains : 525/525 places, 1661/1661 transitions.
Computed a total of 63 stabilizing places and 100 stable transitions
Computed a total of 63 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 104 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (384 resets) in 516 ms. (77 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (16 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (17 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (18 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
[2024-05-20 21:11:14] [INFO ] Invariant cache hit.
[2024-05-20 21:11:14] [INFO ] State equation strengthened by 1175 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 480/483 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/483 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 38/521 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:11:15] [INFO ] Deduced a trap composed of 2 places in 213 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/521 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/521 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/523 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1661/2184 variables, 523/546 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2184 variables, 1175/1721 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2184 variables, 0/1721 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/2186 variables, 2/1723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2186 variables, 0/1723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/2186 variables, 0/1723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2186/2186 variables, and 1723 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1013 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 525/525 constraints, ReadFeed: 1175/1175 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 480/483 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/483 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:11:16] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 0 ms to minimize.
[2024-05-20 21:11:16] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-20 21:11:16] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-05-20 21:11:16] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-05-20 21:11:16] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
[2024-05-20 21:11:16] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-20 21:11:16] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
[2024-05-20 21:11:16] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-20 21:11:16] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-20 21:11:16] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2024-05-20 21:11:16] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
[2024-05-20 21:11:16] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
[2024-05-20 21:11:16] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2024-05-20 21:11:16] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-05-20 21:11:16] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-20 21:11:16] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-20 21:11:16] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/483 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 38/521 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/523 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:11:16] [INFO ] Deduced a trap composed of 27 places in 216 ms of which 3 ms to minimize.
[2024-05-20 21:11:17] [INFO ] Deduced a trap composed of 28 places in 200 ms of which 3 ms to minimize.
[2024-05-20 21:11:17] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 3 ms to minimize.
[2024-05-20 21:11:17] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 3 ms to minimize.
[2024-05-20 21:11:17] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 2 ms to minimize.
[2024-05-20 21:11:17] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 6 ms to minimize.
[2024-05-20 21:11:18] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 2 ms to minimize.
[2024-05-20 21:11:18] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 2 ms to minimize.
[2024-05-20 21:11:18] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 2 ms to minimize.
[2024-05-20 21:11:18] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 2 ms to minimize.
[2024-05-20 21:11:18] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 2 ms to minimize.
[2024-05-20 21:11:18] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
[2024-05-20 21:11:18] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 2 ms to minimize.
[2024-05-20 21:11:19] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-05-20 21:11:19] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-05-20 21:11:19] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 1 ms to minimize.
[2024-05-20 21:11:19] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
[2024-05-20 21:11:19] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2024-05-20 21:11:19] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 1 ms to minimize.
[2024-05-20 21:11:19] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/523 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:11:19] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-20 21:11:19] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:11:20] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:11:20] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2024-05-20 21:11:20] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:11:20] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:11:20] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:11:20] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:11:20] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:11:20] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:11:20] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/523 variables, 11/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/523 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1661/2184 variables, 523/594 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2184/2186 variables, and 1769 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/525 constraints, ReadFeed: 1175/1175 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 49/49 constraints]
After SMT, in 6042ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 525 transition count 1660
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 524 transition count 1660
Partial Free-agglomeration rule applied 420 times.
Drop transitions (Partial Free agglomeration) removed 420 transitions
Iterating global reduction 1 with 420 rules applied. Total rules applied 422 place count 524 transition count 1660
Applied a total of 422 rules in 66 ms. Remains 524 /525 variables (removed 1) and now considering 1660/1661 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 524/525 places, 1660/1661 transitions.
RANDOM walk for 40000 steps (425 resets) in 736 ms. (54 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (16 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (16 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (18 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 324902 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 3
Probabilistic random walk after 324902 steps, saw 44652 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
// Phase 1: matrix 1660 rows 524 cols
[2024-05-20 21:11:24] [INFO ] Computed 22 invariants in 22 ms
[2024-05-20 21:11:24] [INFO ] State equation strengthened by 1594 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 479/482 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 38/520 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1660/2182 variables, 522/544 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2182 variables, 1594/2138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2182 variables, 0/2138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/2184 variables, 2/2140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2184 variables, 0/2140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/2184 variables, 0/2140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2184/2184 variables, and 2140 constraints, problems are : Problem set: 0 solved, 3 unsolved in 834 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 524/524 constraints, ReadFeed: 1594/1594 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 479/482 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:11:25] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-05-20 21:11:25] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-20 21:11:25] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 0 ms to minimize.
[2024-05-20 21:11:25] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-20 21:11:25] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-20 21:11:25] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-20 21:11:25] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-20 21:11:25] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-20 21:11:25] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
[2024-05-20 21:11:25] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-20 21:11:25] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-20 21:11:25] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-20 21:11:25] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-05-20 21:11:25] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-20 21:11:25] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-20 21:11:25] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-20 21:11:25] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-20 21:11:26] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 38/520 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/522 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:11:26] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/522 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1660/2182 variables, 522/563 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2182 variables, 1594/2157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2182 variables, 3/2160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2182 variables, 0/2160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/2184 variables, 2/2162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2184 variables, 0/2162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/2184 variables, 0/2162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2184/2184 variables, and 2162 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2187 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 524/524 constraints, ReadFeed: 1594/1594 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 19/19 constraints]
After SMT, in 3068ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 67 ms.
Support contains 3 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 19 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 524/524 places, 1660/1660 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 19 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
[2024-05-20 21:11:27] [INFO ] Invariant cache hit.
[2024-05-20 21:11:27] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-20 21:11:27] [INFO ] Invariant cache hit.
[2024-05-20 21:11:28] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2024-05-20 21:11:32] [INFO ] Implicit Places using invariants and state equation in 4125 ms returned []
Implicit Place search using SMT with State Equation took 4464 ms to find 0 implicit places.
[2024-05-20 21:11:32] [INFO ] Redundant transitions in 26 ms returned []
Running 1640 sub problems to find dead transitions.
[2024-05-20 21:11:32] [INFO ] Invariant cache hit.
[2024-05-20 21:11:32] [INFO ] State equation strengthened by 1594 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-20 21:11:45] [INFO ] Deduced a trap composed of 2 places in 229 ms of which 3 ms to minimize.
[2024-05-20 21:11:45] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 3 ms to minimize.
[2024-05-20 21:11:46] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 2 ms to minimize.
[2024-05-20 21:11:46] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 3 ms to minimize.
[2024-05-20 21:11:46] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 2 ms to minimize.
[2024-05-20 21:11:46] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 1 ms to minimize.
[2024-05-20 21:11:46] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 2 ms to minimize.
[2024-05-20 21:11:46] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-05-20 21:11:47] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-05-20 21:11:47] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 1 ms to minimize.
[2024-05-20 21:11:47] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 2 ms to minimize.
[2024-05-20 21:11:47] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 2 ms to minimize.
[2024-05-20 21:11:47] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
[2024-05-20 21:11:47] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:11:47] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 2 ms to minimize.
[2024-05-20 21:11:48] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 2 ms to minimize.
[2024-05-20 21:11:48] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2024-05-20 21:11:48] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2024-05-20 21:11:48] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-05-20 21:11:48] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/523 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-20 21:11:49] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 2 ms to minimize.
[2024-05-20 21:11:49] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 3 ms to minimize.
[2024-05-20 21:11:49] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 3 ms to minimize.
[2024-05-20 21:11:49] [INFO ] Deduced a trap composed of 31 places in 208 ms of which 3 ms to minimize.
[2024-05-20 21:11:49] [INFO ] Deduced a trap composed of 33 places in 212 ms of which 3 ms to minimize.
[2024-05-20 21:11:50] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 3 ms to minimize.
[2024-05-20 21:11:50] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 3 ms to minimize.
[2024-05-20 21:11:50] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 3 ms to minimize.
[2024-05-20 21:11:50] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 2 ms to minimize.
[2024-05-20 21:11:50] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 2 ms to minimize.
[2024-05-20 21:11:51] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 2 ms to minimize.
[2024-05-20 21:11:51] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 3 ms to minimize.
[2024-05-20 21:11:51] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2024-05-20 21:11:51] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 1 ms to minimize.
[2024-05-20 21:11:51] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 2 ms to minimize.
[2024-05-20 21:11:51] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-05-20 21:11:51] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-05-20 21:11:51] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2024-05-20 21:11:51] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:11:52] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 523/2184 variables, and 62 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/524 constraints, ReadFeed: 0/1594 constraints, PredecessorRefiner: 1640/1640 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1640 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/523 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-20 21:12:04] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 2 ms to minimize.
[2024-05-20 21:12:04] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-20 21:12:04] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2024-05-20 21:12:04] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2024-05-20 21:12:04] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-05-20 21:12:04] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-20 21:12:04] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-05-20 21:12:04] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:12:04] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-05-20 21:12:05] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:12:05] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:12:05] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:12:05] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:12:05] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:12:05] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:12:05] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:12:05] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:12:05] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-05-20 21:12:05] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:12:05] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-20 21:12:06] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 3 ms to minimize.
[2024-05-20 21:12:06] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 2 ms to minimize.
[2024-05-20 21:12:06] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 3 ms to minimize.
[2024-05-20 21:12:06] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 2 ms to minimize.
[2024-05-20 21:12:06] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 3 ms to minimize.
[2024-05-20 21:12:06] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 2 ms to minimize.
[2024-05-20 21:12:07] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 3 ms to minimize.
[2024-05-20 21:12:07] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 2 ms to minimize.
[2024-05-20 21:12:07] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 2 ms to minimize.
[2024-05-20 21:12:07] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 2 ms to minimize.
[2024-05-20 21:12:07] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 3 ms to minimize.
[2024-05-20 21:12:07] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 2 ms to minimize.
[2024-05-20 21:12:08] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 2 ms to minimize.
[2024-05-20 21:12:08] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2024-05-20 21:12:08] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:12:08] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:12:08] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2024-05-20 21:12:08] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2024-05-20 21:12:08] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:12:08] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/523 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-20 21:12:09] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 2 ms to minimize.
[2024-05-20 21:12:09] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 2 ms to minimize.
[2024-05-20 21:12:09] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 3 ms to minimize.
[2024-05-20 21:12:09] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 2 ms to minimize.
[2024-05-20 21:12:09] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:12:09] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:12:10] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-05-20 21:12:10] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-20 21:12:10] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 1 ms to minimize.
[2024-05-20 21:12:10] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2024-05-20 21:12:10] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-05-20 21:12:10] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 1 ms to minimize.
[2024-05-20 21:12:10] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:12:10] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:12:10] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:12:10] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:12:10] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:12:11] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-05-20 21:12:11] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:12:11] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/523 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-20 21:12:11] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 2 ms to minimize.
[2024-05-20 21:12:11] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 2 ms to minimize.
[2024-05-20 21:12:12] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 3 ms to minimize.
[2024-05-20 21:12:12] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 2 ms to minimize.
[2024-05-20 21:12:12] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 3 ms to minimize.
[2024-05-20 21:12:12] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 3 ms to minimize.
[2024-05-20 21:12:12] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 2 ms to minimize.
[2024-05-20 21:12:13] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 2 ms to minimize.
[2024-05-20 21:12:13] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 2 ms to minimize.
[2024-05-20 21:12:13] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 2 ms to minimize.
[2024-05-20 21:12:13] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 2 ms to minimize.
[2024-05-20 21:12:13] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 2 ms to minimize.
[2024-05-20 21:12:13] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 2 ms to minimize.
[2024-05-20 21:12:13] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-20 21:12:13] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-20 21:12:13] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-20 21:12:14] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 2 ms to minimize.
[2024-05-20 21:12:14] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 2 ms to minimize.
[2024-05-20 21:12:14] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 2 ms to minimize.
[2024-05-20 21:12:14] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-20 21:12:14] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 2 ms to minimize.
[2024-05-20 21:12:15] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 2 ms to minimize.
[2024-05-20 21:12:15] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-05-20 21:12:15] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-20 21:12:15] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:12:15] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2024-05-20 21:12:15] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 1 ms to minimize.
[2024-05-20 21:12:15] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2024-05-20 21:12:15] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-20 21:12:16] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:12:16] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-20 21:12:16] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:12:16] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-20 21:12:16] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-05-20 21:12:16] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:12:16] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:12:16] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:12:16] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-20 21:12:16] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:12:16] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 523/2184 variables, and 162 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/524 constraints, ReadFeed: 0/1594 constraints, PredecessorRefiner: 0/1640 constraints, Known Traps: 140/140 constraints]
After SMT, in 60686ms problems are : Problem set: 0 solved, 1640 unsolved
Search for dead transitions found 0 dead transitions in 60699ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65221 ms. Remains : 524/524 places, 1660/1660 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1529 edges and 524 vertex of which 437 / 524 are part of one of the 2 SCC in 1 ms
Free SCC test removed 435 places
Drop transitions (Empty/Sink Transition effects.) removed 1153 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 1562 transitions.
Graph (complete) has 220 edges and 89 vertex of which 28 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 28 transition count 38
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 9 transition count 19
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 9 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 8 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 8 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 8 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 89 place count 7 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 6 transition count 12
Applied a total of 90 rules in 5 ms. Remains 6 /524 variables (removed 518) and now considering 12/1660 (removed 1648) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 12 rows 6 cols
[2024-05-20 21:12:32] [INFO ] Computed 0 invariants in 1 ms
[2024-05-20 21:12:32] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 21:12:32] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-20 21:12:32] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-20 21:12:32] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 61 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 129 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 964 reset in 400 ms.
Product exploration explored 100000 steps with 962 reset in 424 ms.
Built C files in :
/tmp/ltsmin14272884836466326960
[2024-05-20 21:12:34] [INFO ] Too many transitions (1661) to apply POR reductions. Disabling POR matrices.
[2024-05-20 21:12:34] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14272884836466326960
Running compilation step : cd /tmp/ltsmin14272884836466326960;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14272884836466326960;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14272884836466326960;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 3 out of 525 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 25 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
// Phase 1: matrix 1661 rows 525 cols
[2024-05-20 21:12:37] [INFO ] Computed 22 invariants in 10 ms
[2024-05-20 21:12:37] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-20 21:12:37] [INFO ] Invariant cache hit.
[2024-05-20 21:12:37] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2024-05-20 21:12:39] [INFO ] Implicit Places using invariants and state equation in 1750 ms returned []
Implicit Place search using SMT with State Equation took 1979 ms to find 0 implicit places.
[2024-05-20 21:12:39] [INFO ] Redundant transitions in 26 ms returned []
Running 1641 sub problems to find dead transitions.
[2024-05-20 21:12:39] [INFO ] Invariant cache hit.
[2024-05-20 21:12:39] [INFO ] State equation strengthened by 1175 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/524 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/524 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:12:52] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 4 ms to minimize.
[2024-05-20 21:12:53] [INFO ] Deduced a trap composed of 2 places in 192 ms of which 3 ms to minimize.
[2024-05-20 21:12:53] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:12:53] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:12:53] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 4 ms to minimize.
[2024-05-20 21:12:53] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:12:53] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 2 ms to minimize.
[2024-05-20 21:12:53] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:12:53] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-20 21:12:53] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:12:53] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:12:53] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:12:53] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:12:53] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:12:54] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:12:54] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:12:54] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:12:54] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:12:54] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 2 ms to minimize.
[2024-05-20 21:12:54] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/524 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:12:54] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:12:54] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-05-20 21:12:54] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-20 21:12:55] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2024-05-20 21:12:55] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-20 21:12:57] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 3 ms to minimize.
[2024-05-20 21:12:58] [INFO ] Deduced a trap composed of 27 places in 219 ms of which 3 ms to minimize.
[2024-05-20 21:12:58] [INFO ] Deduced a trap composed of 26 places in 211 ms of which 3 ms to minimize.
[2024-05-20 21:12:58] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 3 ms to minimize.
[2024-05-20 21:12:59] [INFO ] Deduced a trap composed of 28 places in 223 ms of which 3 ms to minimize.
[2024-05-20 21:12:59] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 3 ms to minimize.
[2024-05-20 21:12:59] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 3 ms to minimize.
[2024-05-20 21:12:59] [INFO ] Deduced a trap composed of 36 places in 193 ms of which 3 ms to minimize.
[2024-05-20 21:12:59] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 3 ms to minimize.
[2024-05-20 21:13:00] [INFO ] Deduced a trap composed of 32 places in 194 ms of which 3 ms to minimize.
[2024-05-20 21:13:00] [INFO ] Deduced a trap composed of 28 places in 186 ms of which 3 ms to minimize.
[2024-05-20 21:13:00] [INFO ] Deduced a trap composed of 27 places in 196 ms of which 3 ms to minimize.
[2024-05-20 21:13:00] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 3 ms to minimize.
[2024-05-20 21:13:00] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 3 ms to minimize.
[2024-05-20 21:13:01] [INFO ] Deduced a trap composed of 28 places in 191 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
At refinement iteration 3 (INCLUDED_ONLY) 0/524 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 524/2186 variables, and 62 constraints, problems are : Problem set: 0 solved, 1641 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/525 constraints, ReadFeed: 0/1175 constraints, PredecessorRefiner: 1641/1641 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1641 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/524 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/524 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/524 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:13:10] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-20 21:13:11] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-05-20 21:13:11] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:13:11] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2024-05-20 21:13:11] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
[2024-05-20 21:13:11] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-20 21:13:11] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-20 21:13:11] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:13:11] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:13:11] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:13:11] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:13:11] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:13:11] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:13:12] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:13:12] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:13:12] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:13:12] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:13:12] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:13:12] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:13:12] [INFO ] Deduced a trap composed of 34 places in 156 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/524 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:13:12] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-20 21:13:13] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-20 21:13:13] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-05-20 21:13:13] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-20 21:13:13] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-20 21:13:13] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:13:13] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:13:13] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-20 21:13:13] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:13:13] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-20 21:13:13] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:13:13] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:13:13] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2024-05-20 21:13:13] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:13:14] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2024-05-20 21:13:14] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 2 ms to minimize.
[2024-05-20 21:13:14] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 2 ms to minimize.
[2024-05-20 21:13:14] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 2 ms to minimize.
[2024-05-20 21:13:14] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-20 21:13:14] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:13:15] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-05-20 21:13:15] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-05-20 21:13:15] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:13:15] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:13:15] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-05-20 21:13:15] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:13:15] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-05-20 21:13:16] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:13:16] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2024-05-20 21:13:16] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:13:16] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:13:16] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 2 ms to minimize.
[2024-05-20 21:13:16] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:13:16] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:13:16] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 2 ms to minimize.
[2024-05-20 21:13:16] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-05-20 21:13:16] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 1 ms to minimize.
[2024-05-20 21:13:17] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:13:17] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2024-05-20 21:13:17] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:13:17] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 4 ms to minimize.
[2024-05-20 21:13:17] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:13:18] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
[2024-05-20 21:13:18] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:13:18] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:13:18] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:13:18] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:13:18] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:13:18] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:13:18] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:13:18] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:13:18] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:13:18] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:13:18] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:13:18] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:13:18] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:13:18] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2024-05-20 21:13:19] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:13:19] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:13:19] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:13:19] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:13:19] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:13:19] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 0 ms to minimize.
[2024-05-20 21:13:20] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:13:20] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-20 21:13:20] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-05-20 21:13:20] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:13:20] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
[2024-05-20 21:13:20] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-20 21:13:20] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-20 21:13:20] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-20 21:13:20] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-20 21:13:21] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 3 ms to minimize.
[2024-05-20 21:13:22] [INFO ] Deduced a trap composed of 28 places in 187 ms of which 2 ms to minimize.
[2024-05-20 21:13:22] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 3 ms to minimize.
[2024-05-20 21:13:29] [INFO ] Deduced a trap composed of 30 places in 188 ms of which 3 ms to minimize.
[2024-05-20 21:13:31] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:13:31] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 1 ms to minimize.
[2024-05-20 21:13:31] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-20 21:13:31] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:13:32] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 2 ms to minimize.
[2024-05-20 21:13:32] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 2 ms to minimize.
[2024-05-20 21:13:32] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 3 ms to minimize.
[2024-05-20 21:13:33] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 3 ms to minimize.
[2024-05-20 21:13:33] [INFO ] Deduced a trap composed of 2 places in 188 ms of which 3 ms to minimize.
[2024-05-20 21:13:33] [INFO ] Deduced a trap composed of 2 places in 189 ms of which 3 ms to minimize.
[2024-05-20 21:13:33] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 3 ms to minimize.
[2024-05-20 21:13:33] [INFO ] Deduced a trap composed of 3 places in 188 ms of which 3 ms to minimize.
[2024-05-20 21:13:34] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 2 ms to minimize.
[2024-05-20 21:13:34] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 3 ms to minimize.
[2024-05-20 21:13:34] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 3 ms to minimize.
[2024-05-20 21:13:34] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:13:34] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:13:34] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:13:34] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:13:34] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:13:34] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:13:35] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-20 21:13:35] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
[2024-05-20 21:13:35] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:13:36] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:13:36] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:13:36] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:13:36] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 3 ms to minimize.
[2024-05-20 21:13:36] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:13:36] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:13:36] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2024-05-20 21:13:36] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 524/2186 variables, and 190 constraints, problems are : Problem set: 0 solved, 1641 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/525 constraints, ReadFeed: 0/1175 constraints, PredecessorRefiner: 0/1641 constraints, Known Traps: 168/168 constraints]
After SMT, in 60513ms problems are : Problem set: 0 solved, 1641 unsolved
Search for dead transitions found 0 dead transitions in 60526ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62568 ms. Remains : 525/525 places, 1661/1661 transitions.
Built C files in :
/tmp/ltsmin4624459612966542336
[2024-05-20 21:13:39] [INFO ] Too many transitions (1661) to apply POR reductions. Disabling POR matrices.
[2024-05-20 21:13:39] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4624459612966542336
Running compilation step : cd /tmp/ltsmin4624459612966542336;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4624459612966542336;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4624459612966542336;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-20 21:13:42] [INFO ] Flatten gal took : 32 ms
[2024-05-20 21:13:42] [INFO ] Flatten gal took : 30 ms
[2024-05-20 21:13:42] [INFO ] Time to serialize gal into /tmp/LTL8489844218199848546.gal : 6 ms
[2024-05-20 21:13:42] [INFO ] Time to serialize properties into /tmp/LTL16995692213679223515.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8489844218199848546.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4505362900676212626.hoa' '-atoms' '/tmp/LTL16995692213679223515.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16995692213679223515.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4505362900676212626.hoa
Detected timeout of ITS tools.
[2024-05-20 21:13:57] [INFO ] Flatten gal took : 29 ms
[2024-05-20 21:13:57] [INFO ] Flatten gal took : 29 ms
[2024-05-20 21:13:57] [INFO ] Time to serialize gal into /tmp/LTL8028126336867384877.gal : 6 ms
[2024-05-20 21:13:57] [INFO ] Time to serialize properties into /tmp/LTL12181291359139024378.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8028126336867384877.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12181291359139024378.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(Node1requestsent2>Node2GiveAnswer12)"))||(G(F("(Node19GiveAnswer12<2)"))))))
Formula 0 simplified : G(F!"(Node1requestsent2>Node2GiveAnswer12)" & FG!"(Node19GiveAnswer12<2)")
Detected timeout of ITS tools.
[2024-05-20 21:14:13] [INFO ] Flatten gal took : 29 ms
[2024-05-20 21:14:13] [INFO ] Applying decomposition
[2024-05-20 21:14:13] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5166163547422124465.txt' '-o' '/tmp/graph5166163547422124465.bin' '-w' '/tmp/graph5166163547422124465.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5166163547422124465.bin' '-l' '-1' '-v' '-w' '/tmp/graph5166163547422124465.weights' '-q' '0' '-e' '0.001'
[2024-05-20 21:14:13] [INFO ] Decomposing Gal with order
[2024-05-20 21:14:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 21:14:13] [INFO ] Removed a total of 1200 redundant transitions.
[2024-05-20 21:14:13] [INFO ] Flatten gal took : 103 ms
[2024-05-20 21:14:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 761 labels/synchronizations in 39 ms.
[2024-05-20 21:14:13] [INFO ] Time to serialize gal into /tmp/LTL14784414713683730643.gal : 9 ms
[2024-05-20 21:14:13] [INFO ] Time to serialize properties into /tmp/LTL7030891654863806317.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14784414713683730643.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7030891654863806317.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(gu21.Node1requestsent2>gu21.Node2GiveAnswer12)"))||(G(F("(gi0.gu13.Node19GiveAnswer12<2)"))))))
Formula 0 simplified : G(F!"(gu21.Node1requestsent2>gu21.Node2GiveAnswer12)" & FG!"(gi0.gu13.Node19GiveAnswer12<2)")
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-04 finished in 399014 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(G((p0||X(p1))))&&G(p2)))))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 21 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2024-05-20 21:14:28] [INFO ] Computed 22 invariants in 41 ms
[2024-05-20 21:14:28] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-05-20 21:14:28] [INFO ] Invariant cache hit.
[2024-05-20 21:14:29] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 21:14:32] [INFO ] Implicit Places using invariants and state equation in 3272 ms returned []
Implicit Place search using SMT with State Equation took 3643 ms to find 0 implicit places.
Running 2500 sub problems to find dead transitions.
[2024-05-20 21:14:32] [INFO ] Invariant cache hit.
[2024-05-20 21:14:32] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
SMT process timed out in 30774ms, After SMT, problems are : Problem set: 0 solved, 2500 unsolved
Search for dead transitions found 0 dead transitions in 30796ms
Finished structural reductions in LTL mode , in 1 iterations and 34469 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-05 finished in 34733 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 4 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 1043 transition count 2384
Reduce places removed 136 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 137 rules applied. Total rules applied 273 place count 907 transition count 2383
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 274 place count 906 transition count 2383
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 1 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 3 with 758 rules applied. Total rules applied 1032 place count 527 transition count 2004
Drop transitions (Redundant composition of simpler transitions.) removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 3 with 341 rules applied. Total rules applied 1373 place count 527 transition count 1663
Applied a total of 1373 rules in 90 ms. Remains 527 /1043 variables (removed 516) and now considering 1663/2520 (removed 857) transitions.
// Phase 1: matrix 1663 rows 527 cols
[2024-05-20 21:15:03] [INFO ] Computed 22 invariants in 10 ms
[2024-05-20 21:15:03] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-20 21:15:03] [INFO ] Invariant cache hit.
[2024-05-20 21:15:03] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 21:15:05] [INFO ] Implicit Places using invariants and state equation in 1878 ms returned []
Implicit Place search using SMT with State Equation took 2110 ms to find 0 implicit places.
[2024-05-20 21:15:05] [INFO ] Redundant transitions in 21 ms returned []
Running 1643 sub problems to find dead transitions.
[2024-05-20 21:15:05] [INFO ] Invariant cache hit.
[2024-05-20 21:15:05] [INFO ] State equation strengthened by 1177 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1643 unsolved
[2024-05-20 21:15:18] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:15:18] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:15:19] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:15:19] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:15:19] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-20 21:15:19] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 0 ms to minimize.
[2024-05-20 21:15:19] [INFO ] Deduced a trap composed of 2 places in 190 ms of which 3 ms to minimize.
[2024-05-20 21:15:19] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-20 21:15:19] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-20 21:15:19] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:15:19] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:15:19] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:15:19] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:15:19] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 2 ms to minimize.
[2024-05-20 21:15:20] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:15:20] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:15:20] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:15:20] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:15:20] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:15:20] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1643 unsolved
[2024-05-20 21:15:20] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-05-20 21:15:20] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-20 21:15:23] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 3 ms to minimize.
[2024-05-20 21:15:23] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 3 ms to minimize.
[2024-05-20 21:15:23] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 3 ms to minimize.
[2024-05-20 21:15:23] [INFO ] Deduced a trap composed of 29 places in 200 ms of which 3 ms to minimize.
[2024-05-20 21:15:23] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 3 ms to minimize.
[2024-05-20 21:15:24] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 3 ms to minimize.
[2024-05-20 21:15:24] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 3 ms to minimize.
[2024-05-20 21:15:24] [INFO ] Deduced a trap composed of 29 places in 192 ms of which 3 ms to minimize.
[2024-05-20 21:15:24] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 3 ms to minimize.
[2024-05-20 21:15:24] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 2 ms to minimize.
[2024-05-20 21:15:25] [INFO ] Deduced a trap composed of 28 places in 200 ms of which 3 ms to minimize.
[2024-05-20 21:15:25] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 3 ms to minimize.
[2024-05-20 21:15:25] [INFO ] Deduced a trap composed of 26 places in 193 ms of which 3 ms to minimize.
[2024-05-20 21:15:25] [INFO ] Deduced a trap composed of 28 places in 198 ms of which 3 ms to minimize.
[2024-05-20 21:15:25] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 3 ms to minimize.
[2024-05-20 21:15:26] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 3 ms to minimize.
[2024-05-20 21:15:26] [INFO ] Deduced a trap composed of 29 places in 201 ms of which 3 ms to minimize.
[2024-05-20 21:15:35] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/2190 variables, and 62 constraints, problems are : Problem set: 0 solved, 1643 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/527 constraints, ReadFeed: 0/1177 constraints, PredecessorRefiner: 1643/1643 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1643 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1643 unsolved
[2024-05-20 21:15:37] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-20 21:15:37] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-05-20 21:15:37] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-05-20 21:15:37] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:15:37] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
[2024-05-20 21:15:37] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-20 21:15:38] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-05-20 21:15:38] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 1 ms to minimize.
[2024-05-20 21:15:38] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 3 ms to minimize.
[2024-05-20 21:15:38] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:15:38] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-05-20 21:15:38] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:15:38] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:15:38] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2024-05-20 21:15:38] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2024-05-20 21:15:38] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:15:38] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:15:39] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:15:39] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-05-20 21:15:39] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1643 unsolved
[2024-05-20 21:15:39] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:15:39] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:15:39] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:15:40] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:15:40] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:15:40] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:15:40] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:15:40] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2024-05-20 21:15:40] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:15:40] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-05-20 21:15:40] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:15:40] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
[2024-05-20 21:15:40] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:15:40] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:15:40] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:15:41] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:15:41] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 2 ms to minimize.
[2024-05-20 21:15:41] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:15:41] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:15:41] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1643 unsolved
[2024-05-20 21:15:41] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2024-05-20 21:15:42] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
[2024-05-20 21:15:42] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2024-05-20 21:15:42] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
[2024-05-20 21:15:42] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2024-05-20 21:15:42] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:15:42] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-20 21:15:42] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-20 21:15:42] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2024-05-20 21:15:42] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:15:42] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:15:43] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:15:43] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:15:43] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-05-20 21:15:43] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2024-05-20 21:15:43] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:15:43] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:15:43] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:15:43] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:15:43] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1643 unsolved
[2024-05-20 21:15:44] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-20 21:15:44] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-20 21:15:44] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:15:44] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:15:44] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-05-20 21:15:44] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:15:44] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:15:44] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:15:44] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
[2024-05-20 21:15:44] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:15:44] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:15:44] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-05-20 21:15:44] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:15:45] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:15:45] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:15:45] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-20 21:15:45] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 3 ms to minimize.
[2024-05-20 21:15:45] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 2 ms to minimize.
[2024-05-20 21:15:46] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 3 ms to minimize.
[2024-05-20 21:15:46] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1643 unsolved
[2024-05-20 21:15:46] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 1 ms to minimize.
[2024-05-20 21:15:47] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
[2024-05-20 21:15:47] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2024-05-20 21:15:47] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:15:47] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:15:47] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:15:47] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:15:47] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2024-05-20 21:15:47] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
[2024-05-20 21:15:47] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2024-05-20 21:15:47] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:15:48] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2024-05-20 21:15:48] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-05-20 21:15:48] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-05-20 21:15:48] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-05-20 21:15:48] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:15:48] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-05-20 21:15:48] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:15:48] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:15:48] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1643 unsolved
[2024-05-20 21:15:49] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:15:49] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2024-05-20 21:15:49] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2024-05-20 21:15:49] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:15:50] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2024-05-20 21:15:50] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:15:50] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:15:50] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:15:50] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:15:50] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-05-20 21:15:50] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:15:50] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:15:50] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:15:50] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:15:50] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-05-20 21:15:51] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 2 ms to minimize.
[2024-05-20 21:15:51] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 2 ms to minimize.
[2024-05-20 21:15:51] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 2 ms to minimize.
[2024-05-20 21:15:51] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:15:51] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1643 unsolved
[2024-05-20 21:15:52] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:15:52] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:15:52] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:15:52] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:15:52] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:15:52] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 0 ms to minimize.
[2024-05-20 21:15:52] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:15:52] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:15:52] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:15:52] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:15:52] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:15:52] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:15:53] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:15:53] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:15:53] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2024-05-20 21:15:53] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 0 ms to minimize.
[2024-05-20 21:15:53] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:15:56] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 3 ms to minimize.
[2024-05-20 21:16:03] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:16:04] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/526 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1643 unsolved
[2024-05-20 21:16:04] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:16:04] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2024-05-20 21:16:04] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:16:05] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-05-20 21:16:05] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2024-05-20 21:16:05] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:16:05] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:16:05] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:16:05] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:16:05] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:16:05] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 1 ms to minimize.
[2024-05-20 21:16:05] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:16:05] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:16:05] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:16:06] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
SMT process timed out in 60548ms, After SMT, problems are : Problem set: 0 solved, 1643 unsolved
Search for dead transitions found 0 dead transitions in 60565ms
Starting structural reductions in SI_LTL mode, iteration 1 : 527/1043 places, 1663/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62803 ms. Remains : 527/1043 places, 1663/2520 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-08
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-08 finished in 62982 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 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(X(G(p2))&&(p0 U (p1||G(p0)))))))'
Support contains 4 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Iterating post reduction 1 with 138 rules applied. Total rules applied 276 place count 905 transition count 2382
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 1 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 2 with 758 rules applied. Total rules applied 1034 place count 526 transition count 2003
Drop transitions (Redundant composition of simpler transitions.) removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 2 with 341 rules applied. Total rules applied 1375 place count 526 transition count 1662
Applied a total of 1375 rules in 87 ms. Remains 526 /1043 variables (removed 517) and now considering 1662/2520 (removed 858) transitions.
// Phase 1: matrix 1662 rows 526 cols
[2024-05-20 21:16:06] [INFO ] Computed 22 invariants in 21 ms
[2024-05-20 21:16:06] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-20 21:16:06] [INFO ] Invariant cache hit.
[2024-05-20 21:16:06] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 21:16:08] [INFO ] Implicit Places using invariants and state equation in 1833 ms returned []
Implicit Place search using SMT with State Equation took 2080 ms to find 0 implicit places.
[2024-05-20 21:16:08] [INFO ] Redundant transitions in 26 ms returned []
Running 1642 sub problems to find dead transitions.
[2024-05-20 21:16:08] [INFO ] Invariant cache hit.
[2024-05-20 21:16:08] [INFO ] State equation strengthened by 1177 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:16:21] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 2 ms to minimize.
[2024-05-20 21:16:21] [INFO ] Deduced a trap composed of 22 places in 206 ms of which 3 ms to minimize.
[2024-05-20 21:16:22] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 3 ms to minimize.
[2024-05-20 21:16:22] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 3 ms to minimize.
[2024-05-20 21:16:22] [INFO ] Deduced a trap composed of 2 places in 151 ms of which 2 ms to minimize.
[2024-05-20 21:16:22] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:16:22] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:16:22] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:16:22] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:16:22] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:16:22] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:16:22] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:16:23] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:16:23] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
[2024-05-20 21:16:23] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:16:23] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2024-05-20 21:16:23] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:16:23] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-20 21:16:23] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-20 21:16:23] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:16:24] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:16:24] [INFO ] Deduced a trap composed of 26 places in 188 ms of which 2 ms to minimize.
[2024-05-20 21:16:24] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 2 ms to minimize.
[2024-05-20 21:16:24] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 2 ms to minimize.
[2024-05-20 21:16:24] [INFO ] Deduced a trap composed of 26 places in 210 ms of which 3 ms to minimize.
[2024-05-20 21:16:25] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 3 ms to minimize.
[2024-05-20 21:16:25] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 3 ms to minimize.
[2024-05-20 21:16:25] [INFO ] Deduced a trap composed of 26 places in 193 ms of which 3 ms to minimize.
[2024-05-20 21:16:25] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 3 ms to minimize.
[2024-05-20 21:16:25] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 2 ms to minimize.
[2024-05-20 21:16:26] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 3 ms to minimize.
[2024-05-20 21:16:26] [INFO ] Deduced a trap composed of 27 places in 215 ms of which 3 ms to minimize.
[2024-05-20 21:16:26] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 3 ms to minimize.
[2024-05-20 21:16:26] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 3 ms to minimize.
[2024-05-20 21:16:26] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 3 ms to minimize.
[2024-05-20 21:16:27] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 3 ms to minimize.
[2024-05-20 21:16:27] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 2 ms to minimize.
[2024-05-20 21:16:27] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 2 ms to minimize.
[2024-05-20 21:16:27] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 2 ms to minimize.
[2024-05-20 21:16:27] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/2188 variables, and 62 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/526 constraints, ReadFeed: 0/1177 constraints, PredecessorRefiner: 1642/1642 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1642 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:16:40] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 2 ms to minimize.
[2024-05-20 21:16:40] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2024-05-20 21:16:40] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
[2024-05-20 21:16:40] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 2 ms to minimize.
[2024-05-20 21:16:40] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2024-05-20 21:16:40] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2024-05-20 21:16:41] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:16:41] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 6 ms to minimize.
[2024-05-20 21:16:41] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:16:41] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:16:41] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:16:41] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:16:41] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-05-20 21:16:41] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:16:41] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:16:41] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:16:42] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:16:42] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:16:42] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2024-05-20 21:16:42] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:16:42] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 2 ms to minimize.
[2024-05-20 21:16:43] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 2 ms to minimize.
[2024-05-20 21:16:43] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 2 ms to minimize.
[2024-05-20 21:16:43] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 2 ms to minimize.
[2024-05-20 21:16:43] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 1 ms to minimize.
[2024-05-20 21:16:43] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-20 21:16:43] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 1 ms to minimize.
[2024-05-20 21:16:43] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 1 ms to minimize.
[2024-05-20 21:16:43] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-05-20 21:16:44] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 2 ms to minimize.
[2024-05-20 21:16:44] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-05-20 21:16:44] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-05-20 21:16:44] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2024-05-20 21:16:44] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:16:44] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 2 ms to minimize.
[2024-05-20 21:16:44] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:16:44] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:16:44] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:16:45] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-05-20 21:16:45] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:16:45] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 4 ms to minimize.
[2024-05-20 21:16:45] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-05-20 21:16:46] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-20 21:16:46] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2024-05-20 21:16:46] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:16:46] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:16:46] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2024-05-20 21:16:46] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2024-05-20 21:16:46] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-20 21:16:46] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2024-05-20 21:16:46] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2024-05-20 21:16:46] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:16:46] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:16:47] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:16:47] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:16:47] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 2 ms to minimize.
[2024-05-20 21:16:47] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 2 ms to minimize.
[2024-05-20 21:16:47] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 2 ms to minimize.
[2024-05-20 21:16:47] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 2 ms to minimize.
[2024-05-20 21:16:48] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:16:48] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2024-05-20 21:16:48] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-05-20 21:16:49] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:16:49] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-05-20 21:16:49] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
[2024-05-20 21:16:49] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 1 ms to minimize.
[2024-05-20 21:16:49] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 1 ms to minimize.
[2024-05-20 21:16:49] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 1 ms to minimize.
[2024-05-20 21:16:49] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-05-20 21:16:49] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-05-20 21:16:49] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:16:49] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:16:50] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:16:50] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:16:50] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:16:50] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-20 21:16:50] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:16:50] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:16:50] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:16:50] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:16:50] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:16:50] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:16:50] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:16:51] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:16:51] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:16:51] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2024-05-20 21:16:51] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:16:51] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:16:51] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:16:51] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-20 21:16:51] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:16:51] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:16:51] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:16:51] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:16:51] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:16:51] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:16:52] [INFO ] Deduced a trap composed of 28 places in 178 ms of which 2 ms to minimize.
[2024-05-20 21:16:52] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 3 ms to minimize.
[2024-05-20 21:16:52] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 2 ms to minimize.
[2024-05-20 21:16:52] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:16:53] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:16:53] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:16:53] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:16:53] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-20 21:16:53] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-05-20 21:16:54] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:16:54] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-05-20 21:16:54] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-05-20 21:16:54] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:16:54] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:16:54] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:16:54] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:16:54] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:16:54] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:16:54] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:16:54] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-20 21:16:55] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
[2024-05-20 21:16:55] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:16:55] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:16:55] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:16:56] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:16:56] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:16:56] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:16:56] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:16:56] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:16:56] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:16:56] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:16:56] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 1 ms to minimize.
[2024-05-20 21:16:56] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2024-05-20 21:16:56] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:16:57] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:16:57] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-20 21:16:57] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:16:57] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:16:57] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:16:57] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-05-20 21:16:57] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-05-20 21:16:57] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:16:57] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-05-20 21:16:57] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:16:58] [INFO ] Deduced a trap composed of 2 places in 151 ms of which 2 ms to minimize.
[2024-05-20 21:16:58] [INFO ] Deduced a trap composed of 2 places in 147 ms of which 2 ms to minimize.
[2024-05-20 21:16:58] [INFO ] Deduced a trap composed of 2 places in 182 ms of which 3 ms to minimize.
[2024-05-20 21:16:59] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 2 ms to minimize.
[2024-05-20 21:16:59] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 3 ms to minimize.
[2024-05-20 21:16:59] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 3 ms to minimize.
[2024-05-20 21:16:59] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 3 ms to minimize.
[2024-05-20 21:16:59] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:17:00] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-05-20 21:17:00] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-05-20 21:17:00] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2024-05-20 21:17:00] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:17:00] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-05-20 21:17:00] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:17:00] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:17:00] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:17:00] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:17:00] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 0 ms to minimize.
[2024-05-20 21:17:00] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:17:00] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:17:01] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:17:01] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:17:01] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:17:02] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:17:02] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:17:02] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:17:02] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2024-05-20 21:17:02] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-20 21:17:02] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:17:02] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/2188 variables, and 232 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/526 constraints, ReadFeed: 0/1177 constraints, PredecessorRefiner: 0/1642 constraints, Known Traps: 210/210 constraints]
After SMT, in 60518ms problems are : Problem set: 0 solved, 1642 unsolved
Search for dead transitions found 0 dead transitions in 60532ms
Starting structural reductions in SI_LTL mode, iteration 1 : 526/1043 places, 1662/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62736 ms. Remains : 526/1043 places, 1662/2520 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-09
Product exploration explored 100000 steps with 968 reset in 487 ms.
Product exploration explored 100000 steps with 977 reset in 494 ms.
Computed a total of 65 stabilizing places and 102 stable transitions
Computed a total of 65 stabilizing places and 102 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (OR (AND p0 p2) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR (AND p0 p2) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 118 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (385 resets) in 239 ms. (166 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (19 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (17 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (18 resets) in 282 ms. (141 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (16 resets) in 152 ms. (261 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (17 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (18 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (19 resets) in 117 ms. (339 steps per ms) remains 7/7 properties
[2024-05-20 21:17:10] [INFO ] Invariant cache hit.
[2024-05-20 21:17:10] [INFO ] State equation strengthened by 1177 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf4 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 1 (OVERLAPS) 482/486 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 36/522 variables, 18/20 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/524 variables, 2/22 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1662/2186 variables, 524/546 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2186 variables, 1177/1723 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2186 variables, 0/1723 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 2/2188 variables, 2/1725 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2188 variables, 0/1725 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/2188 variables, 0/1725 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2188/2188 variables, and 1725 constraints, problems are : Problem set: 2 solved, 5 unsolved in 1042 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 526/526 constraints, ReadFeed: 1177/1177 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 482/486 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-20 21:17:11] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 36/522 variables, 18/21 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/524 variables, 2/23 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-20 21:17:12] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 3 ms to minimize.
[2024-05-20 21:17:12] [INFO ] Deduced a trap composed of 26 places in 215 ms of which 3 ms to minimize.
[2024-05-20 21:17:12] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 3 ms to minimize.
[2024-05-20 21:17:12] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 3 ms to minimize.
[2024-05-20 21:17:13] [INFO ] Deduced a trap composed of 29 places in 177 ms of which 2 ms to minimize.
[2024-05-20 21:17:13] [INFO ] Deduced a trap composed of 31 places in 177 ms of which 3 ms to minimize.
[2024-05-20 21:17:13] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 3 ms to minimize.
[2024-05-20 21:17:13] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 2 ms to minimize.
[2024-05-20 21:17:13] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 3 ms to minimize.
[2024-05-20 21:17:14] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 2 ms to minimize.
[2024-05-20 21:17:14] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 2 ms to minimize.
[2024-05-20 21:17:14] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 2 ms to minimize.
[2024-05-20 21:17:14] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 3 ms to minimize.
[2024-05-20 21:17:14] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 2 ms to minimize.
[2024-05-20 21:17:14] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 1 ms to minimize.
[2024-05-20 21:17:14] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-05-20 21:17:14] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:17:15] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-05-20 21:17:15] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-05-20 21:17:15] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 20/43 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 0/43 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1662/2186 variables, 524/567 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2186 variables, 1177/1744 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2186 variables, 5/1749 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2186 variables, 0/1749 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2/2188 variables, 2/1751 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2188 variables, 0/1751 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/2188 variables, 0/1751 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2188/2188 variables, and 1751 constraints, problems are : Problem set: 2 solved, 5 unsolved in 4796 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 526/526 constraints, ReadFeed: 1177/1177 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 21/21 constraints]
After SMT, in 5859ms problems are : Problem set: 2 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 543 ms.
Support contains 4 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 526 transition count 1661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 525 transition count 1661
Partial Free-agglomeration rule applied 436 times.
Drop transitions (Partial Free agglomeration) removed 436 transitions
Iterating global reduction 1 with 436 rules applied. Total rules applied 438 place count 525 transition count 1661
Applied a total of 438 rules in 60 ms. Remains 525 /526 variables (removed 1) and now considering 1661/1662 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 525/526 places, 1661/1662 transitions.
RANDOM walk for 40000 steps (424 resets) in 812 ms. (49 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (16 resets) in 53 ms. (740 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (18 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (16 resets) in 90 ms. (439 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (16 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (18 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 273874 steps, run timeout after 3004 ms. (steps per millisecond=91 ) properties seen :0 out of 5
Probabilistic random walk after 273874 steps, saw 38203 distinct states, run finished after 3004 ms. (steps per millisecond=91 ) properties seen :0
// Phase 1: matrix 1661 rows 525 cols
[2024-05-20 21:17:20] [INFO ] Computed 22 invariants in 20 ms
[2024-05-20 21:17:20] [INFO ] State equation strengthened by 1594 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 481/485 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/485 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 36/521 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-20 21:17:20] [INFO ] Deduced a trap composed of 2 places in 201 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/521 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/521 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/523 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1661/2184 variables, 523/546 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2184 variables, 1594/2140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2184 variables, 0/2140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2/2186 variables, 2/2142 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2186 variables, 0/2142 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/2186 variables, 0/2142 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2186/2186 variables, and 2142 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1354 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 525/525 constraints, ReadFeed: 1594/1594 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 481/485 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/485 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-20 21:17:22] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 0 ms to minimize.
[2024-05-20 21:17:22] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-20 21:17:22] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-05-20 21:17:22] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 0 ms to minimize.
[2024-05-20 21:17:22] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
[2024-05-20 21:17:22] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-20 21:17:22] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-20 21:17:22] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-05-20 21:17:22] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2024-05-20 21:17:22] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-20 21:17:22] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-05-20 21:17:22] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-20 21:17:22] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
[2024-05-20 21:17:22] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-05-20 21:17:22] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2024-05-20 21:17:22] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
[2024-05-20 21:17:22] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/485 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 36/521 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2/523 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-20 21:17:23] [INFO ] Deduced a trap composed of 26 places in 242 ms of which 4 ms to minimize.
[2024-05-20 21:17:23] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 3 ms to minimize.
[2024-05-20 21:17:23] [INFO ] Deduced a trap composed of 46 places in 185 ms of which 3 ms to minimize.
[2024-05-20 21:17:23] [INFO ] Deduced a trap composed of 40 places in 255 ms of which 3 ms to minimize.
[2024-05-20 21:17:24] [INFO ] Deduced a trap composed of 28 places in 211 ms of which 3 ms to minimize.
[2024-05-20 21:17:24] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 2 ms to minimize.
[2024-05-20 21:17:24] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 2 ms to minimize.
[2024-05-20 21:17:24] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 3 ms to minimize.
[2024-05-20 21:17:24] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 2 ms to minimize.
[2024-05-20 21:17:24] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 3 ms to minimize.
[2024-05-20 21:17:24] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 2 ms to minimize.
[2024-05-20 21:17:25] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2024-05-20 21:17:25] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:17:25] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
[2024-05-20 21:17:25] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2024-05-20 21:17:25] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:17:25] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:17:25] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:17:25] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:17:25] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/523 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-20 21:17:25] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:17:25] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:17:26] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:17:26] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:17:26] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/523 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/523 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1661/2184 variables, 523/588 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2184 variables, 1594/2182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2184 variables, 5/2187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2184 variables, 0/2187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/2186 variables, 2/2189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2186 variables, 0/2189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/2186 variables, 0/2189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2186/2186 variables, and 2189 constraints, problems are : Problem set: 0 solved, 5 unsolved in 6295 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 525/525 constraints, ReadFeed: 1594/1594 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 43/43 constraints]
After SMT, in 7697ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 681 ms.
Support contains 4 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 19 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 525/525 places, 1661/1661 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 19 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
[2024-05-20 21:17:29] [INFO ] Invariant cache hit.
[2024-05-20 21:17:29] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-05-20 21:17:29] [INFO ] Invariant cache hit.
[2024-05-20 21:17:29] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2024-05-20 21:17:33] [INFO ] Implicit Places using invariants and state equation in 4456 ms returned []
Implicit Place search using SMT with State Equation took 4843 ms to find 0 implicit places.
[2024-05-20 21:17:33] [INFO ] Redundant transitions in 26 ms returned []
Running 1641 sub problems to find dead transitions.
[2024-05-20 21:17:33] [INFO ] Invariant cache hit.
[2024-05-20 21:17:33] [INFO ] State equation strengthened by 1594 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/524 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/524 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:17:47] [INFO ] Deduced a trap composed of 2 places in 237 ms of which 3 ms to minimize.
[2024-05-20 21:17:47] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 3 ms to minimize.
[2024-05-20 21:17:47] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 3 ms to minimize.
[2024-05-20 21:17:48] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 3 ms to minimize.
[2024-05-20 21:17:48] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 3 ms to minimize.
[2024-05-20 21:17:48] [INFO ] Deduced a trap composed of 28 places in 177 ms of which 3 ms to minimize.
[2024-05-20 21:17:48] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 3 ms to minimize.
[2024-05-20 21:17:48] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 3 ms to minimize.
[2024-05-20 21:17:48] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 2 ms to minimize.
[2024-05-20 21:17:49] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 2 ms to minimize.
[2024-05-20 21:17:49] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 2 ms to minimize.
[2024-05-20 21:17:49] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 2 ms to minimize.
[2024-05-20 21:17:49] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 2 ms to minimize.
[2024-05-20 21:17:49] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 2 ms to minimize.
[2024-05-20 21:17:49] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 2 ms to minimize.
[2024-05-20 21:17:50] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 2 ms to minimize.
[2024-05-20 21:17:50] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 1 ms to minimize.
[2024-05-20 21:17:50] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 2 ms to minimize.
[2024-05-20 21:17:50] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2024-05-20 21:17:50] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/524 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:17:51] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 3 ms to minimize.
[2024-05-20 21:17:51] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 2 ms to minimize.
[2024-05-20 21:17:51] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 1 ms to minimize.
[2024-05-20 21:17:51] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-05-20 21:17:51] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-20 21:17:51] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
[2024-05-20 21:17:51] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
[2024-05-20 21:17:51] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 1 ms to minimize.
[2024-05-20 21:17:52] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
[2024-05-20 21:17:52] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 2 ms to minimize.
[2024-05-20 21:17:52] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 2 ms to minimize.
[2024-05-20 21:17:52] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 1 ms to minimize.
[2024-05-20 21:17:52] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-05-20 21:17:52] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 2 ms to minimize.
[2024-05-20 21:17:52] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:17:52] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:17:52] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:17:52] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:17:53] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-20 21:17:53] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/524 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 524/2186 variables, and 62 constraints, problems are : Problem set: 0 solved, 1641 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/525 constraints, ReadFeed: 0/1594 constraints, PredecessorRefiner: 1641/1641 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1641 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/524 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/524 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/524 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:18:05] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 9 ms to minimize.
[2024-05-20 21:18:05] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 3 ms to minimize.
[2024-05-20 21:18:06] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:18:06] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 2 ms to minimize.
[2024-05-20 21:18:06] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 3 ms to minimize.
[2024-05-20 21:18:06] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 2 ms to minimize.
[2024-05-20 21:18:06] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 2 ms to minimize.
[2024-05-20 21:18:06] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 2 ms to minimize.
[2024-05-20 21:18:07] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
[2024-05-20 21:18:07] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 2 ms to minimize.
[2024-05-20 21:18:07] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 2 ms to minimize.
[2024-05-20 21:18:07] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 2 ms to minimize.
[2024-05-20 21:18:07] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 2 ms to minimize.
[2024-05-20 21:18:07] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 2 ms to minimize.
[2024-05-20 21:18:07] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
[2024-05-20 21:18:08] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 2 ms to minimize.
[2024-05-20 21:18:08] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 3 ms to minimize.
[2024-05-20 21:18:08] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 3 ms to minimize.
[2024-05-20 21:18:08] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 3 ms to minimize.
[2024-05-20 21:18:08] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/524 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:18:09] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-05-20 21:18:09] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-20 21:18:09] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
[2024-05-20 21:18:09] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
[2024-05-20 21:18:09] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 1 ms to minimize.
[2024-05-20 21:18:09] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
[2024-05-20 21:18:10] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 2 ms to minimize.
[2024-05-20 21:18:10] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:18:10] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 1 ms to minimize.
[2024-05-20 21:18:10] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 1 ms to minimize.
[2024-05-20 21:18:10] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-05-20 21:18:10] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:18:10] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
[2024-05-20 21:18:10] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-05-20 21:18:11] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
[2024-05-20 21:18:11] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:18:11] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2024-05-20 21:18:11] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 1 ms to minimize.
[2024-05-20 21:18:11] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:18:11] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:18:11] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 2 ms to minimize.
[2024-05-20 21:18:12] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2024-05-20 21:18:12] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 2 ms to minimize.
[2024-05-20 21:18:12] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 2 ms to minimize.
[2024-05-20 21:18:12] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
[2024-05-20 21:18:12] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
[2024-05-20 21:18:12] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-20 21:18:12] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 1 ms to minimize.
[2024-05-20 21:18:12] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-05-20 21:18:13] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:18:13] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-20 21:18:13] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-05-20 21:18:13] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-20 21:18:13] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:18:13] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:18:13] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:18:13] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:18:13] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
[2024-05-20 21:18:13] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:18:13] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:18:14] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2024-05-20 21:18:14] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-05-20 21:18:14] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:18:14] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:18:14] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:18:15] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:18:15] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-05-20 21:18:15] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:18:15] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:18:15] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:18:15] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:18:15] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:18:15] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:18:15] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-20 21:18:15] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-20 21:18:15] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:18:15] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:18:15] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:18:15] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:18:21] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:18:22] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2024-05-20 21:18:22] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-20 21:18:22] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2024-05-20 21:18:22] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 2 ms to minimize.
[2024-05-20 21:18:22] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:18:22] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:18:22] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:18:22] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:18:22] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-20 21:18:22] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 2 ms to minimize.
[2024-05-20 21:18:23] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:18:23] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:18:23] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-05-20 21:18:23] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2024-05-20 21:18:23] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:18:23] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:18:23] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:18:23] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:18:23] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:18:23] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:18:24] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:18:24] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:18:24] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:18:24] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:18:24] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:18:24] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:18:24] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-20 21:18:24] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 2 ms to minimize.
[2024-05-20 21:18:24] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-20 21:18:25] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:18:25] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:18:25] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2024-05-20 21:18:25] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:18:25] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:18:25] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 2 ms to minimize.
[2024-05-20 21:18:25] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 2 ms to minimize.
[2024-05-20 21:18:25] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 2 ms to minimize.
[2024-05-20 21:18:25] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 2 ms to minimize.
[2024-05-20 21:18:26] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 2 ms to minimize.
[2024-05-20 21:18:26] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:18:26] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 1 ms to minimize.
[2024-05-20 21:18:27] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:18:27] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:18:27] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:18:27] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:18:27] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 1 ms to minimize.
[2024-05-20 21:18:27] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:18:27] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:18:27] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:18:27] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:18:27] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:18:27] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:18:27] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:18:27] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:18:28] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:18:28] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 0 ms to minimize.
[2024-05-20 21:18:28] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:18:28] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 0 ms to minimize.
[2024-05-20 21:18:28] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
[2024-05-20 21:18:28] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/524 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:18:29] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 3 ms to minimize.
[2024-05-20 21:18:29] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 3 ms to minimize.
[2024-05-20 21:18:29] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 3 ms to minimize.
[2024-05-20 21:18:29] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 2 ms to minimize.
[2024-05-20 21:18:29] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 2 ms to minimize.
[2024-05-20 21:18:29] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 2 ms to minimize.
[2024-05-20 21:18:30] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 3 ms to minimize.
[2024-05-20 21:18:30] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 2 ms to minimize.
[2024-05-20 21:18:30] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 2 ms to minimize.
[2024-05-20 21:18:30] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 2 ms to minimize.
[2024-05-20 21:18:30] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2024-05-20 21:18:30] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-20 21:18:30] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 2 ms to minimize.
[2024-05-20 21:18:31] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 1 ms to minimize.
[2024-05-20 21:18:31] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2024-05-20 21:18:31] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2024-05-20 21:18:31] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:18:31] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-05-20 21:18:31] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:18:31] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/524 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:18:32] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2024-05-20 21:18:32] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:18:32] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:18:32] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:18:32] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:18:32] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-20 21:18:32] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:18:32] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:18:32] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2024-05-20 21:18:33] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 1 ms to minimize.
[2024-05-20 21:18:33] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-05-20 21:18:33] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-05-20 21:18:33] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2024-05-20 21:18:33] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-20 21:18:33] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2024-05-20 21:18:33] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-05-20 21:18:33] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:18:33] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:18:33] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:18:33] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/524 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 524/2186 variables, and 242 constraints, problems are : Problem set: 0 solved, 1641 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/525 constraints, ReadFeed: 0/1594 constraints, PredecessorRefiner: 0/1641 constraints, Known Traps: 220/220 constraints]
After SMT, in 60672ms problems are : Problem set: 0 solved, 1641 unsolved
Search for dead transitions found 0 dead transitions in 60689ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65592 ms. Remains : 525/525 places, 1661/1661 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1530 edges and 525 vertex of which 437 / 525 are part of one of the 2 SCC in 0 ms
Free SCC test removed 435 places
Drop transitions (Empty/Sink Transition effects.) removed 1154 transitions
Ensure Unique test removed 407 transitions
Reduce isomorphic transitions removed 1561 transitions.
Graph (complete) has 222 edges and 90 vertex of which 29 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 29 transition count 40
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 60 place count 11 transition count 22
Iterating global reduction 1 with 18 rules applied. Total rules applied 78 place count 11 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 10 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 10 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 9 transition count 17
Applied a total of 84 rules in 4 ms. Remains 9 /525 variables (removed 516) and now considering 17/1661 (removed 1644) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 17 rows 9 cols
[2024-05-20 21:18:34] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 21:18:34] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-20 21:18:34] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-20 21:18:34] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-20 21:18:34] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 83 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (OR (AND p0 p2) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR (AND p0 p2) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1)), (G (OR (NOT p0) p1)), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 21 factoid took 142 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 112 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 4 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Applied a total of 0 rules in 22 ms. Remains 526 /526 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
// Phase 1: matrix 1662 rows 526 cols
[2024-05-20 21:18:35] [INFO ] Computed 22 invariants in 20 ms
[2024-05-20 21:18:35] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-20 21:18:35] [INFO ] Invariant cache hit.
[2024-05-20 21:18:35] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 21:18:37] [INFO ] Implicit Places using invariants and state equation in 1986 ms returned []
Implicit Place search using SMT with State Equation took 2219 ms to find 0 implicit places.
[2024-05-20 21:18:37] [INFO ] Redundant transitions in 22 ms returned []
Running 1642 sub problems to find dead transitions.
[2024-05-20 21:18:37] [INFO ] Invariant cache hit.
[2024-05-20 21:18:37] [INFO ] State equation strengthened by 1177 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:18:51] [INFO ] Deduced a trap composed of 22 places in 214 ms of which 3 ms to minimize.
[2024-05-20 21:18:51] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 3 ms to minimize.
[2024-05-20 21:18:51] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 2 ms to minimize.
[2024-05-20 21:18:51] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 2 ms to minimize.
[2024-05-20 21:18:51] [INFO ] Deduced a trap composed of 2 places in 160 ms of which 2 ms to minimize.
[2024-05-20 21:18:51] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:18:51] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:18:52] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:18:52] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:18:52] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:18:52] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:18:52] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-05-20 21:18:52] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:18:52] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
[2024-05-20 21:18:52] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:18:52] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-05-20 21:18:52] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:18:52] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:18:52] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:18:53] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:18:53] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:18:53] [INFO ] Deduced a trap composed of 26 places in 193 ms of which 3 ms to minimize.
[2024-05-20 21:18:53] [INFO ] Deduced a trap composed of 26 places in 215 ms of which 3 ms to minimize.
[2024-05-20 21:18:54] [INFO ] Deduced a trap composed of 29 places in 210 ms of which 3 ms to minimize.
[2024-05-20 21:18:54] [INFO ] Deduced a trap composed of 26 places in 211 ms of which 3 ms to minimize.
[2024-05-20 21:18:54] [INFO ] Deduced a trap composed of 28 places in 198 ms of which 3 ms to minimize.
[2024-05-20 21:18:54] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 3 ms to minimize.
[2024-05-20 21:18:54] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 3 ms to minimize.
[2024-05-20 21:18:55] [INFO ] Deduced a trap composed of 26 places in 211 ms of which 3 ms to minimize.
[2024-05-20 21:18:55] [INFO ] Deduced a trap composed of 30 places in 196 ms of which 3 ms to minimize.
[2024-05-20 21:18:55] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 3 ms to minimize.
[2024-05-20 21:18:55] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 3 ms to minimize.
[2024-05-20 21:18:56] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 3 ms to minimize.
[2024-05-20 21:18:56] [INFO ] Deduced a trap composed of 32 places in 194 ms of which 3 ms to minimize.
[2024-05-20 21:18:56] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 3 ms to minimize.
[2024-05-20 21:18:56] [INFO ] Deduced a trap composed of 27 places in 213 ms of which 3 ms to minimize.
[2024-05-20 21:18:56] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 2 ms to minimize.
[2024-05-20 21:18:57] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 2 ms to minimize.
[2024-05-20 21:18:57] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 2 ms to minimize.
[2024-05-20 21:18:57] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/2188 variables, and 62 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/526 constraints, ReadFeed: 0/1177 constraints, PredecessorRefiner: 1642/1642 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1642 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:19:09] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 2 ms to minimize.
[2024-05-20 21:19:09] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 3 ms to minimize.
[2024-05-20 21:19:09] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 2 ms to minimize.
[2024-05-20 21:19:09] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-05-20 21:19:09] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-05-20 21:19:09] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 1 ms to minimize.
[2024-05-20 21:19:10] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-05-20 21:19:10] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 1 ms to minimize.
[2024-05-20 21:19:10] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:19:10] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:19:10] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:19:10] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:19:10] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:19:10] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:19:10] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:19:10] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:19:10] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:19:10] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:19:11] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:19:11] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:19:11] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2024-05-20 21:19:11] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 2 ms to minimize.
[2024-05-20 21:19:12] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 2 ms to minimize.
[2024-05-20 21:19:12] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2024-05-20 21:19:12] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2024-05-20 21:19:12] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
[2024-05-20 21:19:12] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 2 ms to minimize.
[2024-05-20 21:19:12] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
[2024-05-20 21:19:12] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:19:13] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-05-20 21:19:13] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
[2024-05-20 21:19:13] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:19:13] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:19:13] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
[2024-05-20 21:19:13] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2024-05-20 21:19:13] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 2 ms to minimize.
[2024-05-20 21:19:13] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
[2024-05-20 21:19:13] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-05-20 21:19:13] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:19:13] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:19:14] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2024-05-20 21:19:14] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2024-05-20 21:19:14] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2024-05-20 21:19:14] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-05-20 21:19:15] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:19:15] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:19:15] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:19:15] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:19:15] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-20 21:19:15] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:19:15] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:19:15] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:19:15] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:19:15] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:19:15] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:19:16] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 3 ms to minimize.
[2024-05-20 21:19:16] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 2 ms to minimize.
[2024-05-20 21:19:16] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 3 ms to minimize.
[2024-05-20 21:19:16] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 2 ms to minimize.
[2024-05-20 21:19:16] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:19:17] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
[2024-05-20 21:19:17] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:19:17] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 1 ms to minimize.
[2024-05-20 21:19:17] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 1 ms to minimize.
[2024-05-20 21:19:18] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:19:18] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2024-05-20 21:19:18] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-20 21:19:18] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2024-05-20 21:19:18] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:19:18] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:19:18] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:19:18] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:19:18] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:19:18] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:19:18] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:19:18] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:19:18] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2024-05-20 21:19:19] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:19:19] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-20 21:19:19] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:19:19] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-20 21:19:19] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:19:19] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:19:19] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:19:19] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:19:19] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-20 21:19:19] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:19:20] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:19:20] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:19:20] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:19:20] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:19:20] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:19:20] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:19:20] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:19:20] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-20 21:19:20] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:19:20] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 3 ms to minimize.
[2024-05-20 21:19:21] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 3 ms to minimize.
[2024-05-20 21:19:21] [INFO ] Deduced a trap composed of 30 places in 193 ms of which 3 ms to minimize.
[2024-05-20 21:19:21] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:19:22] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:19:22] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:19:22] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:19:22] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:19:22] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:19:22] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:19:23] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-05-20 21:19:23] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 1 ms to minimize.
[2024-05-20 21:19:23] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:19:23] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-05-20 21:19:23] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-20 21:19:23] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:19:23] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:19:23] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:19:23] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:19:23] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-05-20 21:19:23] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:19:23] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:19:24] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:19:24] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:19:24] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:19:25] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:19:25] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:19:25] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:19:25] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:19:25] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:19:25] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-20 21:19:25] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-20 21:19:25] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:19:25] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:19:25] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
[2024-05-20 21:19:25] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-05-20 21:19:26] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:19:26] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:19:26] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-05-20 21:19:26] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:19:26] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:19:26] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:19:26] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:19:26] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:19:27] [INFO ] Deduced a trap composed of 2 places in 155 ms of which 2 ms to minimize.
[2024-05-20 21:19:27] [INFO ] Deduced a trap composed of 2 places in 146 ms of which 2 ms to minimize.
[2024-05-20 21:19:27] [INFO ] Deduced a trap composed of 2 places in 164 ms of which 2 ms to minimize.
[2024-05-20 21:19:27] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 2 ms to minimize.
[2024-05-20 21:19:28] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 3 ms to minimize.
[2024-05-20 21:19:28] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 3 ms to minimize.
[2024-05-20 21:19:28] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 2 ms to minimize.
[2024-05-20 21:19:28] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:19:28] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-05-20 21:19:28] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2024-05-20 21:19:29] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:19:29] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-05-20 21:19:29] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:19:29] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:19:29] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:19:29] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:19:29] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:19:29] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:19:29] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:19:29] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:19:30] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:19:30] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:19:30] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-05-20 21:19:30] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:19:30] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 2 ms to minimize.
[2024-05-20 21:19:30] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:19:30] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:19:30] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:19:31] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-05-20 21:19:31] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/2188 variables, and 232 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/526 constraints, ReadFeed: 0/1177 constraints, PredecessorRefiner: 0/1642 constraints, Known Traps: 210/210 constraints]
After SMT, in 60541ms problems are : Problem set: 0 solved, 1642 unsolved
Search for dead transitions found 0 dead transitions in 60555ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62826 ms. Remains : 526/526 places, 1662/1662 transitions.
Computed a total of 65 stabilizing places and 102 stable transitions
Computed a total of 65 stabilizing places and 102 stable transitions
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 93 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (382 resets) in 851 ms. (46 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (16 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (17 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (16 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
[2024-05-20 21:19:38] [INFO ] Invariant cache hit.
[2024-05-20 21:19:38] [INFO ] State equation strengthened by 1177 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 482/486 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:19:38] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 36/522 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/524 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:19:38] [INFO ] Deduced a trap composed of 29 places in 216 ms of which 3 ms to minimize.
[2024-05-20 21:19:39] [INFO ] Deduced a trap composed of 26 places in 193 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1662/2186 variables, 524/549 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2186 variables, 1177/1726 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2186 variables, 0/1726 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/2188 variables, 2/1728 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2188 variables, 0/1728 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/2188 variables, 0/1728 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2188/2188 variables, and 1728 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1305 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 526/526 constraints, ReadFeed: 1177/1177 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 482/486 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:19:39] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 36/522 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/524 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:19:40] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 3 ms to minimize.
[2024-05-20 21:19:40] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 2 ms to minimize.
[2024-05-20 21:19:40] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 3 ms to minimize.
[2024-05-20 21:19:40] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 3 ms to minimize.
[2024-05-20 21:19:41] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 3 ms to minimize.
[2024-05-20 21:19:41] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 3 ms to minimize.
[2024-05-20 21:19:41] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 3 ms to minimize.
[2024-05-20 21:19:41] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 2 ms to minimize.
[2024-05-20 21:19:41] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 2 ms to minimize.
[2024-05-20 21:19:41] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
[2024-05-20 21:19:41] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-05-20 21:19:42] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 2 ms to minimize.
[2024-05-20 21:19:42] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-20 21:19:42] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 1 ms to minimize.
[2024-05-20 21:19:42] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:19:42] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:19:42] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:19:42] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:19:42] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:19:42] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/524 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/524 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1662/2186 variables, 524/570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2186 variables, 1177/1747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2186 variables, 3/1750 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2186 variables, 0/1750 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/2188 variables, 2/1752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2188 variables, 0/1752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/2188 variables, 0/1752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2188/2188 variables, and 1752 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3848 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 526/526 constraints, ReadFeed: 1177/1177 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 24/24 constraints]
After SMT, in 5169ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 143 ms.
Support contains 4 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 526 transition count 1661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 525 transition count 1661
Partial Free-agglomeration rule applied 436 times.
Drop transitions (Partial Free agglomeration) removed 436 transitions
Iterating global reduction 1 with 436 rules applied. Total rules applied 438 place count 525 transition count 1661
Applied a total of 438 rules in 67 ms. Remains 525 /526 variables (removed 1) and now considering 1661/1662 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 525/526 places, 1661/1662 transitions.
RANDOM walk for 40000 steps (423 resets) in 812 ms. (49 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (17 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (16 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (16 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 306574 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 3
Probabilistic random walk after 306574 steps, saw 41813 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
// Phase 1: matrix 1661 rows 525 cols
[2024-05-20 21:19:47] [INFO ] Computed 22 invariants in 12 ms
[2024-05-20 21:19:47] [INFO ] State equation strengthened by 1594 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 481/485 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:19:47] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/485 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/485 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 36/521 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/521 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/523 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1661/2184 variables, 523/546 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2184 variables, 1594/2140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2184 variables, 0/2140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/2186 variables, 2/2142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2186 variables, 0/2142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/2186 variables, 0/2142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2186/2186 variables, and 2142 constraints, problems are : Problem set: 0 solved, 3 unsolved in 852 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 525/525 constraints, ReadFeed: 1594/1594 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 481/485 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/485 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:19:48] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/485 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 36/521 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/523 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:19:48] [INFO ] Deduced a trap composed of 31 places in 204 ms of which 3 ms to minimize.
[2024-05-20 21:19:48] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 3 ms to minimize.
[2024-05-20 21:19:49] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 3 ms to minimize.
[2024-05-20 21:19:49] [INFO ] Deduced a trap composed of 27 places in 178 ms of which 3 ms to minimize.
[2024-05-20 21:19:49] [INFO ] Deduced a trap composed of 29 places in 180 ms of which 3 ms to minimize.
[2024-05-20 21:19:49] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 3 ms to minimize.
[2024-05-20 21:19:49] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 2 ms to minimize.
[2024-05-20 21:19:49] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 2 ms to minimize.
[2024-05-20 21:19:50] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 3 ms to minimize.
[2024-05-20 21:19:50] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 3 ms to minimize.
[2024-05-20 21:19:50] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 2 ms to minimize.
[2024-05-20 21:19:50] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 3 ms to minimize.
[2024-05-20 21:19:50] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 3 ms to minimize.
[2024-05-20 21:19:50] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 3 ms to minimize.
[2024-05-20 21:19:51] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 3 ms to minimize.
[2024-05-20 21:19:51] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 3 ms to minimize.
[2024-05-20 21:19:51] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 2 ms to minimize.
[2024-05-20 21:19:51] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 2 ms to minimize.
[2024-05-20 21:19:51] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 2 ms to minimize.
[2024-05-20 21:19:51] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/523 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:19:52] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 2 ms to minimize.
[2024-05-20 21:19:52] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2024-05-20 21:19:52] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:19:52] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-20 21:19:52] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-05-20 21:19:52] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 1 ms to minimize.
[2024-05-20 21:19:52] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-05-20 21:19:52] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2024-05-20 21:19:52] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:19:53] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:19:53] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:19:53] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/523 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/523 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1661/2184 variables, 523/579 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2184 variables, 1594/2173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2184 variables, 3/2176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2184 variables, 0/2176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/2186 variables, 2/2178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2186 variables, 0/2178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/2186 variables, 0/2178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2186/2186 variables, and 2178 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6046 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 525/525 constraints, ReadFeed: 1594/1594 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 34/34 constraints]
After SMT, in 6937ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 95 ms.
Support contains 4 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 19 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 525/525 places, 1661/1661 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 22 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
[2024-05-20 21:19:54] [INFO ] Invariant cache hit.
[2024-05-20 21:19:54] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-20 21:19:54] [INFO ] Invariant cache hit.
[2024-05-20 21:19:55] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2024-05-20 21:19:59] [INFO ] Implicit Places using invariants and state equation in 4613 ms returned []
Implicit Place search using SMT with State Equation took 4972 ms to find 0 implicit places.
[2024-05-20 21:19:59] [INFO ] Redundant transitions in 27 ms returned []
Running 1641 sub problems to find dead transitions.
[2024-05-20 21:19:59] [INFO ] Invariant cache hit.
[2024-05-20 21:19:59] [INFO ] State equation strengthened by 1594 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/524 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/524 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:20:13] [INFO ] Deduced a trap composed of 2 places in 208 ms of which 3 ms to minimize.
[2024-05-20 21:20:13] [INFO ] Deduced a trap composed of 30 places in 195 ms of which 2 ms to minimize.
[2024-05-20 21:20:13] [INFO ] Deduced a trap composed of 30 places in 188 ms of which 3 ms to minimize.
[2024-05-20 21:20:13] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 3 ms to minimize.
[2024-05-20 21:20:13] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 2 ms to minimize.
[2024-05-20 21:20:14] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 3 ms to minimize.
[2024-05-20 21:20:14] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 3 ms to minimize.
[2024-05-20 21:20:14] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 2 ms to minimize.
[2024-05-20 21:20:14] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 3 ms to minimize.
[2024-05-20 21:20:14] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 2 ms to minimize.
[2024-05-20 21:20:14] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 3 ms to minimize.
[2024-05-20 21:20:15] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 3 ms to minimize.
[2024-05-20 21:20:15] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 2 ms to minimize.
[2024-05-20 21:20:15] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 2 ms to minimize.
[2024-05-20 21:20:15] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 2 ms to minimize.
[2024-05-20 21:20:15] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-05-20 21:20:15] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2024-05-20 21:20:15] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 2 ms to minimize.
[2024-05-20 21:20:15] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-20 21:20:16] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/524 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:20:16] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 2 ms to minimize.
[2024-05-20 21:20:16] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 2 ms to minimize.
[2024-05-20 21:20:16] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-20 21:20:17] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:20:17] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-20 21:20:17] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2024-05-20 21:20:17] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-05-20 21:20:17] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 1 ms to minimize.
[2024-05-20 21:20:17] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
[2024-05-20 21:20:17] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:20:17] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:20:17] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 2 ms to minimize.
[2024-05-20 21:20:17] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:20:17] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:20:18] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:20:18] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:20:18] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-05-20 21:20:18] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:20:18] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:20:18] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/524 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 524/2186 variables, and 62 constraints, problems are : Problem set: 0 solved, 1641 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/525 constraints, ReadFeed: 0/1594 constraints, PredecessorRefiner: 1641/1641 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1641 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/524 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/524 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/524 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:20:31] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 3 ms to minimize.
[2024-05-20 21:20:31] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 3 ms to minimize.
[2024-05-20 21:20:31] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-20 21:20:31] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 2 ms to minimize.
[2024-05-20 21:20:32] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 2 ms to minimize.
[2024-05-20 21:20:32] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 2 ms to minimize.
[2024-05-20 21:20:32] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 3 ms to minimize.
[2024-05-20 21:20:32] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 3 ms to minimize.
[2024-05-20 21:20:32] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2024-05-20 21:20:32] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 3 ms to minimize.
[2024-05-20 21:20:32] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 2 ms to minimize.
[2024-05-20 21:20:33] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 2 ms to minimize.
[2024-05-20 21:20:33] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 2 ms to minimize.
[2024-05-20 21:20:33] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 2 ms to minimize.
[2024-05-20 21:20:33] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 3 ms to minimize.
[2024-05-20 21:20:33] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 2 ms to minimize.
[2024-05-20 21:20:33] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 2 ms to minimize.
[2024-05-20 21:20:33] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 2 ms to minimize.
[2024-05-20 21:20:34] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 3 ms to minimize.
[2024-05-20 21:20:34] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/524 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:20:35] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 2 ms to minimize.
[2024-05-20 21:20:35] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-20 21:20:35] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-05-20 21:20:35] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 2 ms to minimize.
[2024-05-20 21:20:35] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 2 ms to minimize.
[2024-05-20 21:20:35] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 2 ms to minimize.
[2024-05-20 21:20:35] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 ms to minimize.
[2024-05-20 21:20:35] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-20 21:20:36] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-05-20 21:20:36] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 1 ms to minimize.
[2024-05-20 21:20:36] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-20 21:20:36] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-05-20 21:20:36] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-05-20 21:20:36] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-20 21:20:36] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-05-20 21:20:36] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-05-20 21:20:36] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-05-20 21:20:37] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 1 ms to minimize.
[2024-05-20 21:20:37] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:20:37] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:20:37] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 2 ms to minimize.
[2024-05-20 21:20:37] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2024-05-20 21:20:37] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 2 ms to minimize.
[2024-05-20 21:20:38] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 2 ms to minimize.
[2024-05-20 21:20:38] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
[2024-05-20 21:20:38] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
[2024-05-20 21:20:38] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:20:38] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:20:38] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 1 ms to minimize.
[2024-05-20 21:20:38] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-05-20 21:20:38] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:20:38] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2024-05-20 21:20:39] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-20 21:20:39] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:20:39] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-20 21:20:39] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:20:39] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-05-20 21:20:39] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-20 21:20:39] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:20:39] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:20:40] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-20 21:20:40] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-05-20 21:20:40] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2024-05-20 21:20:40] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
[2024-05-20 21:20:40] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
[2024-05-20 21:20:40] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:20:40] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:20:40] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-20 21:20:41] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:20:41] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:20:41] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:20:41] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:20:41] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:20:41] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:20:41] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:20:41] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:20:41] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:20:41] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:20:41] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:20:47] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:20:47] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2024-05-20 21:20:47] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:20:47] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:20:47] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:20:48] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:20:48] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:20:48] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-20 21:20:48] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:20:48] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:20:48] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 2 ms to minimize.
[2024-05-20 21:20:48] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 2 ms to minimize.
[2024-05-20 21:20:48] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:20:48] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:20:49] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:20:49] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:20:49] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-20 21:20:49] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:20:49] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:20:49] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:20:49] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:20:49] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:20:49] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:20:49] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-20 21:20:50] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:20:50] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:20:50] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:20:50] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-20 21:20:50] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 3 ms to minimize.
[2024-05-20 21:20:50] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:20:50] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:20:50] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:20:50] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:20:50] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:20:50] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:20:51] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 3 ms to minimize.
[2024-05-20 21:20:51] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 2 ms to minimize.
[2024-05-20 21:20:51] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 2 ms to minimize.
[2024-05-20 21:20:51] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 2 ms to minimize.
[2024-05-20 21:20:51] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 2 ms to minimize.
[2024-05-20 21:20:51] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:20:52] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:20:52] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:20:52] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
[2024-05-20 21:20:52] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:20:52] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:20:52] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:20:53] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:20:53] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:20:53] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
[2024-05-20 21:20:53] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2024-05-20 21:20:53] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:20:53] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:20:53] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:20:53] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:20:53] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:20:53] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:20:53] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:20:53] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:20:53] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:20:53] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/524 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:20:54] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 2 ms to minimize.
[2024-05-20 21:20:54] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 2 ms to minimize.
[2024-05-20 21:20:55] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 2 ms to minimize.
[2024-05-20 21:20:55] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 2 ms to minimize.
[2024-05-20 21:20:55] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 2 ms to minimize.
[2024-05-20 21:20:55] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 2 ms to minimize.
[2024-05-20 21:20:55] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 2 ms to minimize.
[2024-05-20 21:20:55] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 2 ms to minimize.
[2024-05-20 21:20:55] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 2 ms to minimize.
[2024-05-20 21:20:55] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2024-05-20 21:20:56] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-20 21:20:56] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 2 ms to minimize.
[2024-05-20 21:20:56] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2024-05-20 21:20:56] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
[2024-05-20 21:20:56] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:20:56] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:20:56] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-05-20 21:20:56] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-20 21:20:56] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:20:56] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/524 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:20:57] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:20:57] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
[2024-05-20 21:20:57] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:20:57] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:20:57] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:20:57] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-20 21:20:58] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:20:58] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-20 21:20:58] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-20 21:20:58] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-20 21:20:58] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
[2024-05-20 21:20:58] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-20 21:20:58] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-20 21:20:58] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-20 21:20:58] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:20:58] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:20:58] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:20:58] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:20:58] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
[2024-05-20 21:20:59] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/524 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:20:59] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:20:59] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:20:59] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 0 ms to minimize.
[2024-05-20 21:20:59] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:20:59] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:21:00] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
SMT process timed out in 60672ms, After SMT, problems are : Problem set: 0 solved, 1641 unsolved
Search for dead transitions found 0 dead transitions in 60685ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65715 ms. Remains : 525/525 places, 1661/1661 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1530 edges and 525 vertex of which 437 / 525 are part of one of the 2 SCC in 0 ms
Free SCC test removed 435 places
Drop transitions (Empty/Sink Transition effects.) removed 1154 transitions
Ensure Unique test removed 407 transitions
Reduce isomorphic transitions removed 1561 transitions.
Graph (complete) has 222 edges and 90 vertex of which 29 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 29 transition count 40
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 60 place count 11 transition count 22
Iterating global reduction 1 with 18 rules applied. Total rules applied 78 place count 11 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 10 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 10 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 9 transition count 17
Applied a total of 84 rules in 4 ms. Remains 9 /525 variables (removed 516) and now considering 17/1661 (removed 1644) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 17 rows 9 cols
[2024-05-20 21:21:00] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 21:21:00] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 21:21:00] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-20 21:21:00] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-20 21:21:00] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 61 ms.
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 9 factoid took 129 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 972 reset in 427 ms.
Product exploration explored 100000 steps with 967 reset in 439 ms.
Built C files in :
/tmp/ltsmin2838092947853285413
[2024-05-20 21:21:01] [INFO ] Too many transitions (1662) to apply POR reductions. Disabling POR matrices.
[2024-05-20 21:21:01] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2838092947853285413
Running compilation step : cd /tmp/ltsmin2838092947853285413;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2838092947853285413;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2838092947853285413;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Applied a total of 0 rules in 19 ms. Remains 526 /526 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
// Phase 1: matrix 1662 rows 526 cols
[2024-05-20 21:21:04] [INFO ] Computed 22 invariants in 10 ms
[2024-05-20 21:21:04] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-20 21:21:04] [INFO ] Invariant cache hit.
[2024-05-20 21:21:05] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 21:21:06] [INFO ] Implicit Places using invariants and state equation in 1837 ms returned []
Implicit Place search using SMT with State Equation took 2052 ms to find 0 implicit places.
[2024-05-20 21:21:06] [INFO ] Redundant transitions in 23 ms returned []
Running 1642 sub problems to find dead transitions.
[2024-05-20 21:21:06] [INFO ] Invariant cache hit.
[2024-05-20 21:21:06] [INFO ] State equation strengthened by 1177 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:21:20] [INFO ] Deduced a trap composed of 22 places in 194 ms of which 3 ms to minimize.
[2024-05-20 21:21:21] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 2 ms to minimize.
[2024-05-20 21:21:21] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 3 ms to minimize.
[2024-05-20 21:21:21] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 3 ms to minimize.
[2024-05-20 21:21:21] [INFO ] Deduced a trap composed of 2 places in 149 ms of which 3 ms to minimize.
[2024-05-20 21:21:21] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:21:21] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:21:21] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:21:21] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:21:21] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:21:22] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:21:22] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:21:22] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:21:22] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:21:22] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:21:22] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-05-20 21:21:22] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:21:22] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:21:22] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-20 21:21:22] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:21:23] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-20 21:21:23] [INFO ] Deduced a trap composed of 26 places in 183 ms of which 3 ms to minimize.
[2024-05-20 21:21:23] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 3 ms to minimize.
[2024-05-20 21:21:23] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 3 ms to minimize.
[2024-05-20 21:21:23] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 3 ms to minimize.
[2024-05-20 21:21:24] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 3 ms to minimize.
[2024-05-20 21:21:24] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 3 ms to minimize.
[2024-05-20 21:21:24] [INFO ] Deduced a trap composed of 26 places in 183 ms of which 3 ms to minimize.
[2024-05-20 21:21:24] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 3 ms to minimize.
[2024-05-20 21:21:24] [INFO ] Deduced a trap composed of 30 places in 191 ms of which 2 ms to minimize.
[2024-05-20 21:21:25] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 4 ms to minimize.
[2024-05-20 21:21:25] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 2 ms to minimize.
[2024-05-20 21:21:25] [INFO ] Deduced a trap composed of 26 places in 193 ms of which 3 ms to minimize.
[2024-05-20 21:21:25] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 2 ms to minimize.
[2024-05-20 21:21:25] [INFO ] Deduced a trap composed of 26 places in 183 ms of which 3 ms to minimize.
[2024-05-20 21:21:25] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 3 ms to minimize.
[2024-05-20 21:21:26] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 3 ms to minimize.
[2024-05-20 21:21:26] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 2 ms to minimize.
[2024-05-20 21:21:26] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 2 ms to minimize.
[2024-05-20 21:21:26] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/2188 variables, and 62 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/526 constraints, ReadFeed: 0/1177 constraints, PredecessorRefiner: 1642/1642 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1642 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:21:38] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 2 ms to minimize.
[2024-05-20 21:21:38] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
[2024-05-20 21:21:38] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
[2024-05-20 21:21:38] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 1 ms to minimize.
[2024-05-20 21:21:38] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 1 ms to minimize.
[2024-05-20 21:21:39] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2024-05-20 21:21:39] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2024-05-20 21:21:39] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:21:39] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:21:39] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:21:39] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:21:39] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:21:39] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:21:39] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:21:39] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2024-05-20 21:21:39] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:21:39] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:21:40] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:21:40] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:21:40] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:21:40] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 2 ms to minimize.
[2024-05-20 21:21:41] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
[2024-05-20 21:21:41] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 2 ms to minimize.
[2024-05-20 21:21:41] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 2 ms to minimize.
[2024-05-20 21:21:41] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2024-05-20 21:21:41] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 1 ms to minimize.
[2024-05-20 21:21:41] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-05-20 21:21:41] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-20 21:21:41] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:21:41] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2024-05-20 21:21:42] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 1 ms to minimize.
[2024-05-20 21:21:42] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-05-20 21:21:42] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:21:42] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
[2024-05-20 21:21:42] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:21:42] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-05-20 21:21:42] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-05-20 21:21:42] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:21:42] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-05-20 21:21:42] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:21:43] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 3 ms to minimize.
[2024-05-20 21:21:43] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:21:43] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-20 21:21:43] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:21:43] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-20 21:21:44] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
[2024-05-20 21:21:44] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:21:44] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-20 21:21:44] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:21:44] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-20 21:21:44] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:21:44] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-20 21:21:44] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:21:44] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:21:44] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:21:45] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 2 ms to minimize.
[2024-05-20 21:21:45] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 2 ms to minimize.
[2024-05-20 21:21:45] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 2 ms to minimize.
[2024-05-20 21:21:45] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 2 ms to minimize.
[2024-05-20 21:21:45] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:21:46] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-05-20 21:21:46] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:21:46] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-20 21:21:46] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2024-05-20 21:21:46] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:21:46] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-20 21:21:47] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-05-20 21:21:47] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:21:47] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
[2024-05-20 21:21:47] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:21:47] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2024-05-20 21:21:47] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:21:47] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:21:47] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:21:47] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:21:47] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:21:47] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-20 21:21:47] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-05-20 21:21:47] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:21:47] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:21:48] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:21:48] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:21:48] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:21:48] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:21:48] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:21:48] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-05-20 21:21:48] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:21:48] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:21:48] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 0 ms to minimize.
[2024-05-20 21:21:48] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 0 ms to minimize.
[2024-05-20 21:21:48] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:21:48] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:21:48] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:21:49] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:21:49] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-20 21:21:49] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:21:49] [INFO ] Deduced a trap composed of 28 places in 177 ms of which 2 ms to minimize.
[2024-05-20 21:21:49] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 3 ms to minimize.
[2024-05-20 21:21:49] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 3 ms to minimize.
[2024-05-20 21:21:50] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:21:51] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:21:51] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:21:51] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:21:51] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-20 21:21:51] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-05-20 21:21:51] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2024-05-20 21:21:51] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2024-05-20 21:21:51] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-05-20 21:21:51] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:21:51] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:21:51] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2024-05-20 21:21:52] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:21:52] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:21:52] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:21:52] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:21:52] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:21:52] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 2 ms to minimize.
[2024-05-20 21:21:52] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:21:52] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:21:52] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:21:53] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:21:53] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:21:53] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:21:53] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:21:53] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:21:53] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:21:53] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:21:54] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 1 ms to minimize.
[2024-05-20 21:21:54] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-05-20 21:21:54] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:21:54] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:21:54] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2024-05-20 21:21:54] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-05-20 21:21:54] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:21:54] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:21:54] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:21:54] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:21:54] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:21:54] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:21:55] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:21:55] [INFO ] Deduced a trap composed of 2 places in 142 ms of which 2 ms to minimize.
[2024-05-20 21:21:55] [INFO ] Deduced a trap composed of 2 places in 151 ms of which 2 ms to minimize.
[2024-05-20 21:21:56] [INFO ] Deduced a trap composed of 2 places in 158 ms of which 2 ms to minimize.
[2024-05-20 21:21:56] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 6 ms to minimize.
[2024-05-20 21:21:56] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 3 ms to minimize.
[2024-05-20 21:21:56] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 3 ms to minimize.
[2024-05-20 21:21:56] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 3 ms to minimize.
[2024-05-20 21:21:57] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-20 21:21:57] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2024-05-20 21:21:57] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2024-05-20 21:21:57] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:21:57] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:21:57] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
[2024-05-20 21:21:57] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:21:57] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:21:57] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:21:57] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
[2024-05-20 21:21:57] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:21:57] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:21:58] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:21:58] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:21:58] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:21:58] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:21:59] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:21:59] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:21:59] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:21:59] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-20 21:21:59] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:21:59] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:21:59] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/2188 variables, and 232 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/526 constraints, ReadFeed: 0/1177 constraints, PredecessorRefiner: 0/1642 constraints, Known Traps: 210/210 constraints]
After SMT, in 60511ms problems are : Problem set: 0 solved, 1642 unsolved
Search for dead transitions found 0 dead transitions in 60524ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62633 ms. Remains : 526/526 places, 1662/1662 transitions.
Built C files in :
/tmp/ltsmin10915171227356703562
[2024-05-20 21:22:07] [INFO ] Too many transitions (1662) to apply POR reductions. Disabling POR matrices.
[2024-05-20 21:22:07] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10915171227356703562
Running compilation step : cd /tmp/ltsmin10915171227356703562;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10915171227356703562;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10915171227356703562;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-20 21:22:10] [INFO ] Flatten gal took : 46 ms
[2024-05-20 21:22:10] [INFO ] Flatten gal took : 43 ms
[2024-05-20 21:22:10] [INFO ] Time to serialize gal into /tmp/LTL7813862623205497033.gal : 8 ms
[2024-05-20 21:22:10] [INFO ] Time to serialize properties into /tmp/LTL7727530317987499648.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7813862623205497033.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16026351113977928436.hoa' '-atoms' '/tmp/LTL7727530317987499648.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7727530317987499648.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16026351113977928436.hoa
Detected timeout of ITS tools.
[2024-05-20 21:22:25] [INFO ] Flatten gal took : 26 ms
[2024-05-20 21:22:25] [INFO ] Flatten gal took : 27 ms
[2024-05-20 21:22:25] [INFO ] Time to serialize gal into /tmp/LTL15662994810461054639.gal : 5 ms
[2024-05-20 21:22:25] [INFO ] Time to serialize properties into /tmp/LTL1884825721223951986.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15662994810461054639.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1884825721223951986.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((("(Node10GiveAnswer19<3)")U((G("(Node10GiveAnswer19<3)"))||("((Node13ResZone<2)&&(Node10GiveAnswer19<3))")))U((G(("(Node10GiveAnsw...415
Formula 0 simplified : (!"(Node10GiveAnswer19<3)" M !"((Node13ResZone<2)&&(Node10GiveAnswer19<3))") R (F(!"((Node13ResZone<2)&&(Node10GiveAnswer19<3))" & !...310
Detected timeout of ITS tools.
[2024-05-20 21:22:40] [INFO ] Flatten gal took : 29 ms
[2024-05-20 21:22:40] [INFO ] Applying decomposition
[2024-05-20 21:22:40] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph443794600763660151.txt' '-o' '/tmp/graph443794600763660151.bin' '-w' '/tmp/graph443794600763660151.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph443794600763660151.bin' '-l' '-1' '-v' '-w' '/tmp/graph443794600763660151.weights' '-q' '0' '-e' '0.001'
[2024-05-20 21:22:40] [INFO ] Decomposing Gal with order
[2024-05-20 21:22:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 21:22:40] [INFO ] Removed a total of 1203 redundant transitions.
[2024-05-20 21:22:40] [INFO ] Flatten gal took : 88 ms
[2024-05-20 21:22:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 759 labels/synchronizations in 17 ms.
[2024-05-20 21:22:40] [INFO ] Time to serialize gal into /tmp/LTL7614704548854077813.gal : 7 ms
[2024-05-20 21:22:40] [INFO ] Time to serialize properties into /tmp/LTL81266365600282458.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7614704548854077813.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL81266365600282458.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...273
Read 1 LTL properties
Checking formula 0 : !(((("(gi0.gu21.Node10GiveAnswer19<3)")U((G("(gi0.gu21.Node10GiveAnswer19<3)"))||("((gi0.gu14.Node13ResZone<2)&&(gi0.gu21.Node10GiveAn...533
Formula 0 simplified : (!"(gi0.gu21.Node10GiveAnswer19<3)" M !"((gi0.gu14.Node13ResZone<2)&&(gi0.gu21.Node10GiveAnswer19<3))") R (F(!"((gi0.gu14.Node13ResZ...401
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-09 finished in 409567 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))&&G((p1||X((G(p2) U (p1&&G(p2))))))))'
Support contains 7 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 17 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2024-05-20 21:22:55] [INFO ] Computed 22 invariants in 31 ms
[2024-05-20 21:22:56] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-20 21:22:56] [INFO ] Invariant cache hit.
[2024-05-20 21:22:56] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 21:22:59] [INFO ] Implicit Places using invariants and state equation in 3387 ms returned []
Implicit Place search using SMT with State Equation took 3734 ms to find 0 implicit places.
Running 2500 sub problems to find dead transitions.
[2024-05-20 21:22:59] [INFO ] Invariant cache hit.
[2024-05-20 21:22:59] [INFO ] State equation strengthened by 780 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
SMT process timed out in 30764ms, After SMT, problems are : Problem set: 0 solved, 2500 unsolved
Search for dead transitions found 0 dead transitions in 30784ms
Finished structural reductions in LTL mode , in 1 iterations and 34545 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 20922 steps with 44 reset in 63 ms.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-10 finished in 34792 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((G(F(p1)) U p2))))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 23 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2024-05-20 21:23:30] [INFO ] Invariant cache hit.
[2024-05-20 21:23:30] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-20 21:23:30] [INFO ] Invariant cache hit.
[2024-05-20 21:23:31] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 21:23:34] [INFO ] Implicit Places using invariants and state equation in 3442 ms returned []
Implicit Place search using SMT with State Equation took 3752 ms to find 0 implicit places.
Running 2500 sub problems to find dead transitions.
[2024-05-20 21:23:34] [INFO ] Invariant cache hit.
[2024-05-20 21:23:34] [INFO ] State equation strengthened by 780 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
SMT process timed out in 30743ms, After SMT, problems are : Problem set: 0 solved, 2500 unsolved
Search for dead transitions found 0 dead transitions in 30766ms
Finished structural reductions in LTL mode , in 1 iterations and 34549 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p0) (NOT p2)), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-11
Product exploration explored 100000 steps with 33205 reset in 378 ms.
Product exploration explored 100000 steps with 33407 reset in 391 ms.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Detected a total of 82/1043 stabilizing places and 140/2520 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 278 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) p2 (NOT p1)), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (84 resets) in 727 ms. (54 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
[2024-05-20 21:24:07] [INFO ] Invariant cache hit.
[2024-05-20 21:24:07] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1000/1003 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-20 21:24:07] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:24:07] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:24:07] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2024-05-20 21:24:07] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:24:07] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 0 ms to minimize.
[2024-05-20 21:24:07] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
[2024-05-20 21:24:07] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
[2024-05-20 21:24:07] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-05-20 21:24:07] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:24:07] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:24:07] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:24:08] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-20 21:24:08] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:24:08] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:24:08] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-20 21:24:08] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1003 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 36/1039 variables, 18/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1039 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/1041 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1041 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2520/3561 variables, 1041/1079 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/3561 variables, 780/1859 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3561 variables, 0/1859 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/3563 variables, 2/1861 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3563 variables, 0/1861 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/3563 variables, 0/1861 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3563/3563 variables, and 1861 constraints, problems are : Problem set: 2 solved, 3 unsolved in 2783 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1043/1043 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 999/1001 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 16/17 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-20 21:24:10] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:24:10] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 2/19 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 38/1039 variables, 19/38 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1039 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/1041 variables, 2/40 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-20 21:24:10] [INFO ] Deduced a trap composed of 46 places in 439 ms of which 6 ms to minimize.
[2024-05-20 21:24:11] [INFO ] Deduced a trap composed of 41 places in 381 ms of which 5 ms to minimize.
[2024-05-20 21:24:11] [INFO ] Deduced a trap composed of 43 places in 388 ms of which 6 ms to minimize.
[2024-05-20 21:24:12] [INFO ] Deduced a trap composed of 46 places in 311 ms of which 5 ms to minimize.
[2024-05-20 21:24:12] [INFO ] Deduced a trap composed of 53 places in 295 ms of which 4 ms to minimize.
[2024-05-20 21:24:12] [INFO ] Deduced a trap composed of 40 places in 296 ms of which 4 ms to minimize.
[2024-05-20 21:24:12] [INFO ] Deduced a trap composed of 46 places in 258 ms of which 4 ms to minimize.
[2024-05-20 21:24:13] [INFO ] Deduced a trap composed of 49 places in 235 ms of which 3 ms to minimize.
[2024-05-20 21:24:13] [INFO ] Deduced a trap composed of 46 places in 226 ms of which 4 ms to minimize.
[2024-05-20 21:24:13] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 4 ms to minimize.
[2024-05-20 21:24:13] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 3 ms to minimize.
[2024-05-20 21:24:13] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 2 ms to minimize.
[2024-05-20 21:24:14] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 3 ms to minimize.
[2024-05-20 21:24:14] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 3 ms to minimize.
[2024-05-20 21:24:14] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 2 ms to minimize.
[2024-05-20 21:24:14] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 3 ms to minimize.
[2024-05-20 21:24:14] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 2 ms to minimize.
[2024-05-20 21:24:14] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 3 ms to minimize.
[2024-05-20 21:24:15] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 2 ms to minimize.
SMT process timed out in 7834ms, After SMT, problems are : Problem set: 2 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1043 transition count 2380
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 903 transition count 2380
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 0 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 2 with 758 rules applied. Total rules applied 1038 place count 524 transition count 2001
Drop transitions (Redundant composition of simpler transitions.) removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 2 with 341 rules applied. Total rules applied 1379 place count 524 transition count 1660
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1380 place count 524 transition count 1659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1381 place count 523 transition count 1659
Partial Free-agglomeration rule applied 420 times.
Drop transitions (Partial Free agglomeration) removed 420 transitions
Iterating global reduction 3 with 420 rules applied. Total rules applied 1801 place count 523 transition count 1659
Applied a total of 1801 rules in 133 ms. Remains 523 /1043 variables (removed 520) and now considering 1659/2520 (removed 861) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 523/1043 places, 1659/2520 transitions.
RANDOM walk for 40000 steps (422 resets) in 1018 ms. (39 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (17 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (16 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (17 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 307055 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 3
Probabilistic random walk after 307055 steps, saw 42399 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
// Phase 1: matrix 1659 rows 523 cols
[2024-05-20 21:24:18] [INFO ] Computed 22 invariants in 18 ms
[2024-05-20 21:24:18] [INFO ] State equation strengthened by 1596 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 479/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:24:18] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:24:19] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 3 ms to minimize.
[2024-05-20 21:24:19] [INFO ] Deduced a trap composed of 36 places in 219 ms of which 3 ms to minimize.
[2024-05-20 21:24:19] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 3 ms to minimize.
[2024-05-20 21:24:19] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 3 ms to minimize.
[2024-05-20 21:24:19] [INFO ] Deduced a trap composed of 27 places in 183 ms of which 3 ms to minimize.
[2024-05-20 21:24:20] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 2 ms to minimize.
[2024-05-20 21:24:20] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 2 ms to minimize.
[2024-05-20 21:24:20] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 2 ms to minimize.
[2024-05-20 21:24:20] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 2 ms to minimize.
[2024-05-20 21:24:20] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 3 ms to minimize.
[2024-05-20 21:24:21] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 2 ms to minimize.
[2024-05-20 21:24:21] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 2 ms to minimize.
[2024-05-20 21:24:21] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 2 ms to minimize.
[2024-05-20 21:24:21] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 2 ms to minimize.
[2024-05-20 21:24:21] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 2 ms to minimize.
[2024-05-20 21:24:21] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 2 ms to minimize.
[2024-05-20 21:24:21] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 2 ms to minimize.
[2024-05-20 21:24:22] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 2 ms to minimize.
[2024-05-20 21:24:22] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 2 ms to minimize.
[2024-05-20 21:24:22] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:24:22] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 2 ms to minimize.
[2024-05-20 21:24:22] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2024-05-20 21:24:22] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 1 ms to minimize.
[2024-05-20 21:24:22] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-05-20 21:24:22] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:24:22] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:24:23] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:24:23] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:24:23] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:24:23] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1659/2180 variables, 521/574 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2180 variables, 1596/2170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2180 variables, 0/2170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/2182 variables, 2/2172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2182 variables, 0/2172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/2182 variables, 0/2172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2182/2182 variables, and 2172 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5633 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1596/1596 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 479/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 30/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:24:24] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 3 ms to minimize.
[2024-05-20 21:24:24] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 3 ms to minimize.
[2024-05-20 21:24:25] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 3 ms to minimize.
[2024-05-20 21:24:25] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 3 ms to minimize.
[2024-05-20 21:24:25] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 3 ms to minimize.
[2024-05-20 21:24:25] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 4 ms to minimize.
[2024-05-20 21:24:25] [INFO ] Deduced a trap composed of 28 places in 191 ms of which 3 ms to minimize.
[2024-05-20 21:24:26] [INFO ] Deduced a trap composed of 27 places in 183 ms of which 3 ms to minimize.
[2024-05-20 21:24:26] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 3 ms to minimize.
[2024-05-20 21:24:26] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 2 ms to minimize.
[2024-05-20 21:24:26] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 2 ms to minimize.
[2024-05-20 21:24:26] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 3 ms to minimize.
[2024-05-20 21:24:26] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 2 ms to minimize.
[2024-05-20 21:24:26] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 3 ms to minimize.
[2024-05-20 21:24:27] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 2 ms to minimize.
[2024-05-20 21:24:27] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 2 ms to minimize.
[2024-05-20 21:24:27] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 2 ms to minimize.
[2024-05-20 21:24:27] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-05-20 21:24:27] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-05-20 21:24:27] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:24:27] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:24:27] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:24:27] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2024-05-20 21:24:28] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-20 21:24:28] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:24:28] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:24:28] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-20 21:24:28] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 8/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1659/2180 variables, 521/602 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2180 variables, 1596/2198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2180 variables, 3/2201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2180 variables, 0/2201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/2182 variables, 2/2203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2182 variables, 0/2203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/2182 variables, 0/2203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2182/2182 variables, and 2203 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6261 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1596/1596 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 59/59 constraints]
After SMT, in 11945ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 508 ms.
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 19 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 523/523 places, 1659/1659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 19 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2024-05-20 21:24:31] [INFO ] Invariant cache hit.
[2024-05-20 21:24:31] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-20 21:24:31] [INFO ] Invariant cache hit.
[2024-05-20 21:24:31] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2024-05-20 21:24:36] [INFO ] Implicit Places using invariants and state equation in 4763 ms returned []
Implicit Place search using SMT with State Equation took 5123 ms to find 0 implicit places.
[2024-05-20 21:24:36] [INFO ] Redundant transitions in 28 ms returned []
Running 1639 sub problems to find dead transitions.
[2024-05-20 21:24:36] [INFO ] Invariant cache hit.
[2024-05-20 21:24:36] [INFO ] State equation strengthened by 1596 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:24:49] [INFO ] Deduced a trap composed of 2 places in 224 ms of which 3 ms to minimize.
[2024-05-20 21:24:50] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 2 ms to minimize.
[2024-05-20 21:24:50] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 2 ms to minimize.
[2024-05-20 21:24:50] [INFO ] Deduced a trap composed of 28 places in 176 ms of which 2 ms to minimize.
[2024-05-20 21:24:50] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 2 ms to minimize.
[2024-05-20 21:24:50] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 2 ms to minimize.
[2024-05-20 21:24:51] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 2 ms to minimize.
[2024-05-20 21:24:51] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 2 ms to minimize.
[2024-05-20 21:24:51] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 2 ms to minimize.
[2024-05-20 21:24:51] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 2 ms to minimize.
[2024-05-20 21:24:51] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 2 ms to minimize.
[2024-05-20 21:24:51] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 2 ms to minimize.
[2024-05-20 21:24:51] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 2 ms to minimize.
[2024-05-20 21:24:52] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 2 ms to minimize.
[2024-05-20 21:24:52] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 2 ms to minimize.
[2024-05-20 21:24:52] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 2 ms to minimize.
[2024-05-20 21:24:52] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2024-05-20 21:24:52] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
[2024-05-20 21:24:52] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:24:52] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:24:53] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 2 ms to minimize.
[2024-05-20 21:24:53] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 2 ms to minimize.
[2024-05-20 21:24:53] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 1 ms to minimize.
[2024-05-20 21:24:53] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:24:53] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-05-20 21:24:54] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 2 ms to minimize.
[2024-05-20 21:24:54] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2024-05-20 21:24:54] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-05-20 21:24:54] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2024-05-20 21:24:54] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 1 ms to minimize.
[2024-05-20 21:24:54] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2024-05-20 21:24:54] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:24:54] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:24:54] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:24:54] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:24:55] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:24:55] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:24:55] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:24:55] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:24:55] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 522/2182 variables, and 62 constraints, problems are : Problem set: 0 solved, 1639 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/523 constraints, ReadFeed: 0/1596 constraints, PredecessorRefiner: 1639/1639 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1639 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:25:08] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-05-20 21:25:08] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
[2024-05-20 21:25:08] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:25:08] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:25:08] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:25:08] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:25:08] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:25:08] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-20 21:25:09] [INFO ] Deduced a trap composed of 36 places in 197 ms of which 3 ms to minimize.
[2024-05-20 21:25:09] [INFO ] Deduced a trap composed of 32 places in 189 ms of which 2 ms to minimize.
[2024-05-20 21:25:09] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-20 21:25:09] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
[2024-05-20 21:25:09] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:25:09] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:25:09] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-05-20 21:25:09] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:25:10] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 1 ms to minimize.
[2024-05-20 21:25:10] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2024-05-20 21:25:10] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2024-05-20 21:25:10] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:25:10] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:25:10] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:25:10] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:25:11] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:25:11] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:25:11] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:25:11] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:25:11] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:25:11] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:25:11] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:25:11] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:25:11] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:25:11] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:25:11] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:25:11] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:25:11] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:25:11] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:25:12] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:25:12] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:25:12] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:25:12] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:25:25] [INFO ] Deduced a trap composed of 26 places in 212 ms of which 3 ms to minimize.
[2024-05-20 21:25:25] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 3 ms to minimize.
[2024-05-20 21:25:26] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 3 ms to minimize.
[2024-05-20 21:25:26] [INFO ] Deduced a trap composed of 26 places in 233 ms of which 3 ms to minimize.
[2024-05-20 21:25:26] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 3 ms to minimize.
[2024-05-20 21:25:26] [INFO ] Deduced a trap composed of 29 places in 204 ms of which 3 ms to minimize.
[2024-05-20 21:25:27] [INFO ] Deduced a trap composed of 28 places in 261 ms of which 3 ms to minimize.
[2024-05-20 21:25:27] [INFO ] Deduced a trap composed of 33 places in 221 ms of which 3 ms to minimize.
[2024-05-20 21:25:27] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 2 ms to minimize.
[2024-05-20 21:25:27] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 2 ms to minimize.
[2024-05-20 21:25:27] [INFO ] Deduced a trap composed of 31 places in 203 ms of which 2 ms to minimize.
[2024-05-20 21:25:28] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 3 ms to minimize.
[2024-05-20 21:25:28] [INFO ] Deduced a trap composed of 26 places in 232 ms of which 3 ms to minimize.
[2024-05-20 21:25:28] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 3 ms to minimize.
[2024-05-20 21:25:28] [INFO ] Deduced a trap composed of 27 places in 196 ms of which 3 ms to minimize.
[2024-05-20 21:25:29] [INFO ] Deduced a trap composed of 53 places in 203 ms of which 3 ms to minimize.
[2024-05-20 21:25:29] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2024-05-20 21:25:29] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 2 ms to minimize.
[2024-05-20 21:25:29] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:25:30] [INFO ] Deduced a trap composed of 3 places in 208 ms of which 3 ms to minimize.
[2024-05-20 21:25:30] [INFO ] Deduced a trap composed of 3 places in 200 ms of which 3 ms to minimize.
[2024-05-20 21:25:30] [INFO ] Deduced a trap composed of 2 places in 218 ms of which 3 ms to minimize.
[2024-05-20 21:25:30] [INFO ] Deduced a trap composed of 2 places in 217 ms of which 3 ms to minimize.
[2024-05-20 21:25:31] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 3 ms to minimize.
[2024-05-20 21:25:31] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 3 ms to minimize.
[2024-05-20 21:25:31] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:25:31] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:25:31] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:25:31] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 2 ms to minimize.
[2024-05-20 21:25:31] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
[2024-05-20 21:25:32] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 2 ms to minimize.
[2024-05-20 21:25:32] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-05-20 21:25:32] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-05-20 21:25:32] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:25:32] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:25:32] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:25:32] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:25:32] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:25:32] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:25:33] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 2 ms to minimize.
[2024-05-20 21:25:33] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 2 ms to minimize.
[2024-05-20 21:25:34] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2024-05-20 21:25:34] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 2 ms to minimize.
[2024-05-20 21:25:34] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-05-20 21:25:34] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-20 21:25:34] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 1 ms to minimize.
[2024-05-20 21:25:34] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-05-20 21:25:34] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2024-05-20 21:25:34] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-20 21:25:34] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2024-05-20 21:25:35] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-05-20 21:25:35] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2024-05-20 21:25:35] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 1 ms to minimize.
[2024-05-20 21:25:35] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:25:35] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:25:35] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
[2024-05-20 21:25:35] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:25:35] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-05-20 21:25:35] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:25:36] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:25:36] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 1 ms to minimize.
[2024-05-20 21:25:36] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:25:36] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-05-20 21:25:37] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 1 ms to minimize.
SMT process timed out in 60846ms, After SMT, problems are : Problem set: 0 solved, 1639 unsolved
Search for dead transitions found 0 dead transitions in 60860ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66045 ms. Remains : 523/523 places, 1659/1659 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1532 edges and 523 vertex of which 438 / 523 are part of one of the 2 SCC in 0 ms
Free SCC test removed 436 places
Drop transitions (Empty/Sink Transition effects.) removed 1155 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1567 transitions.
Graph (complete) has 214 edges and 87 vertex of which 26 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 26 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 25 transition count 31
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 7 transition count 13
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 place count 7 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 7 transition count 10
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 6 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 5 transition count 8
Applied a total of 87 rules in 5 ms. Remains 5 /523 variables (removed 518) and now considering 8/1659 (removed 1651) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 8 rows 5 cols
[2024-05-20 21:25:37] [INFO ] Computed 0 invariants in 1 ms
[2024-05-20 21:25:37] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 21:25:37] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-20 21:25:37] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-20 21:25:37] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 74 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p2 p1)), (G (OR p0 (NOT p2) p1))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (AND p0 (NOT p2)))), (F p2), (F (NOT p1))]
Knowledge based reduction with 21 factoid took 439 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter insensitive) to 6 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) p2 (NOT p1)), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) p2 (NOT p1)), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 1043 transition count 2383
Reduce places removed 137 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 138 rules applied. Total rules applied 275 place count 906 transition count 2382
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 276 place count 905 transition count 2382
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 1 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 3 with 758 rules applied. Total rules applied 1034 place count 526 transition count 2003
Drop transitions (Redundant composition of simpler transitions.) removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 3 with 341 rules applied. Total rules applied 1375 place count 526 transition count 1662
Applied a total of 1375 rules in 93 ms. Remains 526 /1043 variables (removed 517) and now considering 1662/2520 (removed 858) transitions.
// Phase 1: matrix 1662 rows 526 cols
[2024-05-20 21:25:38] [INFO ] Computed 22 invariants in 17 ms
[2024-05-20 21:25:38] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-20 21:25:38] [INFO ] Invariant cache hit.
[2024-05-20 21:25:38] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 21:25:40] [INFO ] Implicit Places using invariants and state equation in 1812 ms returned []
Implicit Place search using SMT with State Equation took 2042 ms to find 0 implicit places.
[2024-05-20 21:25:40] [INFO ] Redundant transitions in 28 ms returned []
Running 1642 sub problems to find dead transitions.
[2024-05-20 21:25:40] [INFO ] Invariant cache hit.
[2024-05-20 21:25:40] [INFO ] State equation strengthened by 1177 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:25:53] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:25:53] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:25:53] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:25:53] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:25:53] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-05-20 21:25:53] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-05-20 21:25:54] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2024-05-20 21:25:54] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 3 ms to minimize.
[2024-05-20 21:25:54] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 2 ms to minimize.
[2024-05-20 21:25:54] [INFO ] Deduced a trap composed of 22 places in 190 ms of which 3 ms to minimize.
[2024-05-20 21:25:54] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 3 ms to minimize.
[2024-05-20 21:25:55] [INFO ] Deduced a trap composed of 2 places in 169 ms of which 3 ms to minimize.
[2024-05-20 21:25:55] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 3 ms to minimize.
[2024-05-20 21:25:55] [INFO ] Deduced a trap composed of 2 places in 165 ms of which 2 ms to minimize.
[2024-05-20 21:25:55] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:25:55] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-05-20 21:25:55] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-20 21:25:55] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2024-05-20 21:25:55] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2024-05-20 21:25:56] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:25:56] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 3 ms to minimize.
[2024-05-20 21:25:56] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 2 ms to minimize.
[2024-05-20 21:25:57] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
[2024-05-20 21:25:57] [INFO ] Deduced a trap composed of 34 places in 156 ms of which 2 ms to minimize.
[2024-05-20 21:25:57] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 2 ms to minimize.
[2024-05-20 21:25:57] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 2 ms to minimize.
[2024-05-20 21:25:57] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 2 ms to minimize.
[2024-05-20 21:25:57] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 2 ms to minimize.
[2024-05-20 21:25:58] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 2 ms to minimize.
[2024-05-20 21:25:58] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 2 ms to minimize.
[2024-05-20 21:25:58] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 2 ms to minimize.
[2024-05-20 21:25:58] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 2 ms to minimize.
[2024-05-20 21:25:58] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 2 ms to minimize.
[2024-05-20 21:25:58] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 1 ms to minimize.
[2024-05-20 21:25:58] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2024-05-20 21:25:58] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 2 ms to minimize.
[2024-05-20 21:25:59] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 1 ms to minimize.
[2024-05-20 21:25:59] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2024-05-20 21:25:59] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:25:59] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/2188 variables, and 62 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/526 constraints, ReadFeed: 0/1177 constraints, PredecessorRefiner: 1642/1642 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1642 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:26:12] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 2 ms to minimize.
[2024-05-20 21:26:12] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:26:12] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
[2024-05-20 21:26:12] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2024-05-20 21:26:12] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-05-20 21:26:12] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:26:12] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2024-05-20 21:26:13] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:26:13] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-20 21:26:13] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:26:13] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:26:13] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:26:13] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-20 21:26:13] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:26:13] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:26:13] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:26:13] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:26:14] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 3 ms to minimize.
[2024-05-20 21:26:14] [INFO ] Deduced a trap composed of 29 places in 192 ms of which 3 ms to minimize.
[2024-05-20 21:26:15] [INFO ] Deduced a trap composed of 26 places in 221 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:26:15] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:26:15] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-20 21:26:15] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-20 21:26:15] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-20 21:26:15] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:26:16] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-20 21:26:16] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-20 21:26:16] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:26:16] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:26:16] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:26:16] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:26:16] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:26:16] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-20 21:26:16] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:26:16] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:26:16] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:26:16] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:26:16] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:26:16] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:26:16] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:26:17] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2024-05-20 21:26:17] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:26:17] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:26:17] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:26:17] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:26:18] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
[2024-05-20 21:26:18] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:26:18] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:26:18] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:26:18] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:26:18] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:26:18] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:26:18] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:26:18] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:26:18] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:26:18] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-20 21:26:18] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:26:18] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:26:20] [INFO ] Deduced a trap composed of 27 places in 218 ms of which 3 ms to minimize.
[2024-05-20 21:26:20] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:26:20] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2024-05-20 21:26:20] [INFO ] Deduced a trap composed of 26 places in 183 ms of which 3 ms to minimize.
[2024-05-20 21:26:21] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 3 ms to minimize.
[2024-05-20 21:26:21] [INFO ] Deduced a trap composed of 28 places in 184 ms of which 2 ms to minimize.
[2024-05-20 21:26:21] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 2 ms to minimize.
[2024-05-20 21:26:21] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 2 ms to minimize.
[2024-05-20 21:26:21] [INFO ] Deduced a trap composed of 31 places in 208 ms of which 3 ms to minimize.
[2024-05-20 21:26:22] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 3 ms to minimize.
[2024-05-20 21:26:22] [INFO ] Deduced a trap composed of 26 places in 183 ms of which 2 ms to minimize.
[2024-05-20 21:26:22] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 3 ms to minimize.
[2024-05-20 21:26:22] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 3 ms to minimize.
[2024-05-20 21:26:22] [INFO ] Deduced a trap composed of 2 places in 163 ms of which 3 ms to minimize.
[2024-05-20 21:26:23] [INFO ] Deduced a trap composed of 28 places in 219 ms of which 3 ms to minimize.
[2024-05-20 21:26:23] [INFO ] Deduced a trap composed of 27 places in 193 ms of which 2 ms to minimize.
[2024-05-20 21:26:23] [INFO ] Deduced a trap composed of 27 places in 219 ms of which 3 ms to minimize.
[2024-05-20 21:26:23] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 3 ms to minimize.
[2024-05-20 21:26:23] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 3 ms to minimize.
[2024-05-20 21:26:24] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 2 ms to minimize.
[2024-05-20 21:26:24] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 2 ms to minimize.
[2024-05-20 21:26:24] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:26:25] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:26:25] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:26:25] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:26:25] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:26:25] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:26:25] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 2 ms to minimize.
[2024-05-20 21:26:25] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:26:25] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:26:25] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:26:25] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2024-05-20 21:26:25] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:26:25] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-20 21:26:26] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2024-05-20 21:26:26] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 2 ms to minimize.
[2024-05-20 21:26:26] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-05-20 21:26:26] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-05-20 21:26:26] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2024-05-20 21:26:26] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 1 ms to minimize.
[2024-05-20 21:26:26] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:26:26] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:26:27] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-05-20 21:26:27] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:26:27] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:26:27] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:26:27] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:26:27] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:26:27] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:26:27] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:26:27] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-20 21:26:27] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-20 21:26:28] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:26:28] [INFO ] Deduced a trap composed of 29 places in 166 ms of which 3 ms to minimize.
[2024-05-20 21:26:28] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 2 ms to minimize.
[2024-05-20 21:26:28] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 3 ms to minimize.
[2024-05-20 21:26:28] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 3 ms to minimize.
[2024-05-20 21:26:29] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 2 ms to minimize.
[2024-05-20 21:26:29] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 2 ms to minimize.
[2024-05-20 21:26:29] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 2 ms to minimize.
[2024-05-20 21:26:29] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 3 ms to minimize.
[2024-05-20 21:26:29] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:26:30] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:26:30] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:26:30] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:26:30] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:26:30] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:26:30] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:26:30] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:26:30] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
[2024-05-20 21:26:30] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:26:30] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:26:31] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:26:31] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:26:31] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:26:31] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:26:31] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:26:31] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-05-20 21:26:31] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-20 21:26:31] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:26:32] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/2188 variables, and 201 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/526 constraints, ReadFeed: 0/1177 constraints, PredecessorRefiner: 0/1642 constraints, Known Traps: 179/179 constraints]
After SMT, in 60532ms problems are : Problem set: 0 solved, 1642 unsolved
Search for dead transitions found 0 dead transitions in 60545ms
Starting structural reductions in SI_LTL mode, iteration 1 : 526/1043 places, 1662/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62722 ms. Remains : 526/1043 places, 1662/2520 transitions.
Computed a total of 65 stabilizing places and 102 stable transitions
Computed a total of 65 stabilizing places and 102 stable transitions
Detected a total of 65/526 stabilizing places and 102/1662 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (AND p0 (NOT p2))), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 20 factoid took 236 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter insensitive) to 6 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) p2 (NOT p1)), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (385 resets) in 700 ms. (57 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40004 steps (17 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (18 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (17 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (18 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (18 resets) in 104 ms. (380 steps per ms) remains 5/5 properties
[2024-05-20 21:26:41] [INFO ] Invariant cache hit.
[2024-05-20 21:26:41] [INFO ] State equation strengthened by 1177 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 483/486 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-20 21:26:41] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 0 ms to minimize.
[2024-05-20 21:26:41] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-20 21:26:41] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-20 21:26:41] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-20 21:26:42] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-20 21:26:42] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-20 21:26:42] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2024-05-20 21:26:42] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-20 21:26:42] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-05-20 21:26:42] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-20 21:26:42] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-20 21:26:42] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2024-05-20 21:26:42] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-05-20 21:26:42] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2024-05-20 21:26:42] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-20 21:26:42] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 36/522 variables, 18/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/524 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1662/2186 variables, 524/562 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/2186 variables, 1177/1739 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2186 variables, 0/1739 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/2188 variables, 2/1741 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2188 variables, 0/1741 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/2188 variables, 0/1741 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2188/2188 variables, and 1741 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1585 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 526/526 constraints, ReadFeed: 1177/1177 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 482/484 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/484 variables, 16/17 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-20 21:26:43] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-20 21:26:43] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 2/19 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 38/522 variables, 19/38 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/524 variables, 2/40 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-20 21:26:43] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 4 ms to minimize.
[2024-05-20 21:26:44] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 2/42 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/524 variables, 0/42 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1662/2186 variables, 524/566 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2186 variables, 1177/1743 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2186 variables, 3/1746 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2186 variables, 0/1746 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/2188 variables, 2/1748 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2188 variables, 0/1748 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/2188 variables, 0/1748 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2188/2188 variables, and 1748 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1928 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 526/526 constraints, ReadFeed: 1177/1177 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 20/20 constraints]
After SMT, in 3531ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 526 transition count 1660
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 524 transition count 1660
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 524 transition count 1659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 523 transition count 1659
Partial Free-agglomeration rule applied 420 times.
Drop transitions (Partial Free agglomeration) removed 420 transitions
Iterating global reduction 3 with 420 rules applied. Total rules applied 426 place count 523 transition count 1659
Applied a total of 426 rules in 62 ms. Remains 523 /526 variables (removed 3) and now considering 1659/1662 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 523/526 places, 1659/1662 transitions.
RANDOM walk for 40000 steps (423 resets) in 1035 ms. (38 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (17 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (16 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (18 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 296220 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 3
Probabilistic random walk after 296220 steps, saw 41215 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
// Phase 1: matrix 1659 rows 523 cols
[2024-05-20 21:26:48] [INFO ] Computed 22 invariants in 20 ms
[2024-05-20 21:26:48] [INFO ] State equation strengthened by 1596 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 479/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:26:48] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:26:49] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 3 ms to minimize.
[2024-05-20 21:26:49] [INFO ] Deduced a trap composed of 36 places in 216 ms of which 3 ms to minimize.
[2024-05-20 21:26:49] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 3 ms to minimize.
[2024-05-20 21:26:49] [INFO ] Deduced a trap composed of 27 places in 203 ms of which 3 ms to minimize.
[2024-05-20 21:26:50] [INFO ] Deduced a trap composed of 27 places in 206 ms of which 3 ms to minimize.
[2024-05-20 21:26:50] [INFO ] Deduced a trap composed of 26 places in 204 ms of which 3 ms to minimize.
[2024-05-20 21:26:50] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 3 ms to minimize.
[2024-05-20 21:26:50] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 3 ms to minimize.
[2024-05-20 21:26:50] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 3 ms to minimize.
[2024-05-20 21:26:51] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 2 ms to minimize.
[2024-05-20 21:26:51] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 3 ms to minimize.
[2024-05-20 21:26:51] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 3 ms to minimize.
[2024-05-20 21:26:51] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 2 ms to minimize.
[2024-05-20 21:26:51] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 3 ms to minimize.
[2024-05-20 21:26:51] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 2 ms to minimize.
[2024-05-20 21:26:52] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 2 ms to minimize.
[2024-05-20 21:26:52] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2024-05-20 21:26:52] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
[2024-05-20 21:26:52] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 2 ms to minimize.
[2024-05-20 21:26:52] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:26:52] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 2 ms to minimize.
[2024-05-20 21:26:52] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2024-05-20 21:26:53] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-05-20 21:26:53] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2024-05-20 21:26:53] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:26:53] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:26:53] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:26:53] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:26:53] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:26:53] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1659/2180 variables, 521/574 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2180 variables, 1596/2170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2180 variables, 0/2170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/2182 variables, 2/2172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2182 variables, 0/2172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/2182 variables, 0/2172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2182/2182 variables, and 2172 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5755 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1596/1596 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 479/481 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 38/519 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 30/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:26:54] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 3 ms to minimize.
[2024-05-20 21:26:55] [INFO ] Deduced a trap composed of 28 places in 207 ms of which 3 ms to minimize.
[2024-05-20 21:26:55] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 4 ms to minimize.
[2024-05-20 21:26:55] [INFO ] Deduced a trap composed of 27 places in 223 ms of which 3 ms to minimize.
[2024-05-20 21:26:55] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 3 ms to minimize.
[2024-05-20 21:26:56] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 3 ms to minimize.
[2024-05-20 21:26:56] [INFO ] Deduced a trap composed of 28 places in 193 ms of which 3 ms to minimize.
[2024-05-20 21:26:56] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 3 ms to minimize.
[2024-05-20 21:26:56] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 3 ms to minimize.
[2024-05-20 21:26:56] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 3 ms to minimize.
[2024-05-20 21:26:56] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 2 ms to minimize.
[2024-05-20 21:26:57] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 2 ms to minimize.
[2024-05-20 21:26:57] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 3 ms to minimize.
[2024-05-20 21:26:57] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 3 ms to minimize.
[2024-05-20 21:26:57] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 2 ms to minimize.
[2024-05-20 21:26:57] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 2 ms to minimize.
[2024-05-20 21:26:57] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2024-05-20 21:26:57] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
[2024-05-20 21:26:57] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:26:58] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 21:26:58] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:26:58] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:26:58] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
[2024-05-20 21:26:58] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2024-05-20 21:26:58] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-20 21:26:58] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 2 ms to minimize.
[2024-05-20 21:26:58] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:26:58] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 8/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1659/2180 variables, 521/602 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2180 variables, 1596/2198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2180 variables, 3/2201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2180 variables, 0/2201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/2182 variables, 2/2203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2182 variables, 0/2203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/2182 variables, 0/2203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2182/2182 variables, and 2203 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6079 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1596/1596 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 59/59 constraints]
After SMT, in 11882ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 468 ms.
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 20 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 523/523 places, 1659/1659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 19 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2024-05-20 21:27:01] [INFO ] Invariant cache hit.
[2024-05-20 21:27:01] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-20 21:27:01] [INFO ] Invariant cache hit.
[2024-05-20 21:27:01] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2024-05-20 21:27:06] [INFO ] Implicit Places using invariants and state equation in 4792 ms returned []
Implicit Place search using SMT with State Equation took 5143 ms to find 0 implicit places.
[2024-05-20 21:27:06] [INFO ] Redundant transitions in 27 ms returned []
Running 1639 sub problems to find dead transitions.
[2024-05-20 21:27:06] [INFO ] Invariant cache hit.
[2024-05-20 21:27:06] [INFO ] State equation strengthened by 1596 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:27:19] [INFO ] Deduced a trap composed of 2 places in 229 ms of which 3 ms to minimize.
[2024-05-20 21:27:19] [INFO ] Deduced a trap composed of 25 places in 205 ms of which 3 ms to minimize.
[2024-05-20 21:27:20] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 3 ms to minimize.
[2024-05-20 21:27:20] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 2 ms to minimize.
[2024-05-20 21:27:20] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 2 ms to minimize.
[2024-05-20 21:27:20] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 2 ms to minimize.
[2024-05-20 21:27:20] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 2 ms to minimize.
[2024-05-20 21:27:20] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 2 ms to minimize.
[2024-05-20 21:27:21] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 2 ms to minimize.
[2024-05-20 21:27:21] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 2 ms to minimize.
[2024-05-20 21:27:21] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2024-05-20 21:27:21] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 2 ms to minimize.
[2024-05-20 21:27:21] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 1 ms to minimize.
[2024-05-20 21:27:21] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 2 ms to minimize.
[2024-05-20 21:27:21] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 2 ms to minimize.
[2024-05-20 21:27:21] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2024-05-20 21:27:22] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2024-05-20 21:27:22] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 1 ms to minimize.
[2024-05-20 21:27:22] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2024-05-20 21:27:22] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:27:22] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 2 ms to minimize.
[2024-05-20 21:27:22] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 1 ms to minimize.
[2024-05-20 21:27:23] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 2 ms to minimize.
[2024-05-20 21:27:23] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
[2024-05-20 21:27:23] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 2 ms to minimize.
[2024-05-20 21:27:23] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
[2024-05-20 21:27:23] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 2 ms to minimize.
[2024-05-20 21:27:23] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 1 ms to minimize.
[2024-05-20 21:27:23] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-05-20 21:27:23] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 2 ms to minimize.
[2024-05-20 21:27:24] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2024-05-20 21:27:24] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:27:24] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:27:24] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:27:24] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:27:24] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:27:24] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 2 ms to minimize.
[2024-05-20 21:27:24] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:27:24] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:27:24] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 522/2182 variables, and 62 constraints, problems are : Problem set: 0 solved, 1639 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/523 constraints, ReadFeed: 0/1596 constraints, PredecessorRefiner: 1639/1639 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1639 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:27:38] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:27:38] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-05-20 21:27:38] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:27:38] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:27:38] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:27:38] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:27:38] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:27:38] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-20 21:27:38] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 3 ms to minimize.
[2024-05-20 21:27:39] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 3 ms to minimize.
[2024-05-20 21:27:39] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-20 21:27:39] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2024-05-20 21:27:39] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 1 ms to minimize.
[2024-05-20 21:27:39] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-05-20 21:27:39] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:27:39] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-20 21:27:39] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-20 21:27:39] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-05-20 21:27:40] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-20 21:27:40] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:27:40] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:27:40] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:27:40] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:27:40] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:27:40] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:27:40] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:27:41] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:27:41] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:27:41] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:27:41] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:27:41] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:27:41] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:27:41] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:27:41] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:27:41] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:27:41] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:27:41] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:27:41] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:27:41] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:27:41] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:27:42] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:27:55] [INFO ] Deduced a trap composed of 26 places in 204 ms of which 3 ms to minimize.
[2024-05-20 21:27:55] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 3 ms to minimize.
[2024-05-20 21:27:55] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 3 ms to minimize.
[2024-05-20 21:27:55] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 3 ms to minimize.
[2024-05-20 21:27:55] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 3 ms to minimize.
[2024-05-20 21:27:56] [INFO ] Deduced a trap composed of 29 places in 195 ms of which 3 ms to minimize.
[2024-05-20 21:27:56] [INFO ] Deduced a trap composed of 28 places in 207 ms of which 3 ms to minimize.
[2024-05-20 21:27:56] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 3 ms to minimize.
[2024-05-20 21:27:56] [INFO ] Deduced a trap composed of 34 places in 200 ms of which 3 ms to minimize.
[2024-05-20 21:27:56] [INFO ] Deduced a trap composed of 27 places in 191 ms of which 3 ms to minimize.
[2024-05-20 21:27:57] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 2 ms to minimize.
[2024-05-20 21:27:57] [INFO ] Deduced a trap composed of 30 places in 196 ms of which 2 ms to minimize.
[2024-05-20 21:27:57] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 3 ms to minimize.
[2024-05-20 21:27:57] [INFO ] Deduced a trap composed of 32 places in 215 ms of which 3 ms to minimize.
[2024-05-20 21:27:57] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 3 ms to minimize.
[2024-05-20 21:27:58] [INFO ] Deduced a trap composed of 53 places in 204 ms of which 3 ms to minimize.
[2024-05-20 21:27:58] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-20 21:27:58] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 2 ms to minimize.
[2024-05-20 21:27:58] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:27:59] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 3 ms to minimize.
[2024-05-20 21:27:59] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 3 ms to minimize.
[2024-05-20 21:27:59] [INFO ] Deduced a trap composed of 2 places in 197 ms of which 3 ms to minimize.
[2024-05-20 21:27:59] [INFO ] Deduced a trap composed of 2 places in 195 ms of which 3 ms to minimize.
[2024-05-20 21:28:00] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 2 ms to minimize.
[2024-05-20 21:28:00] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 2 ms to minimize.
[2024-05-20 21:28:00] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-20 21:28:00] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:28:00] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-20 21:28:00] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-05-20 21:28:00] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2024-05-20 21:28:01] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:28:01] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:28:01] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:28:01] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-05-20 21:28:01] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:28:01] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:28:01] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:28:01] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:28:01] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:28:02] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 2 ms to minimize.
[2024-05-20 21:28:02] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 2 ms to minimize.
[2024-05-20 21:28:02] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
[2024-05-20 21:28:02] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-05-20 21:28:03] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 2 ms to minimize.
[2024-05-20 21:28:03] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:28:03] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-05-20 21:28:03] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:28:03] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:28:03] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-05-20 21:28:03] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 2 ms to minimize.
[2024-05-20 21:28:03] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:28:03] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:28:03] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:28:03] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:28:04] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:28:04] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-05-20 21:28:04] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:28:04] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:28:04] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:28:05] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-20 21:28:05] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 1 ms to minimize.
[2024-05-20 21:28:05] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 2 ms to minimize.
[2024-05-20 21:28:05] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:28:05] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
[2024-05-20 21:28:05] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:28:05] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-05-20 21:28:06] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 1 ms to minimize.
[2024-05-20 21:28:06] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
[2024-05-20 21:28:06] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 1 ms to minimize.
[2024-05-20 21:28:06] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:28:06] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:28:06] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:28:06] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:28:06] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:28:06] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:28:06] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 0 ms to minimize.
[2024-05-20 21:28:06] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:28:06] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:28:06] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/522 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/2182 variables, and 182 constraints, problems are : Problem set: 0 solved, 1639 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/523 constraints, ReadFeed: 0/1596 constraints, PredecessorRefiner: 0/1639 constraints, Known Traps: 160/160 constraints]
After SMT, in 60698ms problems are : Problem set: 0 solved, 1639 unsolved
Search for dead transitions found 0 dead transitions in 60711ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65907 ms. Remains : 523/523 places, 1659/1659 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1532 edges and 523 vertex of which 438 / 523 are part of one of the 2 SCC in 0 ms
Free SCC test removed 436 places
Drop transitions (Empty/Sink Transition effects.) removed 1155 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1567 transitions.
Graph (complete) has 214 edges and 87 vertex of which 26 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 26 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 25 transition count 31
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 7 transition count 13
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 place count 7 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 7 transition count 10
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 6 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 5 transition count 8
Applied a total of 87 rules in 6 ms. Remains 5 /523 variables (removed 518) and now considering 8/1659 (removed 1651) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 8 rows 5 cols
[2024-05-20 21:28:07] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 21:28:07] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 21:28:07] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-20 21:28:07] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-20 21:28:07] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 66 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (AND p0 (NOT p2))), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p2 p1)), (G (OR p0 (NOT p2) p1))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (AND p0 (NOT p2)))), (F p2), (F (NOT p1))]
Knowledge based reduction with 22 factoid took 459 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter insensitive) to 6 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) p2 (NOT p1)), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) p2 (NOT p1)), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) p2 (NOT p1)), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 33280 reset in 430 ms.
Product exploration explored 100000 steps with 33169 reset in 434 ms.
Built C files in :
/tmp/ltsmin14792661182385221022
[2024-05-20 21:28:09] [INFO ] Too many transitions (1662) to apply POR reductions. Disabling POR matrices.
[2024-05-20 21:28:09] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14792661182385221022
Running compilation step : cd /tmp/ltsmin14792661182385221022;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14792661182385221022;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14792661182385221022;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 3 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Applied a total of 0 rules in 19 ms. Remains 526 /526 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
// Phase 1: matrix 1662 rows 526 cols
[2024-05-20 21:28:12] [INFO ] Computed 22 invariants in 13 ms
[2024-05-20 21:28:12] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-20 21:28:12] [INFO ] Invariant cache hit.
[2024-05-20 21:28:12] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 21:28:14] [INFO ] Implicit Places using invariants and state equation in 1825 ms returned []
Implicit Place search using SMT with State Equation took 2057 ms to find 0 implicit places.
[2024-05-20 21:28:14] [INFO ] Redundant transitions in 25 ms returned []
Running 1642 sub problems to find dead transitions.
[2024-05-20 21:28:14] [INFO ] Invariant cache hit.
[2024-05-20 21:28:14] [INFO ] State equation strengthened by 1177 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:28:27] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:28:27] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:28:28] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-20 21:28:28] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-05-20 21:28:28] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:28:28] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-05-20 21:28:28] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-20 21:28:28] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 2 ms to minimize.
[2024-05-20 21:28:28] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 3 ms to minimize.
[2024-05-20 21:28:28] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 3 ms to minimize.
[2024-05-20 21:28:29] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 3 ms to minimize.
[2024-05-20 21:28:29] [INFO ] Deduced a trap composed of 2 places in 163 ms of which 2 ms to minimize.
[2024-05-20 21:28:29] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 3 ms to minimize.
[2024-05-20 21:28:29] [INFO ] Deduced a trap composed of 2 places in 154 ms of which 2 ms to minimize.
[2024-05-20 21:28:29] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 1 ms to minimize.
[2024-05-20 21:28:29] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2024-05-20 21:28:29] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:28:29] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:28:30] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:28:30] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:28:30] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 2 ms to minimize.
[2024-05-20 21:28:30] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2024-05-20 21:28:31] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 2 ms to minimize.
[2024-05-20 21:28:31] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 2 ms to minimize.
[2024-05-20 21:28:31] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 2 ms to minimize.
[2024-05-20 21:28:31] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 2 ms to minimize.
[2024-05-20 21:28:31] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 2 ms to minimize.
[2024-05-20 21:28:31] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 2 ms to minimize.
[2024-05-20 21:28:31] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:28:31] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 2 ms to minimize.
[2024-05-20 21:28:32] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:28:32] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:28:32] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:28:32] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-05-20 21:28:32] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 1 ms to minimize.
[2024-05-20 21:28:32] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 1 ms to minimize.
[2024-05-20 21:28:32] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-05-20 21:28:32] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:28:32] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-05-20 21:28:33] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/2188 variables, and 62 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/526 constraints, ReadFeed: 0/1177 constraints, PredecessorRefiner: 1642/1642 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1642 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:28:46] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-05-20 21:28:46] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:28:46] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-20 21:28:46] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2024-05-20 21:28:46] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2024-05-20 21:28:46] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2024-05-20 21:28:46] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-20 21:28:46] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:28:47] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:28:47] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:28:47] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:28:47] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:28:47] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:28:47] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:28:47] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:28:47] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:28:47] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:28:48] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 3 ms to minimize.
[2024-05-20 21:28:48] [INFO ] Deduced a trap composed of 29 places in 195 ms of which 3 ms to minimize.
[2024-05-20 21:28:49] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:28:49] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:28:49] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-20 21:28:49] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-05-20 21:28:49] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-20 21:28:49] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:28:49] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-05-20 21:28:49] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-20 21:28:50] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2024-05-20 21:28:50] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:28:50] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:28:50] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:28:50] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:28:50] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:28:50] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 0 ms to minimize.
[2024-05-20 21:28:50] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:28:50] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:28:50] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
[2024-05-20 21:28:50] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:28:50] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:28:50] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:28:51] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:28:51] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:28:51] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:28:51] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2024-05-20 21:28:51] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:28:51] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:28:51] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-05-20 21:28:51] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:28:52] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:28:52] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:28:52] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:28:52] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:28:52] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:28:52] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:28:52] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:28:52] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:28:52] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2024-05-20 21:28:52] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-20 21:28:53] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 3 ms to minimize.
[2024-05-20 21:28:53] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:28:54] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2024-05-20 21:28:54] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 3 ms to minimize.
[2024-05-20 21:28:54] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 3 ms to minimize.
[2024-05-20 21:28:54] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 3 ms to minimize.
[2024-05-20 21:28:55] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 3 ms to minimize.
[2024-05-20 21:28:55] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 3 ms to minimize.
[2024-05-20 21:28:55] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 3 ms to minimize.
[2024-05-20 21:28:55] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 3 ms to minimize.
[2024-05-20 21:28:55] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 3 ms to minimize.
[2024-05-20 21:28:56] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 3 ms to minimize.
[2024-05-20 21:28:56] [INFO ] Deduced a trap composed of 26 places in 188 ms of which 3 ms to minimize.
[2024-05-20 21:28:56] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 2 ms to minimize.
[2024-05-20 21:28:56] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 3 ms to minimize.
[2024-05-20 21:28:56] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 2 ms to minimize.
[2024-05-20 21:28:57] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 3 ms to minimize.
[2024-05-20 21:28:57] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 3 ms to minimize.
[2024-05-20 21:28:57] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 2 ms to minimize.
[2024-05-20 21:28:57] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 3 ms to minimize.
[2024-05-20 21:28:57] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 3 ms to minimize.
[2024-05-20 21:28:58] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:28:58] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:28:58] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:28:58] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:28:58] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:28:59] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:28:59] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:28:59] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:28:59] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 2 ms to minimize.
[2024-05-20 21:28:59] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:28:59] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:28:59] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:28:59] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:28:59] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 2 ms to minimize.
[2024-05-20 21:28:59] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 2 ms to minimize.
[2024-05-20 21:28:59] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 1 ms to minimize.
[2024-05-20 21:29:00] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 2 ms to minimize.
[2024-05-20 21:29:00] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 2 ms to minimize.
[2024-05-20 21:29:00] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 1 ms to minimize.
[2024-05-20 21:29:00] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 1 ms to minimize.
[2024-05-20 21:29:00] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:29:01] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-05-20 21:29:01] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:29:01] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:29:01] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-05-20 21:29:01] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:29:01] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:29:01] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:29:01] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:29:01] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:29:01] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:29:01] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2024-05-20 21:29:02] [INFO ] Deduced a trap composed of 29 places in 169 ms of which 2 ms to minimize.
[2024-05-20 21:29:02] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 3 ms to minimize.
[2024-05-20 21:29:02] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 2 ms to minimize.
[2024-05-20 21:29:02] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 2 ms to minimize.
[2024-05-20 21:29:02] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 3 ms to minimize.
[2024-05-20 21:29:03] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 2 ms to minimize.
[2024-05-20 21:29:03] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 2 ms to minimize.
[2024-05-20 21:29:03] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 2 ms to minimize.
[2024-05-20 21:29:03] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
[2024-05-20 21:29:04] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:29:04] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-05-20 21:29:04] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:29:04] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:29:04] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
[2024-05-20 21:29:04] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:29:04] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:29:04] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:29:04] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:29:05] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:29:05] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:29:05] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:29:05] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:29:05] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:29:05] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-20 21:29:05] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:29:05] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 0 ms to minimize.
[2024-05-20 21:29:05] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:29:07] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/2188 variables, and 201 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/526 constraints, ReadFeed: 0/1177 constraints, PredecessorRefiner: 0/1642 constraints, Known Traps: 179/179 constraints]
After SMT, in 60544ms problems are : Problem set: 0 solved, 1642 unsolved
Search for dead transitions found 0 dead transitions in 60559ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62668 ms. Remains : 526/526 places, 1662/1662 transitions.
Built C files in :
/tmp/ltsmin6136244382910118814
[2024-05-20 21:29:14] [INFO ] Too many transitions (1662) to apply POR reductions. Disabling POR matrices.
[2024-05-20 21:29:14] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6136244382910118814
Running compilation step : cd /tmp/ltsmin6136244382910118814;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6136244382910118814;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6136244382910118814;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-20 21:29:17] [INFO ] Flatten gal took : 26 ms
[2024-05-20 21:29:17] [INFO ] Flatten gal took : 27 ms
[2024-05-20 21:29:17] [INFO ] Time to serialize gal into /tmp/LTL707328027309162454.gal : 5 ms
[2024-05-20 21:29:17] [INFO ] Time to serialize properties into /tmp/LTL3560228743617386057.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL707328027309162454.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8610398789819953108.hoa' '-atoms' '/tmp/LTL3560228743617386057.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL3560228743617386057.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8610398789819953108.hoa
Detected timeout of ITS tools.
[2024-05-20 21:29:33] [INFO ] Flatten gal took : 26 ms
[2024-05-20 21:29:33] [INFO ] Flatten gal took : 26 ms
[2024-05-20 21:29:33] [INFO ] Time to serialize gal into /tmp/LTL9630370755073582250.gal : 5 ms
[2024-05-20 21:29:33] [INFO ] Time to serialize properties into /tmp/LTL5456754178903432208.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9630370755073582250.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5456754178903432208.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(G("(Node15requestsent2<3)")))||(G((G(F("(Node2ID<1)")))U("(Node4GiveAnswer5>=1)")))))
Formula 0 simplified : XF!"(Node15requestsent2<3)" & F(FG!"(Node2ID<1)" R !"(Node4GiveAnswer5>=1)")
Detected timeout of ITS tools.
[2024-05-20 21:29:48] [INFO ] Flatten gal took : 26 ms
[2024-05-20 21:29:48] [INFO ] Applying decomposition
[2024-05-20 21:29:48] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8411029394613223567.txt' '-o' '/tmp/graph8411029394613223567.bin' '-w' '/tmp/graph8411029394613223567.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8411029394613223567.bin' '-l' '-1' '-v' '-w' '/tmp/graph8411029394613223567.weights' '-q' '0' '-e' '0.001'
[2024-05-20 21:29:48] [INFO ] Decomposing Gal with order
[2024-05-20 21:29:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 21:29:48] [INFO ] Removed a total of 1206 redundant transitions.
[2024-05-20 21:29:48] [INFO ] Flatten gal took : 75 ms
[2024-05-20 21:29:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 761 labels/synchronizations in 16 ms.
[2024-05-20 21:29:48] [INFO ] Time to serialize gal into /tmp/LTL15447563027916787694.gal : 7 ms
[2024-05-20 21:29:48] [INFO ] Time to serialize properties into /tmp/LTL11274200521463113898.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15447563027916787694.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11274200521463113898.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((X(G("(u17.Node15requestsent2<3)")))||(G((G(F("(i2.u3.Node2ID<1)")))U("(u7.Node4GiveAnswer5>=1)")))))
Formula 0 simplified : XF!"(u17.Node15requestsent2<3)" & F(FG!"(i2.u3.Node2ID<1)" R !"(u7.Node4GiveAnswer5>=1)")
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-11 finished in 392850 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((G(F(!p0))||(F(!p0)&&X(p1))))))'
Support contains 5 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 17 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2024-05-20 21:30:03] [INFO ] Computed 22 invariants in 25 ms
[2024-05-20 21:30:03] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-05-20 21:30:03] [INFO ] Invariant cache hit.
[2024-05-20 21:30:04] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 21:30:07] [INFO ] Implicit Places using invariants and state equation in 3616 ms returned []
Implicit Place search using SMT with State Equation took 3977 ms to find 0 implicit places.
Running 2500 sub problems to find dead transitions.
[2024-05-20 21:30:07] [INFO ] Invariant cache hit.
[2024-05-20 21:30:07] [INFO ] State equation strengthened by 780 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
SMT process timed out in 30751ms, After SMT, problems are : Problem set: 0 solved, 2500 unsolved
Search for dead transitions found 0 dead transitions in 30771ms
Finished structural reductions in LTL mode , in 1 iterations and 34780 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 183 ms :[p0, p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-12
Stuttering criterion allowed to conclude after 364 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-12 finished in 34990 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)))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-020-LTLCardinality-02
Stuttering acceptance computed with spot in 94 ms :[true, p0, p0]
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 277 place count 905 transition count 2381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Deduced a syphon composed of 360 places in 0 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 3 with 720 rules applied. Total rules applied 998 place count 544 transition count 2021
Drop transitions (Redundant composition of simpler transitions.) removed 324 transitions
Redundant transition composition rules discarded 324 transitions
Iterating global reduction 3 with 324 rules applied. Total rules applied 1322 place count 544 transition count 1697
Partial Post-agglomeration rule applied 38 times.
Drop transitions (Partial Post agglomeration) removed 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 1360 place count 544 transition count 1697
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 1378 place count 526 transition count 1679
Iterating global reduction 3 with 18 rules applied. Total rules applied 1396 place count 526 transition count 1679
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 1414 place count 526 transition count 1661
Applied a total of 1414 rules in 118 ms. Remains 526 /1043 variables (removed 517) and now considering 1661/2520 (removed 859) transitions.
// Phase 1: matrix 1661 rows 526 cols
[2024-05-20 21:30:38] [INFO ] Computed 22 invariants in 20 ms
[2024-05-20 21:30:39] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-20 21:30:39] [INFO ] Invariant cache hit.
[2024-05-20 21:30:39] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 21:30:41] [INFO ] Implicit Places using invariants and state equation in 2037 ms returned []
Implicit Place search using SMT with State Equation took 2289 ms to find 0 implicit places.
Running 1641 sub problems to find dead transitions.
[2024-05-20 21:30:41] [INFO ] Invariant cache hit.
[2024-05-20 21:30:41] [INFO ] State equation strengthened by 1177 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:30:54] [INFO ] Deduced a trap composed of 22 places in 211 ms of which 2 ms to minimize.
[2024-05-20 21:30:55] [INFO ] Deduced a trap composed of 22 places in 192 ms of which 3 ms to minimize.
[2024-05-20 21:30:55] [INFO ] Deduced a trap composed of 22 places in 202 ms of which 2 ms to minimize.
[2024-05-20 21:30:55] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 3 ms to minimize.
[2024-05-20 21:30:55] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2024-05-20 21:30:55] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:30:55] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:30:55] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:30:56] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 3 ms to minimize.
[2024-05-20 21:30:57] [INFO ] Deduced a trap composed of 26 places in 183 ms of which 3 ms to minimize.
[2024-05-20 21:30:57] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 2 ms to minimize.
[2024-05-20 21:30:57] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 3 ms to minimize.
[2024-05-20 21:31:05] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 2 ms to minimize.
[2024-05-20 21:31:05] [INFO ] Deduced a trap composed of 28 places in 183 ms of which 3 ms to minimize.
[2024-05-20 21:31:05] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 3 ms to minimize.
[2024-05-20 21:31:05] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 3 ms to minimize.
[2024-05-20 21:31:05] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 3 ms to minimize.
[2024-05-20 21:31:06] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 3 ms to minimize.
[2024-05-20 21:31:06] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 2 ms to minimize.
[2024-05-20 21:31:06] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:31:06] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 3 ms to minimize.
[2024-05-20 21:31:06] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 2 ms to minimize.
[2024-05-20 21:31:07] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 2 ms to minimize.
[2024-05-20 21:31:07] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 2 ms to minimize.
[2024-05-20 21:31:07] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 1 ms to minimize.
[2024-05-20 21:31:07] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 2 ms to minimize.
[2024-05-20 21:31:07] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 1 ms to minimize.
[2024-05-20 21:31:07] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:31:07] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 1 ms to minimize.
[2024-05-20 21:31:07] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-20 21:31:08] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2024-05-20 21:31:08] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-20 21:31:08] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-05-20 21:31:08] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-20 21:31:08] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:31:08] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2024-05-20 21:31:08] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-05-20 21:31:08] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:31:08] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:31:08] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/2187 variables, and 62 constraints, problems are : Problem set: 0 solved, 1641 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/526 constraints, ReadFeed: 0/1177 constraints, PredecessorRefiner: 1641/1641 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1641 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:31:13] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
[2024-05-20 21:31:13] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:31:13] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:31:13] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-20 21:31:13] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:31:13] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2024-05-20 21:31:13] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:31:13] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:31:13] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:31:13] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:31:13] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2024-05-20 21:31:14] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:31:14] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2024-05-20 21:31:14] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:31:14] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:31:14] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-20 21:31:14] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:31:14] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:31:14] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:31:14] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:31:15] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-05-20 21:31:15] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 1 ms to minimize.
[2024-05-20 21:31:15] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 1 ms to minimize.
[2024-05-20 21:31:15] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:31:15] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:31:15] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-20 21:31:15] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-20 21:31:15] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-05-20 21:31:16] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
[2024-05-20 21:31:16] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-20 21:31:16] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2024-05-20 21:31:16] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:31:16] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:31:16] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-05-20 21:31:16] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
[2024-05-20 21:31:16] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:31:16] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 2 ms to minimize.
[2024-05-20 21:31:16] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:31:16] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
[2024-05-20 21:31:16] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:31:17] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2024-05-20 21:31:17] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 2 ms to minimize.
[2024-05-20 21:31:17] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
[2024-05-20 21:31:17] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:31:18] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 2 ms to minimize.
[2024-05-20 21:31:18] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 2 ms to minimize.
[2024-05-20 21:31:18] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-05-20 21:31:18] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-05-20 21:31:18] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-05-20 21:31:18] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:31:18] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:31:18] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-05-20 21:31:18] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:31:19] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-05-20 21:31:19] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-20 21:31:19] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-05-20 21:31:19] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-20 21:31:19] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:31:19] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:31:19] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:31:20] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:31:20] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:31:20] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:31:20] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:31:20] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:31:20] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:31:20] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:31:20] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:31:20] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-05-20 21:31:21] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:31:21] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:31:21] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:31:21] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:31:21] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:31:21] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-20 21:31:21] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:31:21] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-20 21:31:21] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-20 21:31:21] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-20 21:31:21] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:31:22] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 1 ms to minimize.
[2024-05-20 21:31:22] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:31:22] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
[2024-05-20 21:31:22] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-05-20 21:31:22] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:31:22] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:31:22] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2024-05-20 21:31:22] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:31:23] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-20 21:31:23] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-20 21:31:23] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:31:23] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:31:23] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:31:23] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:31:23] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 2 ms to minimize.
[2024-05-20 21:31:23] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2024-05-20 21:31:23] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-05-20 21:31:23] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:31:23] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:31:24] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:31:24] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:31:24] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-20 21:31:24] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-20 21:31:25] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 2 ms to minimize.
[2024-05-20 21:31:25] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
[2024-05-20 21:31:25] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-20 21:31:25] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 2 ms to minimize.
[2024-05-20 21:31:25] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:31:25] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:31:25] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:31:25] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:31:25] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:31:25] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:31:25] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:31:25] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:31:26] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:31:26] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
[2024-05-20 21:31:26] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:31:26] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-20 21:31:26] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:31:26] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:31:27] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:31:27] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 2 ms to minimize.
[2024-05-20 21:31:27] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:31:27] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-05-20 21:31:27] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-05-20 21:31:27] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:31:27] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:31:27] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:31:27] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:31:27] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:31:27] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:31:28] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:31:28] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:31:28] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:31:28] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-05-20 21:31:28] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:31:28] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-20 21:31:28] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:31:28] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:31:29] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:31:29] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-05-20 21:31:29] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:31:29] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2024-05-20 21:31:29] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-05-20 21:31:29] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2024-05-20 21:31:29] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 4 ms to minimize.
[2024-05-20 21:31:30] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:31:30] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:31:30] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:31:30] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:31:30] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:31:30] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:31:30] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:31:30] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:31:30] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:31:30] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-20 21:31:30] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 0 ms to minimize.
[2024-05-20 21:31:30] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-05-20 21:31:30] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:31:31] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:31:31] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-20 21:31:31] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:31:31] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:31:31] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-20 21:31:32] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-05-20 21:31:32] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:31:32] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:31:32] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:31:32] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:31:32] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-20 21:31:32] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2024-05-20 21:31:32] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:31:32] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:31:32] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:31:32] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:31:32] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:31:32] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-05-20 21:31:33] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-20 21:31:33] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/525 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:31:34] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-20 21:31:34] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:31:34] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2024-05-20 21:31:34] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-05-20 21:31:34] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-05-20 21:31:34] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-05-20 21:31:34] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-05-20 21:31:34] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:31:34] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:31:35] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-20 21:31:35] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:31:35] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-05-20 21:31:35] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 1 ms to minimize.
[2024-05-20 21:31:35] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 2 ms to minimize.
[2024-05-20 21:31:35] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
[2024-05-20 21:31:35] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-05-20 21:31:35] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-05-20 21:31:35] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-05-20 21:31:35] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-20 21:31:36] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:31:37] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-20 21:31:37] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 2 ms to minimize.
[2024-05-20 21:31:37] [INFO ] Deduced a trap composed of 2 places in 125 ms of which 2 ms to minimize.
[2024-05-20 21:31:38] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 2 ms to minimize.
[2024-05-20 21:31:38] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 3 ms to minimize.
[2024-05-20 21:31:38] [INFO ] Deduced a trap composed of 2 places in 188 ms of which 3 ms to minimize.
[2024-05-20 21:31:38] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 3 ms to minimize.
[2024-05-20 21:31:39] [INFO ] Deduced a trap composed of 2 places in 181 ms of which 2 ms to minimize.
[2024-05-20 21:31:39] [INFO ] Deduced a trap composed of 2 places in 185 ms of which 3 ms to minimize.
[2024-05-20 21:31:39] [INFO ] Deduced a trap composed of 2 places in 194 ms of which 3 ms to minimize.
[2024-05-20 21:31:39] [INFO ] Deduced a trap composed of 2 places in 200 ms of which 2 ms to minimize.
[2024-05-20 21:31:39] [INFO ] Deduced a trap composed of 2 places in 206 ms of which 3 ms to minimize.
[2024-05-20 21:31:40] [INFO ] Deduced a trap composed of 2 places in 220 ms of which 4 ms to minimize.
[2024-05-20 21:31:40] [INFO ] Deduced a trap composed of 26 places in 183 ms of which 3 ms to minimize.
[2024-05-20 21:31:40] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 3 ms to minimize.
[2024-05-20 21:31:40] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 2 ms to minimize.
[2024-05-20 21:31:40] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 2 ms to minimize.
[2024-05-20 21:31:40] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 3 ms to minimize.
[2024-05-20 21:31:41] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
[2024-05-20 21:31:41] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/2187 variables, and 282 constraints, problems are : Problem set: 0 solved, 1641 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/526 constraints, ReadFeed: 0/1177 constraints, PredecessorRefiner: 0/1641 constraints, Known Traps: 260/260 constraints]
After SMT, in 60594ms problems are : Problem set: 0 solved, 1641 unsolved
Search for dead transitions found 0 dead transitions in 60607ms
Starting structural reductions in LI_LTL mode, iteration 1 : 526/1043 places, 1661/2520 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 63021 ms. Remains : 526/1043 places, 1661/2520 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-02
Product exploration explored 100000 steps with 949 reset in 441 ms.
Product exploration explored 100000 steps with 943 reset in 436 ms.
Computed a total of 60 stabilizing places and 99 stable transitions
Computed a total of 60 stabilizing places and 99 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, p0]
RANDOM walk for 40000 steps (377 resets) in 277 ms. (143 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (18 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 361767 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 1
Probabilistic random walk after 361767 steps, saw 53665 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
[2024-05-20 21:31:45] [INFO ] Invariant cache hit.
[2024-05-20 21:31:45] [INFO ] State equation strengthened by 1177 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 482/484 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 21:31:45] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-05-20 21:31:46] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-20 21:31:46] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-20 21:31:46] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2024-05-20 21:31:46] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-05-20 21:31:46] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-05-20 21:31:46] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-20 21:31:46] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
[2024-05-20 21:31:46] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-20 21:31:46] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-20 21:31:46] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-05-20 21:31:46] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/484 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/522 variables, 19/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/524 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 21:31:46] [INFO ] Deduced a trap composed of 2 places in 202 ms of which 3 ms to minimize.
[2024-05-20 21:31:46] [INFO ] Deduced a trap composed of 2 places in 194 ms of which 3 ms to minimize.
[2024-05-20 21:31:47] [INFO ] Deduced a trap composed of 2 places in 195 ms of which 2 ms to minimize.
[2024-05-20 21:31:47] [INFO ] Deduced a trap composed of 2 places in 198 ms of which 3 ms to minimize.
[2024-05-20 21:31:47] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 3 ms to minimize.
[2024-05-20 21:31:47] [INFO ] Deduced a trap composed of 3 places in 212 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1661/2185 variables, 524/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2185 variables, 1177/1741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2185 variables, 0/1741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/2187 variables, 2/1743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2187 variables, 0/1743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2187 variables, 0/1743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2187/2187 variables, and 1743 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2276 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 526/526 constraints, ReadFeed: 1177/1177 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 482/484 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/484 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 21:31:48] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 0 ms to minimize.
[2024-05-20 21:31:48] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/522 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/524 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/524 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 21:31:48] [INFO ] Deduced a trap composed of 29 places in 208 ms of which 3 ms to minimize.
[2024-05-20 21:31:48] [INFO ] Deduced a trap composed of 33 places in 205 ms of which 3 ms to minimize.
[2024-05-20 21:31:49] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/524 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/524 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1661/2185 variables, 524/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2185 variables, 1177/1746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2185 variables, 1/1747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2185 variables, 0/1747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/2187 variables, 2/1749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2187 variables, 0/1749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2187 variables, 0/1749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2187/2187 variables, and 1749 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1420 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 526/526 constraints, ReadFeed: 1177/1177 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 23/23 constraints]
After SMT, in 3714ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1661/1661 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 526 transition count 1659
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 524 transition count 1659
Partial Free-agglomeration rule applied 421 times.
Drop transitions (Partial Free agglomeration) removed 421 transitions
Iterating global reduction 1 with 421 rules applied. Total rules applied 425 place count 524 transition count 1659
Applied a total of 425 rules in 60 ms. Remains 524 /526 variables (removed 2) and now considering 1659/1661 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 524/526 places, 1659/1661 transitions.
RANDOM walk for 40000 steps (409 resets) in 249 ms. (160 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (16 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 368141 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 1
Probabilistic random walk after 368141 steps, saw 52320 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
// Phase 1: matrix 1659 rows 524 cols
[2024-05-20 21:31:52] [INFO ] Computed 22 invariants in 19 ms
[2024-05-20 21:31:52] [INFO ] State equation strengthened by 1577 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 482/484 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 21:31:52] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/484 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 36/520 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/522 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 21:31:53] [INFO ] Deduced a trap composed of 27 places in 203 ms of which 2 ms to minimize.
[2024-05-20 21:31:53] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 3 ms to minimize.
[2024-05-20 21:31:53] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 3 ms to minimize.
[2024-05-20 21:31:53] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 2 ms to minimize.
[2024-05-20 21:31:53] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 2 ms to minimize.
[2024-05-20 21:31:54] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 3 ms to minimize.
[2024-05-20 21:31:54] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 2 ms to minimize.
[2024-05-20 21:31:54] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 3 ms to minimize.
[2024-05-20 21:31:54] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 2 ms to minimize.
[2024-05-20 21:31:54] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 2 ms to minimize.
[2024-05-20 21:31:54] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 2 ms to minimize.
[2024-05-20 21:31:54] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 3 ms to minimize.
[2024-05-20 21:31:55] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 2 ms to minimize.
[2024-05-20 21:31:55] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 2 ms to minimize.
[2024-05-20 21:31:55] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-20 21:31:55] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 2 ms to minimize.
[2024-05-20 21:31:55] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2024-05-20 21:31:55] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-05-20 21:31:55] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2024-05-20 21:31:55] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 21:31:55] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-05-20 21:31:55] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:31:56] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-05-20 21:31:56] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:31:56] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:31:56] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/522 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/522 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1659/2181 variables, 522/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2181 variables, 1577/2148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/2181 variables, 0/2148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/2183 variables, 2/2150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2183 variables, 0/2150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2183 variables, 0/2150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2183/2183 variables, and 2150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4025 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 524/524 constraints, ReadFeed: 1577/1577 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 482/484 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/484 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 21:31:56] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/520 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/522 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/522 variables, 26/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/522 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1659/2181 variables, 522/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2181 variables, 1577/2149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2181 variables, 1/2150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2181 variables, 0/2150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/2183 variables, 2/2152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2183 variables, 0/2152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2183 variables, 0/2152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2183/2183 variables, and 2152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1454 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 524/524 constraints, ReadFeed: 1577/1577 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 28/28 constraints]
After SMT, in 5522ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 76 ms.
Support contains 2 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1659/1659 transitions.
Applied a total of 0 rules in 20 ms. Remains 524 /524 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 524/524 places, 1659/1659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1659/1659 transitions.
Applied a total of 0 rules in 20 ms. Remains 524 /524 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2024-05-20 21:31:58] [INFO ] Invariant cache hit.
[2024-05-20 21:31:58] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-20 21:31:58] [INFO ] Invariant cache hit.
[2024-05-20 21:31:59] [INFO ] State equation strengthened by 1577 read => feed constraints.
[2024-05-20 21:32:03] [INFO ] Implicit Places using invariants and state equation in 4388 ms returned []
Implicit Place search using SMT with State Equation took 4754 ms to find 0 implicit places.
[2024-05-20 21:32:03] [INFO ] Redundant transitions in 26 ms returned []
Running 1639 sub problems to find dead transitions.
[2024-05-20 21:32:03] [INFO ] Invariant cache hit.
[2024-05-20 21:32:03] [INFO ] State equation strengthened by 1577 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:32:16] [INFO ] Deduced a trap composed of 38 places in 202 ms of which 3 ms to minimize.
[2024-05-20 21:32:16] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:32:17] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 3 ms to minimize.
[2024-05-20 21:32:17] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 2 ms to minimize.
[2024-05-20 21:32:17] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 1 ms to minimize.
[2024-05-20 21:32:17] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 1 ms to minimize.
[2024-05-20 21:32:17] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:32:17] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 1 ms to minimize.
[2024-05-20 21:32:17] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:32:17] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2024-05-20 21:32:18] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-20 21:32:18] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 1 ms to minimize.
[2024-05-20 21:32:18] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 1 ms to minimize.
[2024-05-20 21:32:18] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:32:18] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:32:18] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:32:18] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 3 ms to minimize.
[2024-05-20 21:32:18] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 2 ms to minimize.
[2024-05-20 21:32:19] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 2 ms to minimize.
[2024-05-20 21:32:19] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/523 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:32:19] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 1 ms to minimize.
[2024-05-20 21:32:19] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 2 ms to minimize.
[2024-05-20 21:32:19] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 2 ms to minimize.
[2024-05-20 21:32:20] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 2 ms to minimize.
[2024-05-20 21:32:20] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 2 ms to minimize.
[2024-05-20 21:32:20] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-05-20 21:32:20] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 2 ms to minimize.
[2024-05-20 21:32:20] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-20 21:32:20] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 2 ms to minimize.
[2024-05-20 21:32:20] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:32:20] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 1 ms to minimize.
[2024-05-20 21:32:21] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 1 ms to minimize.
[2024-05-20 21:32:21] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-20 21:32:21] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:32:21] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:32:21] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:32:21] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-05-20 21:32:21] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:32:21] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:32:22] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 523/2183 variables, and 62 constraints, problems are : Problem set: 0 solved, 1639 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/524 constraints, ReadFeed: 0/1577 constraints, PredecessorRefiner: 1639/1639 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1639 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/523 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:32:35] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:32:35] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:32:35] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 3 ms to minimize.
[2024-05-20 21:32:35] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 3 ms to minimize.
[2024-05-20 21:32:35] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 2 ms to minimize.
[2024-05-20 21:32:36] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 3 ms to minimize.
[2024-05-20 21:32:36] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 3 ms to minimize.
[2024-05-20 21:32:36] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 2 ms to minimize.
[2024-05-20 21:32:36] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 3 ms to minimize.
[2024-05-20 21:32:36] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-20 21:32:36] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 3 ms to minimize.
[2024-05-20 21:32:36] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-20 21:32:37] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 2 ms to minimize.
[2024-05-20 21:32:37] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 2 ms to minimize.
[2024-05-20 21:32:37] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-20 21:32:37] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 3 ms to minimize.
[2024-05-20 21:32:37] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 2 ms to minimize.
[2024-05-20 21:32:37] [INFO ] Deduced a trap composed of 29 places in 180 ms of which 3 ms to minimize.
[2024-05-20 21:32:37] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:32:38] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:32:38] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 2 ms to minimize.
[2024-05-20 21:32:38] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-20 21:32:38] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:32:39] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:32:39] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 ms to minimize.
[2024-05-20 21:32:39] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
[2024-05-20 21:32:39] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 2 ms to minimize.
[2024-05-20 21:32:39] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
[2024-05-20 21:32:39] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:32:39] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
[2024-05-20 21:32:39] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:32:39] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:32:40] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:32:40] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:32:40] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:32:40] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-05-20 21:32:40] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:32:40] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:32:40] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 0 ms to minimize.
[2024-05-20 21:32:40] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/523 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:32:41] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 1 ms to minimize.
[2024-05-20 21:32:41] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2024-05-20 21:32:41] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2024-05-20 21:32:41] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 1 ms to minimize.
[2024-05-20 21:32:41] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-05-20 21:32:41] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 2 ms to minimize.
[2024-05-20 21:32:41] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 2 ms to minimize.
[2024-05-20 21:32:41] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:32:41] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:32:42] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-05-20 21:32:42] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-20 21:32:42] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:32:42] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:32:42] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:32:42] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:32:42] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 1 ms to minimize.
[2024-05-20 21:32:42] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:32:42] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:32:42] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:32:42] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/523 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:32:43] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 2 ms to minimize.
[2024-05-20 21:32:43] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 2 ms to minimize.
[2024-05-20 21:32:43] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 2 ms to minimize.
[2024-05-20 21:32:43] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 2 ms to minimize.
[2024-05-20 21:32:43] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2024-05-20 21:32:43] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-05-20 21:32:44] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
[2024-05-20 21:32:44] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-20 21:32:44] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2024-05-20 21:32:44] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2024-05-20 21:32:44] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-20 21:32:44] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-20 21:32:44] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-05-20 21:32:44] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:32:44] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:32:44] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-05-20 21:32:45] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-05-20 21:32:45] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:32:45] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:32:45] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:32:45] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2024-05-20 21:32:45] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:32:46] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2024-05-20 21:32:46] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:32:46] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:32:46] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-05-20 21:32:46] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:32:46] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-20 21:32:46] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:32:46] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 1 ms to minimize.
[2024-05-20 21:32:46] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:32:46] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-20 21:32:47] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:32:47] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:32:47] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-05-20 21:32:47] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:32:47] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-05-20 21:32:47] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 1 ms to minimize.
[2024-05-20 21:32:47] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-05-20 21:32:47] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:32:48] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:32:48] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2024-05-20 21:32:48] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2024-05-20 21:32:48] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:32:48] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2024-05-20 21:32:48] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:32:49] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-05-20 21:32:49] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2024-05-20 21:32:49] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:32:49] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-20 21:32:49] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:32:49] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2024-05-20 21:32:49] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:32:49] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:32:49] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:32:49] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:32:49] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:32:49] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:32:49] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 0 ms to minimize.
[2024-05-20 21:32:49] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/523 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:32:50] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-20 21:32:50] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:32:50] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:32:50] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-20 21:32:50] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-20 21:32:51] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:32:51] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:32:51] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:32:51] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-05-20 21:32:51] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 2 ms to minimize.
[2024-05-20 21:32:51] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:32:51] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-20 21:32:51] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:32:51] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-20 21:32:51] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-20 21:32:51] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-20 21:32:51] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
[2024-05-20 21:32:58] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 2 ms to minimize.
[2024-05-20 21:32:58] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 1 ms to minimize.
[2024-05-20 21:32:58] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/523 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:32:59] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 3 ms to minimize.
[2024-05-20 21:32:59] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 2 ms to minimize.
[2024-05-20 21:32:59] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 2 ms to minimize.
[2024-05-20 21:33:00] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 2 ms to minimize.
[2024-05-20 21:33:00] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2024-05-20 21:33:00] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 2 ms to minimize.
[2024-05-20 21:33:00] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
[2024-05-20 21:33:00] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2024-05-20 21:33:00] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-05-20 21:33:00] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:33:00] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:33:01] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-05-20 21:33:01] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-20 21:33:01] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:33:01] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:33:01] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-20 21:33:01] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-20 21:33:01] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-20 21:33:01] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:33:01] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/523 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-20 21:33:02] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-20 21:33:02] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-20 21:33:02] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 1 ms to minimize.
[2024-05-20 21:33:02] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
[2024-05-20 21:33:02] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 2 ms to minimize.
[2024-05-20 21:33:02] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-20 21:33:03] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 2 ms to minimize.
[2024-05-20 21:33:03] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-05-20 21:33:03] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 1 ms to minimize.
[2024-05-20 21:33:03] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 1 ms to minimize.
[2024-05-20 21:33:03] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-05-20 21:33:03] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:33:03] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2024-05-20 21:33:03] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-05-20 21:33:03] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
SMT process timed out in 60796ms, After SMT, problems are : Problem set: 0 solved, 1639 unsolved
Search for dead transitions found 0 dead transitions in 60813ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65621 ms. Remains : 524/524 places, 1659/1659 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1519 edges and 524 vertex of which 418 / 524 are part of one of the 2 SCC in 0 ms
Free SCC test removed 416 places
Drop transitions (Empty/Sink Transition effects.) removed 1084 transitions
Ensure Unique test removed 408 transitions
Reduce isomorphic transitions removed 1492 transitions.
Graph (complete) has 291 edges and 108 vertex of which 50 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.0 ms
Discarding 58 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Drop transitions (Empty/Sink Transition effects.) removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 50 transition count 91
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 95 place count 16 transition count 40
Iterating global reduction 1 with 34 rules applied. Total rules applied 129 place count 16 transition count 40
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 146 place count 16 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 15 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 150 place count 14 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 14 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 14 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 154 place count 13 transition count 18
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 13 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 156 place count 12 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 10 transition count 15
Applied a total of 158 rules in 8 ms. Remains 10 /524 variables (removed 514) and now considering 15/1659 (removed 1644) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 10 cols
[2024-05-20 21:33:04] [INFO ] Computed 2 invariants in 2 ms
[2024-05-20 21:33:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-20 21:33:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 21:33:04] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 21:33:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 21:33:04] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 21:33:04] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 21:33:04] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 21:33:04] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 64 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 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 62 ms :[true, p0]
Stuttering acceptance computed with spot in 36 ms :[true, p0]
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 1661/1661 transitions.
Applied a total of 0 rules in 23 ms. Remains 526 /526 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
// Phase 1: matrix 1661 rows 526 cols
[2024-05-20 21:33:04] [INFO ] Computed 22 invariants in 20 ms
[2024-05-20 21:33:04] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-20 21:33:04] [INFO ] Invariant cache hit.
[2024-05-20 21:33:04] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 21:33:06] [INFO ] Implicit Places using invariants and state equation in 1918 ms returned []
Implicit Place search using SMT with State Equation took 2162 ms to find 0 implicit places.
[2024-05-20 21:33:06] [INFO ] Redundant transitions in 25 ms returned []
Running 1641 sub problems to find dead transitions.
[2024-05-20 21:33:06] [INFO ] Invariant cache hit.
[2024-05-20 21:33:06] [INFO ] State equation strengthened by 1177 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:33:20] [INFO ] Deduced a trap composed of 22 places in 195 ms of which 3 ms to minimize.
[2024-05-20 21:33:20] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 3 ms to minimize.
[2024-05-20 21:33:20] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 2 ms to minimize.
[2024-05-20 21:33:20] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 2 ms to minimize.
[2024-05-20 21:33:20] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-20 21:33:20] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:33:20] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:33:20] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:33:21] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 3 ms to minimize.
[2024-05-20 21:33:22] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 2 ms to minimize.
[2024-05-20 21:33:22] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 3 ms to minimize.
[2024-05-20 21:33:22] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 3 ms to minimize.
[2024-05-20 21:33:30] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 3 ms to minimize.
[2024-05-20 21:33:30] [INFO ] Deduced a trap composed of 28 places in 186 ms of which 3 ms to minimize.
[2024-05-20 21:33:30] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 3 ms to minimize.
[2024-05-20 21:33:30] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 3 ms to minimize.
[2024-05-20 21:33:30] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 2 ms to minimize.
[2024-05-20 21:33:31] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 3 ms to minimize.
[2024-05-20 21:33:31] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 3 ms to minimize.
[2024-05-20 21:33:31] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:33:31] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 2 ms to minimize.
[2024-05-20 21:33:32] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 2 ms to minimize.
[2024-05-20 21:33:32] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 2 ms to minimize.
[2024-05-20 21:33:32] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 2 ms to minimize.
[2024-05-20 21:33:32] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 2 ms to minimize.
[2024-05-20 21:33:32] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 2 ms to minimize.
[2024-05-20 21:33:32] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 2 ms to minimize.
[2024-05-20 21:33:32] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 1 ms to minimize.
[2024-05-20 21:33:32] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 2 ms to minimize.
[2024-05-20 21:33:33] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-20 21:33:33] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-05-20 21:33:33] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-20 21:33:33] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:33:33] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-05-20 21:33:33] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:33:33] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 1 ms to minimize.
[2024-05-20 21:33:33] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-05-20 21:33:33] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-05-20 21:33:33] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:33:34] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/2187 variables, and 62 constraints, problems are : Problem set: 0 solved, 1641 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/526 constraints, ReadFeed: 0/1177 constraints, PredecessorRefiner: 1641/1641 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1641 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:33:38] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-05-20 21:33:38] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:33:38] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:33:38] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2024-05-20 21:33:38] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2024-05-20 21:33:38] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2024-05-20 21:33:38] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2024-05-20 21:33:39] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:33:39] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:33:39] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-05-20 21:33:39] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:33:39] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-20 21:33:39] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 2 ms to minimize.
[2024-05-20 21:33:39] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-20 21:33:39] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:33:39] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:33:39] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-20 21:33:39] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:33:39] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:33:39] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:33:40] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-20 21:33:40] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-05-20 21:33:40] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2024-05-20 21:33:40] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-20 21:33:40] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:33:40] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-05-20 21:33:41] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2024-05-20 21:33:41] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 1 ms to minimize.
[2024-05-20 21:33:41] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2024-05-20 21:33:41] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2024-05-20 21:33:41] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2024-05-20 21:33:41] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 2 ms to minimize.
[2024-05-20 21:33:41] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-05-20 21:33:41] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-05-20 21:33:41] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-05-20 21:33:41] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-20 21:33:41] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:33:42] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:33:42] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-20 21:33:42] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:33:42] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 1 ms to minimize.
[2024-05-20 21:33:42] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 2 ms to minimize.
[2024-05-20 21:33:43] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 2 ms to minimize.
[2024-05-20 21:33:43] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-20 21:33:43] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2024-05-20 21:33:43] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 1 ms to minimize.
[2024-05-20 21:33:43] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-20 21:33:43] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 1 ms to minimize.
[2024-05-20 21:33:43] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-05-20 21:33:43] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2024-05-20 21:33:44] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 2 ms to minimize.
[2024-05-20 21:33:44] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 1 ms to minimize.
[2024-05-20 21:33:44] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:33:44] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-05-20 21:33:44] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-05-20 21:33:44] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2024-05-20 21:33:44] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:33:44] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:33:44] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-20 21:33:44] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1641 unsolved
[2024-05-20 21:33:45] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-20 21:33:45] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-20 21:33:45] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:33:45] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-05-20 21:33:45] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2024-05-20 21:33:45] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-20 21:33:46] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 1 ms to minimize.
[2024-05-20 21:33:46] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-05-20 21:33:46] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-20 21:33:46] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-20 21:33:46] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-20 21:33:46] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-20 21:33:46] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-20 21:33:46] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-20 21:33:46] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-20 21:33:46] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-20 21:33:46] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
========== file over 1MB has been truncated ======
retrieve it from the run archives if needed
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-020"
export BK_EXAMINATION="LTLCardinality"
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 CANInsertWithFailure-PT-020, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-tall-171620505200107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-020.tgz
mv CANInsertWithFailure-PT-020 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;