About the Execution of ITS-Tools for Peterson-PT-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16242.768 | 3600000.00 | 2999832.00 | 432079.30 | 8 8 7 7 8 7 8 8 1 ? 1 1 ? 1 ? 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r140-tall-162089128200643.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-PT-7, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128200643
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 1.4M May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 5.1M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8M May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 7.8M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 113K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 335K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 116K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 380K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 159K Mar 27 07:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 427K Mar 27 07:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 127K Mar 25 08:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 418K Mar 25 08:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 23K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 47K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 2.3M May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-PT-7-UpperBounds-00
FORMULA_NAME Peterson-PT-7-UpperBounds-01
FORMULA_NAME Peterson-PT-7-UpperBounds-02
FORMULA_NAME Peterson-PT-7-UpperBounds-03
FORMULA_NAME Peterson-PT-7-UpperBounds-04
FORMULA_NAME Peterson-PT-7-UpperBounds-05
FORMULA_NAME Peterson-PT-7-UpperBounds-06
FORMULA_NAME Peterson-PT-7-UpperBounds-07
FORMULA_NAME Peterson-PT-7-UpperBounds-08
FORMULA_NAME Peterson-PT-7-UpperBounds-09
FORMULA_NAME Peterson-PT-7-UpperBounds-10
FORMULA_NAME Peterson-PT-7-UpperBounds-11
FORMULA_NAME Peterson-PT-7-UpperBounds-12
FORMULA_NAME Peterson-PT-7-UpperBounds-13
FORMULA_NAME Peterson-PT-7-UpperBounds-14
FORMULA_NAME Peterson-PT-7-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1621029583241
Running Version 0
[2021-05-14 21:59:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 21:59:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 21:59:45] [INFO ] Load time of PNML (sax parser for PT used): 216 ms
[2021-05-14 21:59:45] [INFO ] Transformed 1992 places.
[2021-05-14 21:59:45] [INFO ] Transformed 3096 transitions.
[2021-05-14 21:59:45] [INFO ] Found NUPN structural information;
[2021-05-14 21:59:45] [INFO ] Parsed PT model containing 1992 places and 3096 transitions in 271 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 20 ms.
FORMULA Peterson-PT-7-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-UpperBounds-04 8 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-UpperBounds-06 8 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-UpperBounds-07 8 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2760 out of 3096 initially.
// Phase 1: matrix 2760 rows 1992 cols
[2021-05-14 21:59:45] [INFO ] Computed 31 place invariants in 49 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 11) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 11) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :15
[2021-05-14 21:59:45] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2021-05-14 21:59:45] [INFO ] Computed 31 place invariants in 20 ms
[2021-05-14 21:59:46] [INFO ] [Real]Absence check using 23 positive place invariants in 45 ms returned unsat
[2021-05-14 21:59:46] [INFO ] [Real]Absence check using 23 positive place invariants in 39 ms returned unsat
[2021-05-14 21:59:47] [INFO ] [Real]Absence check using 23 positive place invariants in 39 ms returned sat
[2021-05-14 21:59:47] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 21:59:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:59:48] [INFO ] [Real]Absence check using state equation in 900 ms returned sat
[2021-05-14 21:59:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:59:48] [INFO ] [Nat]Absence check using 23 positive place invariants in 41 ms returned sat
[2021-05-14 21:59:48] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 21:59:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:59:49] [INFO ] [Nat]Absence check using state equation in 838 ms returned sat
[2021-05-14 21:59:49] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 21:59:49] [INFO ] [Nat]Added 546 Read/Feed constraints in 249 ms returned sat
[2021-05-14 21:59:50] [INFO ] Deduced a trap composed of 85 places in 1105 ms of which 6 ms to minimize.
[2021-05-14 21:59:52] [INFO ] Deduced a trap composed of 120 places in 1079 ms of which 3 ms to minimize.
[2021-05-14 21:59:53] [INFO ] Deduced a trap composed of 120 places in 1069 ms of which 4 ms to minimize.
[2021-05-14 21:59:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-14 21:59:53] [INFO ] [Real]Absence check using 23 positive place invariants in 43 ms returned sat
[2021-05-14 21:59:53] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 21:59:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:59:54] [INFO ] [Real]Absence check using state equation in 798 ms returned sat
[2021-05-14 21:59:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:59:54] [INFO ] [Nat]Absence check using 23 positive place invariants in 39 ms returned sat
[2021-05-14 21:59:54] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 21:59:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:59:55] [INFO ] [Nat]Absence check using state equation in 811 ms returned sat
[2021-05-14 21:59:55] [INFO ] [Nat]Added 546 Read/Feed constraints in 160 ms returned sat
[2021-05-14 21:59:56] [INFO ] Deduced a trap composed of 59 places in 898 ms of which 10 ms to minimize.
[2021-05-14 21:59:57] [INFO ] Deduced a trap composed of 96 places in 956 ms of which 2 ms to minimize.
[2021-05-14 21:59:58] [INFO ] Deduced a trap composed of 97 places in 944 ms of which 13 ms to minimize.
[2021-05-14 22:00:00] [INFO ] Deduced a trap composed of 228 places in 934 ms of which 2 ms to minimize.
[2021-05-14 22:00:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-14 22:00:00] [INFO ] [Real]Absence check using 23 positive place invariants in 37 ms returned sat
[2021-05-14 22:00:00] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 22:00:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:00:01] [INFO ] [Real]Absence check using state equation in 784 ms returned sat
[2021-05-14 22:00:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:00:01] [INFO ] [Nat]Absence check using 23 positive place invariants in 39 ms returned sat
[2021-05-14 22:00:01] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:00:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:00:02] [INFO ] [Nat]Absence check using state equation in 756 ms returned sat
[2021-05-14 22:00:02] [INFO ] [Nat]Added 546 Read/Feed constraints in 176 ms returned sat
[2021-05-14 22:00:03] [INFO ] Deduced a trap composed of 59 places in 942 ms of which 9 ms to minimize.
[2021-05-14 22:00:04] [INFO ] Deduced a trap composed of 59 places in 996 ms of which 1 ms to minimize.
[2021-05-14 22:00:05] [INFO ] Deduced a trap composed of 59 places in 938 ms of which 1 ms to minimize.
[2021-05-14 22:00:06] [INFO ] Deduced a trap composed of 66 places in 940 ms of which 1 ms to minimize.
[2021-05-14 22:00:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-14 22:00:07] [INFO ] [Real]Absence check using 23 positive place invariants in 38 ms returned sat
[2021-05-14 22:00:07] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 22:00:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:00:08] [INFO ] [Real]Absence check using state equation in 886 ms returned sat
[2021-05-14 22:00:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:00:08] [INFO ] [Nat]Absence check using 23 positive place invariants in 39 ms returned sat
[2021-05-14 22:00:08] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-14 22:00:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:00:09] [INFO ] [Nat]Absence check using state equation in 771 ms returned sat
[2021-05-14 22:00:09] [INFO ] [Nat]Added 546 Read/Feed constraints in 196 ms returned sat
[2021-05-14 22:00:10] [INFO ] Deduced a trap composed of 13 places in 835 ms of which 1 ms to minimize.
[2021-05-14 22:00:11] [INFO ] Deduced a trap composed of 13 places in 805 ms of which 1 ms to minimize.
[2021-05-14 22:00:12] [INFO ] Deduced a trap composed of 13 places in 789 ms of which 1 ms to minimize.
[2021-05-14 22:00:13] [INFO ] Deduced a trap composed of 13 places in 851 ms of which 2 ms to minimize.
[2021-05-14 22:00:14] [INFO ] Deduced a trap composed of 2 places in 1278 ms of which 2 ms to minimize.
[2021-05-14 22:00:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-14 22:00:14] [INFO ] [Real]Absence check using 23 positive place invariants in 39 ms returned sat
[2021-05-14 22:00:14] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:00:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:00:15] [INFO ] [Real]Absence check using state equation in 808 ms returned sat
[2021-05-14 22:00:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:00:15] [INFO ] [Nat]Absence check using 23 positive place invariants in 39 ms returned sat
[2021-05-14 22:00:15] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 22:00:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:00:16] [INFO ] [Nat]Absence check using state equation in 768 ms returned sat
[2021-05-14 22:00:16] [INFO ] [Nat]Added 546 Read/Feed constraints in 178 ms returned sat
[2021-05-14 22:00:17] [INFO ] Deduced a trap composed of 52 places in 765 ms of which 1 ms to minimize.
[2021-05-14 22:00:18] [INFO ] Deduced a trap composed of 43 places in 801 ms of which 1 ms to minimize.
[2021-05-14 22:00:19] [INFO ] Deduced a trap composed of 96 places in 774 ms of which 3 ms to minimize.
[2021-05-14 22:00:20] [INFO ] Deduced a trap composed of 43 places in 824 ms of which 2 ms to minimize.
[2021-05-14 22:00:21] [INFO ] Deduced a trap composed of 43 places in 823 ms of which 2 ms to minimize.
[2021-05-14 22:00:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-14 22:00:21] [INFO ] [Real]Absence check using 23 positive place invariants in 37 ms returned sat
[2021-05-14 22:00:21] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 22:00:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:00:22] [INFO ] [Real]Absence check using state equation in 761 ms returned sat
[2021-05-14 22:00:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:00:22] [INFO ] [Nat]Absence check using 23 positive place invariants in 39 ms returned sat
[2021-05-14 22:00:22] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 22:00:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:00:23] [INFO ] [Nat]Absence check using state equation in 828 ms returned sat
[2021-05-14 22:00:23] [INFO ] [Nat]Added 546 Read/Feed constraints in 184 ms returned sat
[2021-05-14 22:00:24] [INFO ] Deduced a trap composed of 60 places in 955 ms of which 2 ms to minimize.
[2021-05-14 22:00:26] [INFO ] Deduced a trap composed of 13 places in 957 ms of which 1 ms to minimize.
[2021-05-14 22:00:27] [INFO ] Deduced a trap composed of 13 places in 954 ms of which 2 ms to minimize.
[2021-05-14 22:00:28] [INFO ] Deduced a trap composed of 13 places in 1004 ms of which 1 ms to minimize.
[2021-05-14 22:00:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-14 22:00:28] [INFO ] [Real]Absence check using 23 positive place invariants in 37 ms returned sat
[2021-05-14 22:00:28] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 22:00:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:00:29] [INFO ] [Real]Absence check using state equation in 783 ms returned sat
[2021-05-14 22:00:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:00:29] [INFO ] [Nat]Absence check using 23 positive place invariants in 40 ms returned sat
[2021-05-14 22:00:29] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:00:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:00:30] [INFO ] [Nat]Absence check using state equation in 845 ms returned sat
[2021-05-14 22:00:30] [INFO ] [Nat]Added 546 Read/Feed constraints in 179 ms returned sat
[2021-05-14 22:00:31] [INFO ] Deduced a trap composed of 17 places in 811 ms of which 1 ms to minimize.
[2021-05-14 22:00:32] [INFO ] Deduced a trap composed of 70 places in 791 ms of which 1 ms to minimize.
[2021-05-14 22:00:33] [INFO ] Deduced a trap composed of 133 places in 845 ms of which 2 ms to minimize.
[2021-05-14 22:00:34] [INFO ] Deduced a trap composed of 62 places in 841 ms of which 1 ms to minimize.
[2021-05-14 22:00:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-14 22:00:34] [INFO ] [Real]Absence check using 23 positive place invariants in 38 ms returned sat
[2021-05-14 22:00:34] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 22:00:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:00:35] [INFO ] [Real]Absence check using state equation in 850 ms returned sat
[2021-05-14 22:00:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:00:36] [INFO ] [Nat]Absence check using 23 positive place invariants in 39 ms returned sat
[2021-05-14 22:00:36] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2021-05-14 22:00:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:00:36] [INFO ] [Nat]Absence check using state equation in 773 ms returned sat
[2021-05-14 22:00:37] [INFO ] [Nat]Added 546 Read/Feed constraints in 175 ms returned sat
[2021-05-14 22:00:38] [INFO ] Deduced a trap composed of 110 places in 956 ms of which 2 ms to minimize.
[2021-05-14 22:00:39] [INFO ] Deduced a trap composed of 87 places in 944 ms of which 2 ms to minimize.
[2021-05-14 22:00:40] [INFO ] Deduced a trap composed of 87 places in 1023 ms of which 1 ms to minimize.
[2021-05-14 22:00:41] [INFO ] Deduced a trap composed of 13 places in 1014 ms of which 1 ms to minimize.
[2021-05-14 22:00:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-14 22:00:41] [INFO ] [Real]Absence check using 23 positive place invariants in 38 ms returned sat
[2021-05-14 22:00:41] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 22:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:00:42] [INFO ] [Real]Absence check using state equation in 852 ms returned sat
[2021-05-14 22:00:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:00:43] [INFO ] [Nat]Absence check using 23 positive place invariants in 39 ms returned sat
[2021-05-14 22:00:43] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 22:00:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:00:43] [INFO ] [Nat]Absence check using state equation in 765 ms returned sat
[2021-05-14 22:00:43] [INFO ] [Nat]Added 546 Read/Feed constraints in 187 ms returned sat
[2021-05-14 22:00:45] [INFO ] Deduced a trap composed of 13 places in 983 ms of which 1 ms to minimize.
[2021-05-14 22:00:46] [INFO ] Deduced a trap composed of 13 places in 988 ms of which 5 ms to minimize.
[2021-05-14 22:00:47] [INFO ] Deduced a trap composed of 49 places in 929 ms of which 2 ms to minimize.
[2021-05-14 22:00:48] [INFO ] Deduced a trap composed of 49 places in 987 ms of which 2 ms to minimize.
[2021-05-14 22:00:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [8, 8, 56, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[8, 8, 7, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA Peterson-PT-7-UpperBounds-01 8 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-7-UpperBounds-00 8 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 64 out of 1992 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 876 transitions
Trivial Post-agglo rules discarded 876 transitions
Performed 876 trivial Post agglomeration. Transition count delta: 876
Iterating post reduction 0 with 876 rules applied. Total rules applied 876 place count 1992 transition count 2220
Reduce places removed 876 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 880 rules applied. Total rules applied 1756 place count 1116 transition count 2216
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1760 place count 1112 transition count 2216
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 395 Pre rules applied. Total rules applied 1760 place count 1112 transition count 1821
Deduced a syphon composed of 395 places in 3 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 3 with 790 rules applied. Total rules applied 2550 place count 717 transition count 1821
Applied a total of 2550 rules in 440 ms. Remains 717 /1992 variables (removed 1275) and now considering 1821/3096 (removed 1275) transitions.
Finished structural reductions, in 1 iterations. Remains : 717/1992 places, 1821/3096 transitions.
Normalized transition count is 1485 out of 1821 initially.
// Phase 1: matrix 1485 rows 717 cols
[2021-05-14 22:00:48] [INFO ] Computed 31 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4111 ms. (steps per millisecond=243 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1452 ms. (steps per millisecond=688 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 833 ms. (steps per millisecond=1200 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 800 ms. (steps per millisecond=1250 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 788 ms. (steps per millisecond=1269 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 788 ms. (steps per millisecond=1269 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 777 ms. (steps per millisecond=1287 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 787 ms. (steps per millisecond=1270 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 774 ms. (steps per millisecond=1291 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 788 ms. (steps per millisecond=1269 ) properties (out of 9) seen :5
FORMULA Peterson-PT-7-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2021-05-14 22:01:00] [INFO ] Flow matrix only has 1485 transitions (discarded 336 similar events)
// Phase 1: matrix 1485 rows 717 cols
[2021-05-14 22:01:00] [INFO ] Computed 31 place invariants in 6 ms
[2021-05-14 22:01:00] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2021-05-14 22:01:00] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:01:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:01:01] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2021-05-14 22:01:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:01:01] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2021-05-14 22:01:01] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 22:01:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:01:01] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2021-05-14 22:01:01] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 22:01:01] [INFO ] [Nat]Added 546 Read/Feed constraints in 88 ms returned sat
[2021-05-14 22:01:01] [INFO ] Deduced a trap composed of 11 places in 258 ms of which 0 ms to minimize.
[2021-05-14 22:01:02] [INFO ] Deduced a trap composed of 15 places in 265 ms of which 1 ms to minimize.
[2021-05-14 22:01:02] [INFO ] Deduced a trap composed of 16 places in 257 ms of which 1 ms to minimize.
[2021-05-14 22:01:02] [INFO ] Deduced a trap composed of 15 places in 268 ms of which 1 ms to minimize.
[2021-05-14 22:01:03] [INFO ] Deduced a trap composed of 14 places in 260 ms of which 0 ms to minimize.
[2021-05-14 22:01:03] [INFO ] Deduced a trap composed of 33 places in 266 ms of which 0 ms to minimize.
[2021-05-14 22:01:03] [INFO ] Deduced a trap composed of 28 places in 250 ms of which 1 ms to minimize.
[2021-05-14 22:01:04] [INFO ] Deduced a trap composed of 39 places in 270 ms of which 0 ms to minimize.
[2021-05-14 22:01:04] [INFO ] Deduced a trap composed of 38 places in 273 ms of which 0 ms to minimize.
[2021-05-14 22:01:04] [INFO ] Deduced a trap composed of 38 places in 257 ms of which 1 ms to minimize.
[2021-05-14 22:01:04] [INFO ] Deduced a trap composed of 38 places in 270 ms of which 1 ms to minimize.
[2021-05-14 22:01:05] [INFO ] Deduced a trap composed of 38 places in 260 ms of which 0 ms to minimize.
[2021-05-14 22:01:05] [INFO ] Deduced a trap composed of 38 places in 271 ms of which 0 ms to minimize.
[2021-05-14 22:01:05] [INFO ] Deduced a trap composed of 44 places in 261 ms of which 1 ms to minimize.
[2021-05-14 22:01:06] [INFO ] Deduced a trap composed of 34 places in 279 ms of which 1 ms to minimize.
[2021-05-14 22:01:06] [INFO ] Deduced a trap composed of 33 places in 261 ms of which 1 ms to minimize.
[2021-05-14 22:01:06] [INFO ] Deduced a trap composed of 16 places in 278 ms of which 1 ms to minimize.
[2021-05-14 22:01:07] [INFO ] Deduced a trap composed of 47 places in 268 ms of which 1 ms to minimize.
[2021-05-14 22:01:07] [INFO ] Deduced a trap composed of 27 places in 284 ms of which 1 ms to minimize.
[2021-05-14 22:01:07] [INFO ] Deduced a trap composed of 38 places in 266 ms of which 12 ms to minimize.
[2021-05-14 22:01:08] [INFO ] Deduced a trap composed of 40 places in 264 ms of which 1 ms to minimize.
[2021-05-14 22:01:08] [INFO ] Deduced a trap composed of 53 places in 261 ms of which 0 ms to minimize.
[2021-05-14 22:01:08] [INFO ] Deduced a trap composed of 25 places in 251 ms of which 1 ms to minimize.
[2021-05-14 22:01:09] [INFO ] Deduced a trap composed of 25 places in 283 ms of which 0 ms to minimize.
[2021-05-14 22:01:09] [INFO ] Deduced a trap composed of 25 places in 293 ms of which 1 ms to minimize.
[2021-05-14 22:01:09] [INFO ] Deduced a trap composed of 50 places in 289 ms of which 1 ms to minimize.
[2021-05-14 22:01:10] [INFO ] Deduced a trap composed of 11 places in 293 ms of which 8 ms to minimize.
[2021-05-14 22:01:10] [INFO ] Deduced a trap composed of 18 places in 271 ms of which 1 ms to minimize.
[2021-05-14 22:01:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 28 trap constraints in 8774 ms
[2021-05-14 22:01:10] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2021-05-14 22:01:10] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:01:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:01:10] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2021-05-14 22:01:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:01:10] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2021-05-14 22:01:10] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 22:01:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:01:11] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2021-05-14 22:01:11] [INFO ] [Nat]Added 546 Read/Feed constraints in 62 ms returned sat
[2021-05-14 22:01:11] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 3 ms to minimize.
[2021-05-14 22:01:11] [INFO ] Deduced a trap composed of 26 places in 286 ms of which 2 ms to minimize.
[2021-05-14 22:01:12] [INFO ] Deduced a trap composed of 12 places in 284 ms of which 1 ms to minimize.
[2021-05-14 22:01:12] [INFO ] Deduced a trap composed of 59 places in 279 ms of which 0 ms to minimize.
[2021-05-14 22:01:12] [INFO ] Deduced a trap composed of 59 places in 277 ms of which 1 ms to minimize.
[2021-05-14 22:01:13] [INFO ] Deduced a trap composed of 27 places in 284 ms of which 1 ms to minimize.
[2021-05-14 22:01:13] [INFO ] Deduced a trap composed of 27 places in 260 ms of which 0 ms to minimize.
[2021-05-14 22:01:13] [INFO ] Deduced a trap composed of 59 places in 289 ms of which 0 ms to minimize.
[2021-05-14 22:01:14] [INFO ] Deduced a trap composed of 59 places in 293 ms of which 1 ms to minimize.
[2021-05-14 22:01:14] [INFO ] Deduced a trap composed of 70 places in 271 ms of which 1 ms to minimize.
[2021-05-14 22:01:14] [INFO ] Deduced a trap composed of 22 places in 276 ms of which 0 ms to minimize.
[2021-05-14 22:01:15] [INFO ] Deduced a trap composed of 40 places in 275 ms of which 1 ms to minimize.
[2021-05-14 22:01:15] [INFO ] Deduced a trap composed of 29 places in 254 ms of which 1 ms to minimize.
[2021-05-14 22:01:15] [INFO ] Deduced a trap composed of 15 places in 246 ms of which 0 ms to minimize.
[2021-05-14 22:01:15] [INFO ] Deduced a trap composed of 16 places in 239 ms of which 0 ms to minimize.
[2021-05-14 22:01:16] [INFO ] Deduced a trap composed of 13 places in 238 ms of which 1 ms to minimize.
[2021-05-14 22:01:16] [INFO ] Deduced a trap composed of 18 places in 236 ms of which 0 ms to minimize.
[2021-05-14 22:01:16] [INFO ] Deduced a trap composed of 18 places in 238 ms of which 0 ms to minimize.
[2021-05-14 22:01:17] [INFO ] Deduced a trap composed of 16 places in 243 ms of which 0 ms to minimize.
[2021-05-14 22:01:17] [INFO ] Deduced a trap composed of 16 places in 233 ms of which 1 ms to minimize.
[2021-05-14 22:01:17] [INFO ] Deduced a trap composed of 61 places in 209 ms of which 0 ms to minimize.
[2021-05-14 22:01:17] [INFO ] Deduced a trap composed of 48 places in 208 ms of which 0 ms to minimize.
[2021-05-14 22:01:18] [INFO ] Deduced a trap composed of 47 places in 217 ms of which 1 ms to minimize.
[2021-05-14 22:01:18] [INFO ] Deduced a trap composed of 48 places in 240 ms of which 1 ms to minimize.
[2021-05-14 22:01:18] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 0 ms to minimize.
[2021-05-14 22:01:18] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 1 ms to minimize.
[2021-05-14 22:01:19] [INFO ] Deduced a trap composed of 49 places in 225 ms of which 0 ms to minimize.
[2021-05-14 22:01:19] [INFO ] Deduced a trap composed of 49 places in 226 ms of which 1 ms to minimize.
[2021-05-14 22:01:19] [INFO ] Deduced a trap composed of 38 places in 217 ms of which 1 ms to minimize.
[2021-05-14 22:01:19] [INFO ] Deduced a trap composed of 26 places in 255 ms of which 1 ms to minimize.
[2021-05-14 22:01:20] [INFO ] Deduced a trap composed of 89 places in 240 ms of which 1 ms to minimize.
[2021-05-14 22:01:20] [INFO ] Deduced a trap composed of 72 places in 238 ms of which 1 ms to minimize.
[2021-05-14 22:01:20] [INFO ] Deduced a trap composed of 57 places in 216 ms of which 0 ms to minimize.
[2021-05-14 22:01:21] [INFO ] Deduced a trap composed of 57 places in 236 ms of which 0 ms to minimize.
[2021-05-14 22:01:21] [INFO ] Deduced a trap composed of 57 places in 251 ms of which 1 ms to minimize.
[2021-05-14 22:01:21] [INFO ] Deduced a trap composed of 44 places in 257 ms of which 1 ms to minimize.
[2021-05-14 22:01:21] [INFO ] Deduced a trap composed of 31 places in 251 ms of which 1 ms to minimize.
[2021-05-14 22:01:22] [INFO ] Deduced a trap composed of 31 places in 253 ms of which 1 ms to minimize.
[2021-05-14 22:01:22] [INFO ] Deduced a trap composed of 31 places in 260 ms of which 1 ms to minimize.
[2021-05-14 22:01:22] [INFO ] Deduced a trap composed of 31 places in 241 ms of which 1 ms to minimize.
[2021-05-14 22:01:23] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 1 ms to minimize.
[2021-05-14 22:01:23] [INFO ] Deduced a trap composed of 12 places in 237 ms of which 1 ms to minimize.
[2021-05-14 22:01:23] [INFO ] Deduced a trap composed of 26 places in 221 ms of which 0 ms to minimize.
[2021-05-14 22:01:23] [INFO ] Deduced a trap composed of 24 places in 203 ms of which 1 ms to minimize.
[2021-05-14 22:01:24] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 1 ms to minimize.
[2021-05-14 22:01:24] [INFO ] Deduced a trap composed of 51 places in 201 ms of which 1 ms to minimize.
[2021-05-14 22:01:24] [INFO ] Deduced a trap composed of 51 places in 203 ms of which 0 ms to minimize.
[2021-05-14 22:01:24] [INFO ] Deduced a trap composed of 51 places in 193 ms of which 1 ms to minimize.
[2021-05-14 22:01:25] [INFO ] Deduced a trap composed of 51 places in 213 ms of which 1 ms to minimize.
[2021-05-14 22:01:25] [INFO ] Deduced a trap composed of 45 places in 210 ms of which 0 ms to minimize.
[2021-05-14 22:01:25] [INFO ] Deduced a trap composed of 26 places in 285 ms of which 1 ms to minimize.
[2021-05-14 22:01:26] [INFO ] Deduced a trap composed of 50 places in 236 ms of which 0 ms to minimize.
[2021-05-14 22:01:26] [INFO ] Deduced a trap composed of 39 places in 226 ms of which 1 ms to minimize.
[2021-05-14 22:01:26] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 1 ms to minimize.
[2021-05-14 22:01:26] [INFO ] Deduced a trap composed of 51 places in 229 ms of which 9 ms to minimize.
[2021-05-14 22:01:27] [INFO ] Deduced a trap composed of 36 places in 246 ms of which 0 ms to minimize.
[2021-05-14 22:01:27] [INFO ] Deduced a trap composed of 52 places in 229 ms of which 0 ms to minimize.
[2021-05-14 22:01:27] [INFO ] Deduced a trap composed of 52 places in 244 ms of which 1 ms to minimize.
[2021-05-14 22:01:27] [INFO ] Deduced a trap composed of 38 places in 251 ms of which 1 ms to minimize.
[2021-05-14 22:01:28] [INFO ] Deduced a trap composed of 50 places in 220 ms of which 1 ms to minimize.
[2021-05-14 22:01:28] [INFO ] Deduced a trap composed of 47 places in 247 ms of which 0 ms to minimize.
[2021-05-14 22:01:28] [INFO ] Deduced a trap composed of 59 places in 252 ms of which 0 ms to minimize.
[2021-05-14 22:01:29] [INFO ] Deduced a trap composed of 38 places in 219 ms of which 0 ms to minimize.
[2021-05-14 22:01:29] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 0 ms to minimize.
[2021-05-14 22:01:29] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 1 ms to minimize.
[2021-05-14 22:01:29] [INFO ] Deduced a trap composed of 48 places in 176 ms of which 1 ms to minimize.
[2021-05-14 22:01:30] [INFO ] Deduced a trap composed of 57 places in 150 ms of which 0 ms to minimize.
[2021-05-14 22:01:30] [INFO ] Deduced a trap composed of 57 places in 160 ms of which 1 ms to minimize.
[2021-05-14 22:01:30] [INFO ] Deduced a trap composed of 65 places in 160 ms of which 1 ms to minimize.
[2021-05-14 22:01:30] [INFO ] Deduced a trap composed of 72 places in 131 ms of which 1 ms to minimize.
[2021-05-14 22:01:30] [INFO ] Deduced a trap composed of 68 places in 152 ms of which 0 ms to minimize.
[2021-05-14 22:01:30] [INFO ] Deduced a trap composed of 67 places in 132 ms of which 0 ms to minimize.
[2021-05-14 22:01:31] [INFO ] Deduced a trap composed of 72 places in 133 ms of which 0 ms to minimize.
[2021-05-14 22:01:31] [INFO ] Deduced a trap composed of 72 places in 140 ms of which 1 ms to minimize.
[2021-05-14 22:01:31] [INFO ] Deduced a trap composed of 68 places in 134 ms of which 1 ms to minimize.
[2021-05-14 22:01:31] [INFO ] Deduced a trap composed of 68 places in 133 ms of which 1 ms to minimize.
[2021-05-14 22:01:31] [INFO ] Deduced a trap composed of 74 places in 225 ms of which 1 ms to minimize.
[2021-05-14 22:01:32] [INFO ] Deduced a trap composed of 50 places in 224 ms of which 0 ms to minimize.
[2021-05-14 22:01:32] [INFO ] Deduced a trap composed of 26 places in 212 ms of which 1 ms to minimize.
[2021-05-14 22:01:32] [INFO ] Deduced a trap composed of 56 places in 176 ms of which 0 ms to minimize.
[2021-05-14 22:01:32] [INFO ] Deduced a trap composed of 73 places in 134 ms of which 1 ms to minimize.
[2021-05-14 22:01:33] [INFO ] Deduced a trap composed of 22 places in 256 ms of which 1 ms to minimize.
[2021-05-14 22:01:33] [INFO ] Deduced a trap composed of 25 places in 259 ms of which 1 ms to minimize.
[2021-05-14 22:01:33] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 1 ms to minimize.
[2021-05-14 22:01:34] [INFO ] Deduced a trap composed of 38 places in 229 ms of which 0 ms to minimize.
[2021-05-14 22:01:34] [INFO ] Deduced a trap composed of 122 places in 165 ms of which 1 ms to minimize.
[2021-05-14 22:01:34] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 0 ms to minimize.
[2021-05-14 22:01:34] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 0 ms to minimize.
[2021-05-14 22:01:35] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 0 ms to minimize.
[2021-05-14 22:01:35] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 0 ms to minimize.
[2021-05-14 22:01:35] [INFO ] Deduced a trap composed of 49 places in 229 ms of which 0 ms to minimize.
[2021-05-14 22:01:36] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 0 ms to minimize.
[2021-05-14 22:01:36] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 0 ms to minimize.
[2021-05-14 22:01:36] [INFO ] Trap strengthening (SAT) tested/added 94/93 trap constraints in 25023 ms
[2021-05-14 22:01:36] [INFO ] Computed and/alt/rep : 1365/4565/1365 causal constraints (skipped 112 transitions) in 110 ms.
[2021-05-14 22:01:55] [INFO ] Added : 1065 causal constraints over 213 iterations in 19531 ms. Result :unknown
[2021-05-14 22:01:55] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2021-05-14 22:01:55] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:01:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:01:56] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2021-05-14 22:01:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:01:56] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2021-05-14 22:01:56] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 22:01:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:01:56] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2021-05-14 22:01:56] [INFO ] [Nat]Added 546 Read/Feed constraints in 64 ms returned sat
[2021-05-14 22:01:57] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 0 ms to minimize.
[2021-05-14 22:01:57] [INFO ] Deduced a trap composed of 22 places in 236 ms of which 0 ms to minimize.
[2021-05-14 22:01:57] [INFO ] Deduced a trap composed of 24 places in 237 ms of which 1 ms to minimize.
[2021-05-14 22:01:57] [INFO ] Deduced a trap composed of 24 places in 237 ms of which 0 ms to minimize.
[2021-05-14 22:01:58] [INFO ] Deduced a trap composed of 14 places in 261 ms of which 1 ms to minimize.
[2021-05-14 22:01:58] [INFO ] Deduced a trap composed of 35 places in 252 ms of which 0 ms to minimize.
[2021-05-14 22:01:58] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 1 ms to minimize.
[2021-05-14 22:01:59] [INFO ] Deduced a trap composed of 58 places in 240 ms of which 0 ms to minimize.
[2021-05-14 22:01:59] [INFO ] Deduced a trap composed of 35 places in 251 ms of which 1 ms to minimize.
[2021-05-14 22:01:59] [INFO ] Deduced a trap composed of 35 places in 223 ms of which 1 ms to minimize.
[2021-05-14 22:01:59] [INFO ] Deduced a trap composed of 40 places in 220 ms of which 1 ms to minimize.
[2021-05-14 22:02:00] [INFO ] Deduced a trap composed of 68 places in 219 ms of which 1 ms to minimize.
[2021-05-14 22:02:00] [INFO ] Deduced a trap composed of 40 places in 233 ms of which 0 ms to minimize.
[2021-05-14 22:02:00] [INFO ] Deduced a trap composed of 40 places in 246 ms of which 1 ms to minimize.
[2021-05-14 22:02:00] [INFO ] Deduced a trap composed of 40 places in 220 ms of which 1 ms to minimize.
[2021-05-14 22:02:01] [INFO ] Deduced a trap composed of 40 places in 234 ms of which 1 ms to minimize.
[2021-05-14 22:02:01] [INFO ] Deduced a trap composed of 69 places in 241 ms of which 0 ms to minimize.
[2021-05-14 22:02:01] [INFO ] Deduced a trap composed of 40 places in 221 ms of which 1 ms to minimize.
[2021-05-14 22:02:02] [INFO ] Deduced a trap composed of 62 places in 230 ms of which 0 ms to minimize.
[2021-05-14 22:02:02] [INFO ] Deduced a trap composed of 57 places in 260 ms of which 1 ms to minimize.
[2021-05-14 22:02:02] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 0 ms to minimize.
[2021-05-14 22:02:02] [INFO ] Deduced a trap composed of 41 places in 231 ms of which 0 ms to minimize.
[2021-05-14 22:02:03] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 0 ms to minimize.
[2021-05-14 22:02:03] [INFO ] Deduced a trap composed of 13 places in 245 ms of which 1 ms to minimize.
[2021-05-14 22:02:03] [INFO ] Deduced a trap composed of 14 places in 237 ms of which 1 ms to minimize.
[2021-05-14 22:02:04] [INFO ] Deduced a trap composed of 35 places in 226 ms of which 1 ms to minimize.
[2021-05-14 22:02:04] [INFO ] Deduced a trap composed of 35 places in 227 ms of which 1 ms to minimize.
[2021-05-14 22:02:04] [INFO ] Deduced a trap composed of 46 places in 235 ms of which 1 ms to minimize.
[2021-05-14 22:02:04] [INFO ] Deduced a trap composed of 34 places in 239 ms of which 0 ms to minimize.
[2021-05-14 22:02:05] [INFO ] Deduced a trap composed of 64 places in 276 ms of which 1 ms to minimize.
[2021-05-14 22:02:05] [INFO ] Deduced a trap composed of 26 places in 305 ms of which 0 ms to minimize.
[2021-05-14 22:02:05] [INFO ] Deduced a trap composed of 98 places in 295 ms of which 1 ms to minimize.
[2021-05-14 22:02:06] [INFO ] Deduced a trap composed of 69 places in 296 ms of which 1 ms to minimize.
[2021-05-14 22:02:06] [INFO ] Deduced a trap composed of 120 places in 296 ms of which 0 ms to minimize.
[2021-05-14 22:02:06] [INFO ] Deduced a trap composed of 90 places in 292 ms of which 1 ms to minimize.
[2021-05-14 22:02:07] [INFO ] Deduced a trap composed of 76 places in 294 ms of which 1 ms to minimize.
[2021-05-14 22:02:07] [INFO ] Deduced a trap composed of 47 places in 264 ms of which 1 ms to minimize.
[2021-05-14 22:02:07] [INFO ] Deduced a trap composed of 78 places in 292 ms of which 1 ms to minimize.
[2021-05-14 22:02:08] [INFO ] Deduced a trap composed of 36 places in 302 ms of which 1 ms to minimize.
[2021-05-14 22:02:08] [INFO ] Deduced a trap composed of 36 places in 272 ms of which 1 ms to minimize.
[2021-05-14 22:02:08] [INFO ] Deduced a trap composed of 36 places in 262 ms of which 0 ms to minimize.
[2021-05-14 22:02:09] [INFO ] Deduced a trap composed of 11 places in 262 ms of which 1 ms to minimize.
[2021-05-14 22:02:09] [INFO ] Deduced a trap composed of 16 places in 270 ms of which 1 ms to minimize.
[2021-05-14 22:02:09] [INFO ] Deduced a trap composed of 33 places in 263 ms of which 1 ms to minimize.
[2021-05-14 22:02:10] [INFO ] Deduced a trap composed of 33 places in 277 ms of which 1 ms to minimize.
[2021-05-14 22:02:10] [INFO ] Deduced a trap composed of 11 places in 279 ms of which 0 ms to minimize.
[2021-05-14 22:02:10] [INFO ] Deduced a trap composed of 16 places in 269 ms of which 0 ms to minimize.
[2021-05-14 22:02:10] [INFO ] Deduced a trap composed of 33 places in 248 ms of which 0 ms to minimize.
[2021-05-14 22:02:11] [INFO ] Deduced a trap composed of 29 places in 265 ms of which 1 ms to minimize.
[2021-05-14 22:02:11] [INFO ] Deduced a trap composed of 38 places in 277 ms of which 1 ms to minimize.
[2021-05-14 22:02:11] [INFO ] Deduced a trap composed of 33 places in 264 ms of which 1 ms to minimize.
[2021-05-14 22:02:12] [INFO ] Deduced a trap composed of 27 places in 274 ms of which 0 ms to minimize.
[2021-05-14 22:02:12] [INFO ] Deduced a trap composed of 24 places in 254 ms of which 1 ms to minimize.
[2021-05-14 22:02:12] [INFO ] Deduced a trap composed of 25 places in 254 ms of which 1 ms to minimize.
[2021-05-14 22:02:13] [INFO ] Deduced a trap composed of 26 places in 280 ms of which 1 ms to minimize.
[2021-05-14 22:02:13] [INFO ] Deduced a trap composed of 25 places in 266 ms of which 1 ms to minimize.
[2021-05-14 22:02:13] [INFO ] Deduced a trap composed of 25 places in 259 ms of which 1 ms to minimize.
[2021-05-14 22:02:14] [INFO ] Deduced a trap composed of 24 places in 280 ms of which 1 ms to minimize.
[2021-05-14 22:02:14] [INFO ] Deduced a trap composed of 29 places in 292 ms of which 1 ms to minimize.
[2021-05-14 22:02:14] [INFO ] Deduced a trap composed of 37 places in 231 ms of which 0 ms to minimize.
[2021-05-14 22:02:14] [INFO ] Deduced a trap composed of 80 places in 224 ms of which 0 ms to minimize.
[2021-05-14 22:02:15] [INFO ] Deduced a trap composed of 47 places in 216 ms of which 0 ms to minimize.
[2021-05-14 22:02:15] [INFO ] Deduced a trap composed of 58 places in 213 ms of which 0 ms to minimize.
[2021-05-14 22:02:15] [INFO ] Deduced a trap composed of 58 places in 211 ms of which 1 ms to minimize.
[2021-05-14 22:02:15] [INFO ] Deduced a trap composed of 58 places in 213 ms of which 0 ms to minimize.
[2021-05-14 22:02:16] [INFO ] Deduced a trap composed of 58 places in 202 ms of which 0 ms to minimize.
[2021-05-14 22:02:16] [INFO ] Deduced a trap composed of 58 places in 227 ms of which 1 ms to minimize.
[2021-05-14 22:02:16] [INFO ] Deduced a trap composed of 58 places in 216 ms of which 0 ms to minimize.
[2021-05-14 22:02:17] [INFO ] Deduced a trap composed of 76 places in 217 ms of which 0 ms to minimize.
[2021-05-14 22:02:17] [INFO ] Deduced a trap composed of 69 places in 192 ms of which 1 ms to minimize.
[2021-05-14 22:02:17] [INFO ] Deduced a trap composed of 69 places in 185 ms of which 0 ms to minimize.
[2021-05-14 22:02:17] [INFO ] Deduced a trap composed of 80 places in 190 ms of which 0 ms to minimize.
[2021-05-14 22:02:17] [INFO ] Deduced a trap composed of 72 places in 182 ms of which 0 ms to minimize.
[2021-05-14 22:02:18] [INFO ] Deduced a trap composed of 69 places in 182 ms of which 1 ms to minimize.
[2021-05-14 22:02:18] [INFO ] Deduced a trap composed of 80 places in 181 ms of which 0 ms to minimize.
[2021-05-14 22:02:18] [INFO ] Deduced a trap composed of 80 places in 180 ms of which 1 ms to minimize.
[2021-05-14 22:02:18] [INFO ] Deduced a trap composed of 69 places in 184 ms of which 1 ms to minimize.
[2021-05-14 22:02:19] [INFO ] Deduced a trap composed of 69 places in 184 ms of which 1 ms to minimize.
[2021-05-14 22:02:19] [INFO ] Deduced a trap composed of 80 places in 192 ms of which 1 ms to minimize.
[2021-05-14 22:02:19] [INFO ] Deduced a trap composed of 80 places in 184 ms of which 0 ms to minimize.
[2021-05-14 22:02:19] [INFO ] Deduced a trap composed of 71 places in 149 ms of which 0 ms to minimize.
[2021-05-14 22:02:19] [INFO ] Deduced a trap composed of 68 places in 185 ms of which 0 ms to minimize.
[2021-05-14 22:02:20] [INFO ] Deduced a trap composed of 57 places in 152 ms of which 0 ms to minimize.
[2021-05-14 22:02:20] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 1 ms to minimize.
[2021-05-14 22:02:20] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 0 ms to minimize.
[2021-05-14 22:02:20] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 0 ms to minimize.
[2021-05-14 22:02:20] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 0 ms to minimize.
[2021-05-14 22:02:21] [INFO ] Deduced a trap composed of 69 places in 248 ms of which 1 ms to minimize.
[2021-05-14 22:02:21] [INFO ] Deduced a trap composed of 69 places in 248 ms of which 0 ms to minimize.
[2021-05-14 22:02:22] [INFO ] Deduced a trap composed of 55 places in 251 ms of which 1 ms to minimize.
[2021-05-14 22:02:22] [INFO ] Deduced a trap composed of 62 places in 249 ms of which 1 ms to minimize.
[2021-05-14 22:02:22] [INFO ] Deduced a trap composed of 68 places in 225 ms of which 0 ms to minimize.
[2021-05-14 22:02:22] [INFO ] Deduced a trap composed of 66 places in 211 ms of which 0 ms to minimize.
[2021-05-14 22:02:23] [INFO ] Deduced a trap composed of 57 places in 209 ms of which 1 ms to minimize.
[2021-05-14 22:02:23] [INFO ] Deduced a trap composed of 55 places in 217 ms of which 0 ms to minimize.
[2021-05-14 22:02:23] [INFO ] Trap strengthening (SAT) tested/added 96/95 trap constraints in 26612 ms
[2021-05-14 22:02:23] [INFO ] Computed and/alt/rep : 1365/4565/1365 causal constraints (skipped 112 transitions) in 95 ms.
[2021-05-14 22:02:41] [INFO ] Deduced a trap composed of 2 places in 351 ms of which 0 ms to minimize.
[2021-05-14 22:02:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-14 22:02:41] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2021-05-14 22:02:41] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2021-05-14 22:02:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:02:42] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2021-05-14 22:02:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:02:42] [INFO ] [Nat]Absence check using 23 positive place invariants in 30 ms returned sat
[2021-05-14 22:02:42] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:02:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:02:42] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2021-05-14 22:02:42] [INFO ] [Nat]Added 546 Read/Feed constraints in 67 ms returned sat
[2021-05-14 22:02:43] [INFO ] Deduced a trap composed of 12 places in 301 ms of which 17 ms to minimize.
[2021-05-14 22:02:43] [INFO ] Deduced a trap composed of 13 places in 305 ms of which 3 ms to minimize.
[2021-05-14 22:02:43] [INFO ] Deduced a trap composed of 11 places in 279 ms of which 1 ms to minimize.
[2021-05-14 22:02:44] [INFO ] Deduced a trap composed of 34 places in 272 ms of which 1 ms to minimize.
[2021-05-14 22:02:44] [INFO ] Deduced a trap composed of 52 places in 297 ms of which 1 ms to minimize.
[2021-05-14 22:02:44] [INFO ] Deduced a trap composed of 51 places in 298 ms of which 1 ms to minimize.
[2021-05-14 22:02:45] [INFO ] Deduced a trap composed of 52 places in 293 ms of which 0 ms to minimize.
[2021-05-14 22:02:45] [INFO ] Deduced a trap composed of 11 places in 283 ms of which 0 ms to minimize.
[2021-05-14 22:02:45] [INFO ] Deduced a trap composed of 11 places in 289 ms of which 0 ms to minimize.
[2021-05-14 22:02:46] [INFO ] Deduced a trap composed of 13 places in 309 ms of which 1 ms to minimize.
[2021-05-14 22:02:46] [INFO ] Deduced a trap composed of 16 places in 294 ms of which 1 ms to minimize.
[2021-05-14 22:02:46] [INFO ] Deduced a trap composed of 27 places in 287 ms of which 0 ms to minimize.
[2021-05-14 22:02:47] [INFO ] Deduced a trap composed of 48 places in 274 ms of which 1 ms to minimize.
[2021-05-14 22:02:47] [INFO ] Deduced a trap composed of 49 places in 254 ms of which 0 ms to minimize.
[2021-05-14 22:02:47] [INFO ] Deduced a trap composed of 49 places in 242 ms of which 1 ms to minimize.
[2021-05-14 22:02:47] [INFO ] Deduced a trap composed of 63 places in 253 ms of which 1 ms to minimize.
[2021-05-14 22:02:48] [INFO ] Deduced a trap composed of 38 places in 263 ms of which 0 ms to minimize.
[2021-05-14 22:02:48] [INFO ] Deduced a trap composed of 62 places in 270 ms of which 1 ms to minimize.
[2021-05-14 22:02:48] [INFO ] Deduced a trap composed of 74 places in 242 ms of which 1 ms to minimize.
[2021-05-14 22:02:49] [INFO ] Deduced a trap composed of 74 places in 223 ms of which 0 ms to minimize.
[2021-05-14 22:02:49] [INFO ] Deduced a trap composed of 73 places in 241 ms of which 1 ms to minimize.
[2021-05-14 22:02:49] [INFO ] Deduced a trap composed of 73 places in 231 ms of which 0 ms to minimize.
[2021-05-14 22:02:49] [INFO ] Deduced a trap composed of 62 places in 222 ms of which 1 ms to minimize.
[2021-05-14 22:02:50] [INFO ] Deduced a trap composed of 79 places in 242 ms of which 1 ms to minimize.
[2021-05-14 22:02:50] [INFO ] Deduced a trap composed of 65 places in 194 ms of which 1 ms to minimize.
[2021-05-14 22:02:50] [INFO ] Deduced a trap composed of 61 places in 196 ms of which 1 ms to minimize.
[2021-05-14 22:02:51] [INFO ] Deduced a trap composed of 51 places in 250 ms of which 1 ms to minimize.
[2021-05-14 22:02:51] [INFO ] Deduced a trap composed of 68 places in 244 ms of which 1 ms to minimize.
[2021-05-14 22:02:51] [INFO ] Deduced a trap composed of 80 places in 221 ms of which 1 ms to minimize.
[2021-05-14 22:02:51] [INFO ] Deduced a trap composed of 69 places in 219 ms of which 1 ms to minimize.
[2021-05-14 22:02:52] [INFO ] Deduced a trap composed of 129 places in 221 ms of which 1 ms to minimize.
[2021-05-14 22:02:52] [INFO ] Deduced a trap composed of 57 places in 227 ms of which 0 ms to minimize.
[2021-05-14 22:02:52] [INFO ] Deduced a trap composed of 38 places in 264 ms of which 1 ms to minimize.
[2021-05-14 22:02:52] [INFO ] Deduced a trap composed of 93 places in 268 ms of which 0 ms to minimize.
[2021-05-14 22:02:53] [INFO ] Deduced a trap composed of 85 places in 248 ms of which 0 ms to minimize.
[2021-05-14 22:02:53] [INFO ] Deduced a trap composed of 39 places in 204 ms of which 1 ms to minimize.
[2021-05-14 22:02:53] [INFO ] Deduced a trap composed of 39 places in 245 ms of which 0 ms to minimize.
[2021-05-14 22:02:54] [INFO ] Deduced a trap composed of 39 places in 253 ms of which 1 ms to minimize.
[2021-05-14 22:02:54] [INFO ] Deduced a trap composed of 86 places in 250 ms of which 0 ms to minimize.
[2021-05-14 22:02:54] [INFO ] Deduced a trap composed of 38 places in 206 ms of which 1 ms to minimize.
[2021-05-14 22:02:54] [INFO ] Deduced a trap composed of 62 places in 186 ms of which 0 ms to minimize.
[2021-05-14 22:02:55] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 1 ms to minimize.
[2021-05-14 22:02:55] [INFO ] Deduced a trap composed of 53 places in 195 ms of which 0 ms to minimize.
[2021-05-14 22:02:55] [INFO ] Deduced a trap composed of 76 places in 251 ms of which 0 ms to minimize.
[2021-05-14 22:02:55] [INFO ] Deduced a trap composed of 12 places in 215 ms of which 1 ms to minimize.
[2021-05-14 22:02:56] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 1 ms to minimize.
[2021-05-14 22:02:56] [INFO ] Deduced a trap composed of 22 places in 227 ms of which 0 ms to minimize.
[2021-05-14 22:02:56] [INFO ] Deduced a trap composed of 22 places in 230 ms of which 0 ms to minimize.
[2021-05-14 22:02:56] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 1 ms to minimize.
[2021-05-14 22:02:57] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 1 ms to minimize.
[2021-05-14 22:02:57] [INFO ] Deduced a trap composed of 27 places in 231 ms of which 0 ms to minimize.
[2021-05-14 22:02:57] [INFO ] Deduced a trap composed of 22 places in 205 ms of which 1 ms to minimize.
[2021-05-14 22:02:58] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 1 ms to minimize.
[2021-05-14 22:02:58] [INFO ] Deduced a trap composed of 26 places in 244 ms of which 0 ms to minimize.
[2021-05-14 22:02:58] [INFO ] Deduced a trap composed of 12 places in 259 ms of which 1 ms to minimize.
[2021-05-14 22:02:58] [INFO ] Deduced a trap composed of 33 places in 236 ms of which 1 ms to minimize.
[2021-05-14 22:02:59] [INFO ] Deduced a trap composed of 33 places in 257 ms of which 0 ms to minimize.
[2021-05-14 22:02:59] [INFO ] Deduced a trap composed of 16 places in 224 ms of which 0 ms to minimize.
[2021-05-14 22:02:59] [INFO ] Deduced a trap composed of 48 places in 221 ms of which 0 ms to minimize.
[2021-05-14 22:02:59] [INFO ] Deduced a trap composed of 47 places in 217 ms of which 1 ms to minimize.
[2021-05-14 22:03:00] [INFO ] Deduced a trap composed of 17 places in 234 ms of which 1 ms to minimize.
[2021-05-14 22:03:00] [INFO ] Deduced a trap composed of 52 places in 180 ms of which 1 ms to minimize.
[2021-05-14 22:03:00] [INFO ] Deduced a trap composed of 50 places in 177 ms of which 0 ms to minimize.
[2021-05-14 22:03:00] [INFO ] Deduced a trap composed of 52 places in 176 ms of which 1 ms to minimize.
[2021-05-14 22:03:01] [INFO ] Deduced a trap composed of 52 places in 192 ms of which 0 ms to minimize.
[2021-05-14 22:03:01] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 1 ms to minimize.
[2021-05-14 22:03:01] [INFO ] Deduced a trap composed of 44 places in 206 ms of which 0 ms to minimize.
[2021-05-14 22:03:01] [INFO ] Deduced a trap composed of 11 places in 253 ms of which 1 ms to minimize.
[2021-05-14 22:03:02] [INFO ] Deduced a trap composed of 46 places in 189 ms of which 1 ms to minimize.
[2021-05-14 22:03:02] [INFO ] Deduced a trap composed of 48 places in 230 ms of which 0 ms to minimize.
[2021-05-14 22:03:02] [INFO ] Deduced a trap composed of 51 places in 233 ms of which 0 ms to minimize.
[2021-05-14 22:03:02] [INFO ] Deduced a trap composed of 22 places in 220 ms of which 0 ms to minimize.
[2021-05-14 22:03:03] [INFO ] Deduced a trap composed of 51 places in 270 ms of which 1 ms to minimize.
[2021-05-14 22:03:03] [INFO ] Deduced a trap composed of 29 places in 252 ms of which 1 ms to minimize.
[2021-05-14 22:03:03] [INFO ] Deduced a trap composed of 51 places in 250 ms of which 1 ms to minimize.
[2021-05-14 22:03:04] [INFO ] Deduced a trap composed of 74 places in 228 ms of which 0 ms to minimize.
[2021-05-14 22:03:04] [INFO ] Deduced a trap composed of 23 places in 260 ms of which 7 ms to minimize.
[2021-05-14 22:03:04] [INFO ] Deduced a trap composed of 68 places in 225 ms of which 1 ms to minimize.
[2021-05-14 22:03:05] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 1 ms to minimize.
[2021-05-14 22:03:05] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 0 ms to minimize.
[2021-05-14 22:03:05] [INFO ] Deduced a trap composed of 89 places in 153 ms of which 0 ms to minimize.
[2021-05-14 22:03:05] [INFO ] Deduced a trap composed of 58 places in 133 ms of which 1 ms to minimize.
[2021-05-14 22:03:05] [INFO ] Deduced a trap composed of 85 places in 164 ms of which 0 ms to minimize.
[2021-05-14 22:03:05] [INFO ] Deduced a trap composed of 85 places in 171 ms of which 0 ms to minimize.
[2021-05-14 22:03:06] [INFO ] Deduced a trap composed of 70 places in 126 ms of which 0 ms to minimize.
[2021-05-14 22:03:06] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 1 ms to minimize.
[2021-05-14 22:03:06] [INFO ] Trap strengthening (SAT) tested/added 87/86 trap constraints in 23700 ms
[2021-05-14 22:03:06] [INFO ] Computed and/alt/rep : 1365/4565/1365 causal constraints (skipped 112 transitions) in 78 ms.
[2021-05-14 22:03:25] [INFO ] Added : 1057 causal constraints over 212 iterations in 19416 ms. Result :sat
Minimization took 670 ms.
[2021-05-14 22:03:26] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2021-05-14 22:03:26] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:03:26] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2021-05-14 22:03:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:03:27] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2021-05-14 22:03:27] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2021-05-14 22:03:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:03:27] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2021-05-14 22:03:27] [INFO ] [Nat]Added 546 Read/Feed constraints in 63 ms returned sat
[2021-05-14 22:03:27] [INFO ] Deduced a trap composed of 33 places in 282 ms of which 1 ms to minimize.
[2021-05-14 22:03:28] [INFO ] Deduced a trap composed of 45 places in 271 ms of which 0 ms to minimize.
[2021-05-14 22:03:28] [INFO ] Deduced a trap composed of 45 places in 276 ms of which 1 ms to minimize.
[2021-05-14 22:03:28] [INFO ] Deduced a trap composed of 56 places in 271 ms of which 0 ms to minimize.
[2021-05-14 22:03:29] [INFO ] Deduced a trap composed of 38 places in 285 ms of which 1 ms to minimize.
[2021-05-14 22:03:29] [INFO ] Deduced a trap composed of 11 places in 278 ms of which 1 ms to minimize.
[2021-05-14 22:03:29] [INFO ] Deduced a trap composed of 45 places in 261 ms of which 0 ms to minimize.
[2021-05-14 22:03:29] [INFO ] Deduced a trap composed of 16 places in 260 ms of which 1 ms to minimize.
[2021-05-14 22:03:30] [INFO ] Deduced a trap composed of 33 places in 271 ms of which 0 ms to minimize.
[2021-05-14 22:03:30] [INFO ] Deduced a trap composed of 33 places in 281 ms of which 1 ms to minimize.
[2021-05-14 22:03:30] [INFO ] Deduced a trap composed of 33 places in 260 ms of which 1 ms to minimize.
[2021-05-14 22:03:31] [INFO ] Deduced a trap composed of 33 places in 272 ms of which 0 ms to minimize.
[2021-05-14 22:03:31] [INFO ] Deduced a trap composed of 33 places in 273 ms of which 1 ms to minimize.
[2021-05-14 22:03:31] [INFO ] Deduced a trap composed of 79 places in 288 ms of which 0 ms to minimize.
[2021-05-14 22:03:32] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 0 ms to minimize.
[2021-05-14 22:03:32] [INFO ] Deduced a trap composed of 11 places in 236 ms of which 1 ms to minimize.
[2021-05-14 22:03:32] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 0 ms to minimize.
[2021-05-14 22:03:32] [INFO ] Deduced a trap composed of 18 places in 250 ms of which 0 ms to minimize.
[2021-05-14 22:03:33] [INFO ] Deduced a trap composed of 17 places in 240 ms of which 0 ms to minimize.
[2021-05-14 22:03:33] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 1 ms to minimize.
[2021-05-14 22:03:33] [INFO ] Deduced a trap composed of 70 places in 224 ms of which 1 ms to minimize.
[2021-05-14 22:03:34] [INFO ] Deduced a trap composed of 62 places in 225 ms of which 0 ms to minimize.
[2021-05-14 22:03:34] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 0 ms to minimize.
[2021-05-14 22:03:34] [INFO ] Deduced a trap composed of 24 places in 285 ms of which 0 ms to minimize.
[2021-05-14 22:03:34] [INFO ] Deduced a trap composed of 24 places in 253 ms of which 1 ms to minimize.
[2021-05-14 22:03:35] [INFO ] Deduced a trap composed of 27 places in 252 ms of which 1 ms to minimize.
[2021-05-14 22:03:35] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 0 ms to minimize.
[2021-05-14 22:03:35] [INFO ] Deduced a trap composed of 24 places in 271 ms of which 1 ms to minimize.
[2021-05-14 22:03:36] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 1 ms to minimize.
[2021-05-14 22:03:36] [INFO ] Deduced a trap composed of 36 places in 233 ms of which 1 ms to minimize.
[2021-05-14 22:03:36] [INFO ] Deduced a trap composed of 33 places in 258 ms of which 1 ms to minimize.
[2021-05-14 22:03:37] [INFO ] Deduced a trap composed of 79 places in 210 ms of which 0 ms to minimize.
[2021-05-14 22:03:37] [INFO ] Deduced a trap composed of 108 places in 228 ms of which 0 ms to minimize.
[2021-05-14 22:03:37] [INFO ] Deduced a trap composed of 72 places in 189 ms of which 1 ms to minimize.
[2021-05-14 22:03:37] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 1 ms to minimize.
[2021-05-14 22:03:37] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 1 ms to minimize.
[2021-05-14 22:03:38] [INFO ] Deduced a trap composed of 72 places in 176 ms of which 1 ms to minimize.
[2021-05-14 22:03:38] [INFO ] Deduced a trap composed of 53 places in 173 ms of which 0 ms to minimize.
[2021-05-14 22:03:38] [INFO ] Deduced a trap composed of 53 places in 171 ms of which 0 ms to minimize.
[2021-05-14 22:03:38] [INFO ] Deduced a trap composed of 53 places in 170 ms of which 0 ms to minimize.
[2021-05-14 22:03:39] [INFO ] Deduced a trap composed of 53 places in 191 ms of which 0 ms to minimize.
[2021-05-14 22:03:39] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 1 ms to minimize.
[2021-05-14 22:03:39] [INFO ] Deduced a trap composed of 53 places in 172 ms of which 0 ms to minimize.
[2021-05-14 22:03:39] [INFO ] Deduced a trap composed of 53 places in 184 ms of which 0 ms to minimize.
[2021-05-14 22:03:39] [INFO ] Deduced a trap composed of 63 places in 172 ms of which 0 ms to minimize.
[2021-05-14 22:03:40] [INFO ] Deduced a trap composed of 49 places in 172 ms of which 0 ms to minimize.
[2021-05-14 22:03:40] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 1 ms to minimize.
[2021-05-14 22:03:40] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 1 ms to minimize.
[2021-05-14 22:03:40] [INFO ] Deduced a trap composed of 49 places in 184 ms of which 1 ms to minimize.
[2021-05-14 22:03:41] [INFO ] Deduced a trap composed of 46 places in 188 ms of which 0 ms to minimize.
[2021-05-14 22:03:41] [INFO ] Deduced a trap composed of 68 places in 182 ms of which 0 ms to minimize.
[2021-05-14 22:03:41] [INFO ] Deduced a trap composed of 71 places in 188 ms of which 1 ms to minimize.
[2021-05-14 22:03:41] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 1 ms to minimize.
[2021-05-14 22:03:41] [INFO ] Deduced a trap composed of 66 places in 141 ms of which 0 ms to minimize.
[2021-05-14 22:03:42] [INFO ] Deduced a trap composed of 66 places in 140 ms of which 0 ms to minimize.
[2021-05-14 22:03:42] [INFO ] Deduced a trap composed of 66 places in 142 ms of which 0 ms to minimize.
[2021-05-14 22:03:42] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 1 ms to minimize.
[2021-05-14 22:03:42] [INFO ] Deduced a trap composed of 66 places in 159 ms of which 1 ms to minimize.
[2021-05-14 22:03:42] [INFO ] Deduced a trap composed of 66 places in 172 ms of which 0 ms to minimize.
[2021-05-14 22:03:43] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 1 ms to minimize.
[2021-05-14 22:03:43] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 0 ms to minimize.
[2021-05-14 22:03:43] [INFO ] Deduced a trap composed of 78 places in 133 ms of which 1 ms to minimize.
[2021-05-14 22:03:43] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 1 ms to minimize.
[2021-05-14 22:03:43] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 1 ms to minimize.
[2021-05-14 22:03:44] [INFO ] Deduced a trap composed of 78 places in 137 ms of which 1 ms to minimize.
[2021-05-14 22:03:44] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 0 ms to minimize.
[2021-05-14 22:03:44] [INFO ] Deduced a trap composed of 21 places in 280 ms of which 0 ms to minimize.
[2021-05-14 22:03:45] [INFO ] Deduced a trap composed of 67 places in 289 ms of which 1 ms to minimize.
[2021-05-14 22:03:45] [INFO ] Deduced a trap composed of 62 places in 288 ms of which 0 ms to minimize.
[2021-05-14 22:03:45] [INFO ] Deduced a trap composed of 11 places in 270 ms of which 0 ms to minimize.
[2021-05-14 22:03:46] [INFO ] Deduced a trap composed of 49 places in 247 ms of which 1 ms to minimize.
[2021-05-14 22:03:46] [INFO ] Deduced a trap composed of 53 places in 259 ms of which 1 ms to minimize.
[2021-05-14 22:03:46] [INFO ] Deduced a trap composed of 66 places in 226 ms of which 1 ms to minimize.
[2021-05-14 22:03:46] [INFO ] Deduced a trap composed of 13 places in 269 ms of which 1 ms to minimize.
[2021-05-14 22:03:47] [INFO ] Deduced a trap composed of 13 places in 268 ms of which 1 ms to minimize.
[2021-05-14 22:03:47] [INFO ] Deduced a trap composed of 16 places in 251 ms of which 0 ms to minimize.
[2021-05-14 22:03:47] [INFO ] Deduced a trap composed of 50 places in 205 ms of which 0 ms to minimize.
[2021-05-14 22:03:48] [INFO ] Deduced a trap composed of 70 places in 192 ms of which 0 ms to minimize.
[2021-05-14 22:03:48] [INFO ] Deduced a trap composed of 73 places in 175 ms of which 0 ms to minimize.
[2021-05-14 22:03:48] [INFO ] Deduced a trap composed of 61 places in 164 ms of which 0 ms to minimize.
[2021-05-14 22:03:48] [INFO ] Deduced a trap composed of 48 places in 217 ms of which 1 ms to minimize.
[2021-05-14 22:03:48] [INFO ] Trap strengthening (SAT) tested/added 82/81 trap constraints in 21345 ms
[2021-05-14 22:03:48] [INFO ] Computed and/alt/rep : 1365/4565/1365 causal constraints (skipped 112 transitions) in 108 ms.
[2021-05-14 22:04:08] [INFO ] Added : 1055 causal constraints over 211 iterations in 20134 ms.(timeout) Result :sat
Minimization took 667 ms.
[2021-05-14 22:04:09] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2021-05-14 22:04:09] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:04:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:04:10] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2021-05-14 22:04:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:04:10] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2021-05-14 22:04:10] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:04:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:04:10] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2021-05-14 22:04:10] [INFO ] [Nat]Added 546 Read/Feed constraints in 67 ms returned sat
[2021-05-14 22:04:10] [INFO ] Deduced a trap composed of 28 places in 240 ms of which 1 ms to minimize.
[2021-05-14 22:04:11] [INFO ] Deduced a trap composed of 49 places in 244 ms of which 0 ms to minimize.
[2021-05-14 22:04:11] [INFO ] Deduced a trap composed of 40 places in 241 ms of which 0 ms to minimize.
[2021-05-14 22:04:11] [INFO ] Deduced a trap composed of 40 places in 266 ms of which 1 ms to minimize.
[2021-05-14 22:04:11] [INFO ] Deduced a trap composed of 49 places in 244 ms of which 1 ms to minimize.
[2021-05-14 22:04:12] [INFO ] Deduced a trap composed of 49 places in 246 ms of which 0 ms to minimize.
[2021-05-14 22:04:12] [INFO ] Deduced a trap composed of 49 places in 251 ms of which 0 ms to minimize.
[2021-05-14 22:04:12] [INFO ] Deduced a trap composed of 49 places in 243 ms of which 0 ms to minimize.
[2021-05-14 22:04:13] [INFO ] Deduced a trap composed of 49 places in 226 ms of which 1 ms to minimize.
[2021-05-14 22:04:13] [INFO ] Deduced a trap composed of 49 places in 223 ms of which 1 ms to minimize.
[2021-05-14 22:04:13] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 1 ms to minimize.
[2021-05-14 22:04:13] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 1 ms to minimize.
[2021-05-14 22:04:14] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 0 ms to minimize.
[2021-05-14 22:04:14] [INFO ] Deduced a trap composed of 15 places in 232 ms of which 1 ms to minimize.
[2021-05-14 22:04:14] [INFO ] Deduced a trap composed of 29 places in 220 ms of which 1 ms to minimize.
[2021-05-14 22:04:14] [INFO ] Deduced a trap composed of 26 places in 233 ms of which 1 ms to minimize.
[2021-05-14 22:04:15] [INFO ] Deduced a trap composed of 27 places in 231 ms of which 0 ms to minimize.
[2021-05-14 22:04:15] [INFO ] Deduced a trap composed of 27 places in 226 ms of which 0 ms to minimize.
[2021-05-14 22:04:15] [INFO ] Deduced a trap composed of 22 places in 246 ms of which 1 ms to minimize.
[2021-05-14 22:04:16] [INFO ] Deduced a trap composed of 22 places in 248 ms of which 1 ms to minimize.
[2021-05-14 22:04:16] [INFO ] Deduced a trap composed of 12 places in 308 ms of which 0 ms to minimize.
[2021-05-14 22:04:16] [INFO ] Deduced a trap composed of 38 places in 313 ms of which 0 ms to minimize.
[2021-05-14 22:04:17] [INFO ] Deduced a trap composed of 38 places in 317 ms of which 1 ms to minimize.
[2021-05-14 22:04:17] [INFO ] Deduced a trap composed of 83 places in 308 ms of which 0 ms to minimize.
[2021-05-14 22:04:17] [INFO ] Deduced a trap composed of 29 places in 303 ms of which 1 ms to minimize.
[2021-05-14 22:04:18] [INFO ] Deduced a trap composed of 29 places in 298 ms of which 0 ms to minimize.
[2021-05-14 22:04:18] [INFO ] Deduced a trap composed of 29 places in 301 ms of which 0 ms to minimize.
[2021-05-14 22:04:18] [INFO ] Deduced a trap composed of 29 places in 272 ms of which 1 ms to minimize.
[2021-05-14 22:04:19] [INFO ] Deduced a trap composed of 37 places in 274 ms of which 0 ms to minimize.
[2021-05-14 22:04:19] [INFO ] Deduced a trap composed of 29 places in 273 ms of which 1 ms to minimize.
[2021-05-14 22:04:19] [INFO ] Deduced a trap composed of 13 places in 272 ms of which 0 ms to minimize.
[2021-05-14 22:04:20] [INFO ] Deduced a trap composed of 11 places in 266 ms of which 1 ms to minimize.
[2021-05-14 22:04:20] [INFO ] Deduced a trap composed of 26 places in 275 ms of which 1 ms to minimize.
[2021-05-14 22:04:20] [INFO ] Deduced a trap composed of 17 places in 274 ms of which 1 ms to minimize.
[2021-05-14 22:04:21] [INFO ] Deduced a trap composed of 25 places in 256 ms of which 0 ms to minimize.
[2021-05-14 22:04:21] [INFO ] Deduced a trap composed of 24 places in 266 ms of which 1 ms to minimize.
[2021-05-14 22:04:21] [INFO ] Deduced a trap composed of 18 places in 252 ms of which 0 ms to minimize.
[2021-05-14 22:04:22] [INFO ] Deduced a trap composed of 21 places in 264 ms of which 1 ms to minimize.
[2021-05-14 22:04:22] [INFO ] Deduced a trap composed of 25 places in 253 ms of which 0 ms to minimize.
[2021-05-14 22:04:22] [INFO ] Deduced a trap composed of 72 places in 269 ms of which 1 ms to minimize.
[2021-05-14 22:04:22] [INFO ] Deduced a trap composed of 72 places in 285 ms of which 0 ms to minimize.
[2021-05-14 22:04:23] [INFO ] Deduced a trap composed of 72 places in 283 ms of which 1 ms to minimize.
[2021-05-14 22:04:23] [INFO ] Deduced a trap composed of 11 places in 270 ms of which 0 ms to minimize.
[2021-05-14 22:04:23] [INFO ] Deduced a trap composed of 37 places in 267 ms of which 1 ms to minimize.
[2021-05-14 22:04:24] [INFO ] Deduced a trap composed of 57 places in 252 ms of which 1 ms to minimize.
[2021-05-14 22:04:24] [INFO ] Deduced a trap composed of 37 places in 296 ms of which 1 ms to minimize.
[2021-05-14 22:04:24] [INFO ] Deduced a trap composed of 48 places in 269 ms of which 1 ms to minimize.
[2021-05-14 22:04:25] [INFO ] Deduced a trap composed of 37 places in 271 ms of which 0 ms to minimize.
[2021-05-14 22:04:25] [INFO ] Deduced a trap composed of 25 places in 257 ms of which 1 ms to minimize.
[2021-05-14 22:04:25] [INFO ] Deduced a trap composed of 21 places in 273 ms of which 1 ms to minimize.
[2021-05-14 22:04:26] [INFO ] Deduced a trap composed of 26 places in 272 ms of which 0 ms to minimize.
[2021-05-14 22:04:26] [INFO ] Deduced a trap composed of 59 places in 267 ms of which 0 ms to minimize.
[2021-05-14 22:04:26] [INFO ] Deduced a trap composed of 59 places in 261 ms of which 1 ms to minimize.
[2021-05-14 22:04:27] [INFO ] Deduced a trap composed of 59 places in 272 ms of which 1 ms to minimize.
[2021-05-14 22:04:27] [INFO ] Deduced a trap composed of 79 places in 260 ms of which 0 ms to minimize.
[2021-05-14 22:04:27] [INFO ] Deduced a trap composed of 50 places in 269 ms of which 1 ms to minimize.
[2021-05-14 22:04:28] [INFO ] Deduced a trap composed of 49 places in 270 ms of which 1 ms to minimize.
[2021-05-14 22:04:28] [INFO ] Deduced a trap composed of 25 places in 265 ms of which 0 ms to minimize.
[2021-05-14 22:04:28] [INFO ] Deduced a trap composed of 25 places in 268 ms of which 1 ms to minimize.
[2021-05-14 22:04:28] [INFO ] Deduced a trap composed of 49 places in 250 ms of which 1 ms to minimize.
[2021-05-14 22:04:29] [INFO ] Deduced a trap composed of 37 places in 265 ms of which 0 ms to minimize.
[2021-05-14 22:04:29] [INFO ] Deduced a trap composed of 86 places in 290 ms of which 0 ms to minimize.
[2021-05-14 22:04:29] [INFO ] Deduced a trap composed of 50 places in 251 ms of which 1 ms to minimize.
[2021-05-14 22:04:30] [INFO ] Deduced a trap composed of 38 places in 250 ms of which 1 ms to minimize.
[2021-05-14 22:04:30] [INFO ] Deduced a trap composed of 67 places in 262 ms of which 1 ms to minimize.
[2021-05-14 22:04:30] [INFO ] Deduced a trap composed of 60 places in 281 ms of which 1 ms to minimize.
[2021-05-14 22:04:31] [INFO ] Deduced a trap composed of 58 places in 274 ms of which 0 ms to minimize.
[2021-05-14 22:04:31] [INFO ] Deduced a trap composed of 47 places in 281 ms of which 0 ms to minimize.
[2021-05-14 22:04:31] [INFO ] Deduced a trap composed of 59 places in 277 ms of which 1 ms to minimize.
[2021-05-14 22:04:32] [INFO ] Deduced a trap composed of 132 places in 275 ms of which 0 ms to minimize.
[2021-05-14 22:04:32] [INFO ] Deduced a trap composed of 35 places in 295 ms of which 1 ms to minimize.
[2021-05-14 22:04:32] [INFO ] Deduced a trap composed of 88 places in 218 ms of which 0 ms to minimize.
[2021-05-14 22:04:32] [INFO ] Deduced a trap composed of 82 places in 204 ms of which 1 ms to minimize.
[2021-05-14 22:04:33] [INFO ] Deduced a trap composed of 48 places in 215 ms of which 0 ms to minimize.
[2021-05-14 22:04:33] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 0 ms to minimize.
[2021-05-14 22:04:33] [INFO ] Deduced a trap composed of 49 places in 215 ms of which 1 ms to minimize.
[2021-05-14 22:04:33] [INFO ] Deduced a trap composed of 69 places in 178 ms of which 1 ms to minimize.
[2021-05-14 22:04:34] [INFO ] Deduced a trap composed of 90 places in 186 ms of which 1 ms to minimize.
[2021-05-14 22:04:34] [INFO ] Deduced a trap composed of 68 places in 190 ms of which 1 ms to minimize.
[2021-05-14 22:04:34] [INFO ] Deduced a trap composed of 69 places in 137 ms of which 0 ms to minimize.
[2021-05-14 22:04:34] [INFO ] Deduced a trap composed of 72 places in 138 ms of which 1 ms to minimize.
[2021-05-14 22:04:35] [INFO ] Deduced a trap composed of 69 places in 159 ms of which 0 ms to minimize.
[2021-05-14 22:04:35] [INFO ] Deduced a trap composed of 72 places in 146 ms of which 0 ms to minimize.
[2021-05-14 22:04:35] [INFO ] Deduced a trap composed of 72 places in 151 ms of which 1 ms to minimize.
[2021-05-14 22:04:35] [INFO ] Deduced a trap composed of 72 places in 123 ms of which 0 ms to minimize.
[2021-05-14 22:04:35] [INFO ] Trap strengthening (SAT) tested/added 86/85 trap constraints in 25084 ms
[2021-05-14 22:04:35] [INFO ] Computed and/alt/rep : 1365/4565/1365 causal constraints (skipped 112 transitions) in 91 ms.
[2021-05-14 22:04:55] [INFO ] Deduced a trap composed of 2 places in 378 ms of which 1 ms to minimize.
[2021-05-14 22:04:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-14 22:04:55] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2021-05-14 22:04:55] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:04:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:04:55] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2021-05-14 22:04:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:04:56] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2021-05-14 22:04:56] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:04:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:04:56] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2021-05-14 22:04:56] [INFO ] [Nat]Added 546 Read/Feed constraints in 63 ms returned sat
[2021-05-14 22:04:56] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 0 ms to minimize.
[2021-05-14 22:04:56] [INFO ] Deduced a trap composed of 22 places in 231 ms of which 1 ms to minimize.
[2021-05-14 22:04:57] [INFO ] Deduced a trap composed of 48 places in 232 ms of which 1 ms to minimize.
[2021-05-14 22:04:57] [INFO ] Deduced a trap composed of 47 places in 233 ms of which 1 ms to minimize.
[2021-05-14 22:04:57] [INFO ] Deduced a trap composed of 33 places in 243 ms of which 21 ms to minimize.
[2021-05-14 22:04:58] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 1 ms to minimize.
[2021-05-14 22:04:58] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 0 ms to minimize.
[2021-05-14 22:04:58] [INFO ] Deduced a trap composed of 60 places in 243 ms of which 0 ms to minimize.
[2021-05-14 22:04:58] [INFO ] Deduced a trap composed of 53 places in 244 ms of which 0 ms to minimize.
[2021-05-14 22:04:59] [INFO ] Deduced a trap composed of 14 places in 238 ms of which 1 ms to minimize.
[2021-05-14 22:04:59] [INFO ] Deduced a trap composed of 35 places in 240 ms of which 1 ms to minimize.
[2021-05-14 22:04:59] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 1 ms to minimize.
[2021-05-14 22:04:59] [INFO ] Deduced a trap composed of 25 places in 239 ms of which 0 ms to minimize.
[2021-05-14 22:05:00] [INFO ] Deduced a trap composed of 56 places in 236 ms of which 1 ms to minimize.
[2021-05-14 22:05:00] [INFO ] Deduced a trap composed of 52 places in 217 ms of which 1 ms to minimize.
[2021-05-14 22:05:00] [INFO ] Deduced a trap composed of 11 places in 227 ms of which 1 ms to minimize.
[2021-05-14 22:05:01] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 1 ms to minimize.
[2021-05-14 22:05:01] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 0 ms to minimize.
[2021-05-14 22:05:01] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 1 ms to minimize.
[2021-05-14 22:05:01] [INFO ] Deduced a trap composed of 57 places in 224 ms of which 1 ms to minimize.
[2021-05-14 22:05:02] [INFO ] Deduced a trap composed of 57 places in 255 ms of which 1 ms to minimize.
[2021-05-14 22:05:02] [INFO ] Deduced a trap composed of 68 places in 268 ms of which 1 ms to minimize.
[2021-05-14 22:05:02] [INFO ] Deduced a trap composed of 22 places in 244 ms of which 1 ms to minimize.
[2021-05-14 22:05:03] [INFO ] Deduced a trap composed of 14 places in 248 ms of which 0 ms to minimize.
[2021-05-14 22:05:03] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 1 ms to minimize.
[2021-05-14 22:05:03] [INFO ] Deduced a trap composed of 11 places in 235 ms of which 0 ms to minimize.
[2021-05-14 22:05:03] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 0 ms to minimize.
[2021-05-14 22:05:04] [INFO ] Deduced a trap composed of 71 places in 233 ms of which 1 ms to minimize.
[2021-05-14 22:05:04] [INFO ] Deduced a trap composed of 59 places in 214 ms of which 0 ms to minimize.
[2021-05-14 22:05:04] [INFO ] Deduced a trap composed of 27 places in 237 ms of which 1 ms to minimize.
[2021-05-14 22:05:05] [INFO ] Deduced a trap composed of 26 places in 222 ms of which 1 ms to minimize.
[2021-05-14 22:05:05] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 0 ms to minimize.
[2021-05-14 22:05:05] [INFO ] Deduced a trap composed of 61 places in 213 ms of which 1 ms to minimize.
[2021-05-14 22:05:05] [INFO ] Deduced a trap composed of 60 places in 207 ms of which 1 ms to minimize.
[2021-05-14 22:05:06] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 1 ms to minimize.
[2021-05-14 22:05:06] [INFO ] Deduced a trap composed of 25 places in 227 ms of which 1 ms to minimize.
[2021-05-14 22:05:06] [INFO ] Deduced a trap composed of 24 places in 221 ms of which 1 ms to minimize.
[2021-05-14 22:05:06] [INFO ] Deduced a trap composed of 68 places in 190 ms of which 0 ms to minimize.
[2021-05-14 22:05:07] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 0 ms to minimize.
[2021-05-14 22:05:07] [INFO ] Deduced a trap composed of 36 places in 202 ms of which 0 ms to minimize.
[2021-05-14 22:05:07] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 1 ms to minimize.
[2021-05-14 22:05:07] [INFO ] Deduced a trap composed of 40 places in 190 ms of which 0 ms to minimize.
[2021-05-14 22:05:08] [INFO ] Deduced a trap composed of 37 places in 204 ms of which 1 ms to minimize.
[2021-05-14 22:05:08] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 0 ms to minimize.
[2021-05-14 22:05:08] [INFO ] Deduced a trap composed of 33 places in 211 ms of which 0 ms to minimize.
[2021-05-14 22:05:08] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 0 ms to minimize.
[2021-05-14 22:05:09] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 0 ms to minimize.
[2021-05-14 22:05:09] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 1 ms to minimize.
[2021-05-14 22:05:09] [INFO ] Deduced a trap composed of 36 places in 197 ms of which 0 ms to minimize.
[2021-05-14 22:05:09] [INFO ] Deduced a trap composed of 33 places in 202 ms of which 1 ms to minimize.
[2021-05-14 22:05:09] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 1 ms to minimize.
[2021-05-14 22:05:10] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 1 ms to minimize.
[2021-05-14 22:05:10] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 1 ms to minimize.
[2021-05-14 22:05:10] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 1 ms to minimize.
[2021-05-14 22:05:10] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 1 ms to minimize.
[2021-05-14 22:05:11] [INFO ] Deduced a trap composed of 59 places in 153 ms of which 1 ms to minimize.
[2021-05-14 22:05:11] [INFO ] Deduced a trap composed of 56 places in 153 ms of which 0 ms to minimize.
[2021-05-14 22:05:11] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 1 ms to minimize.
[2021-05-14 22:05:11] [INFO ] Deduced a trap composed of 70 places in 138 ms of which 0 ms to minimize.
[2021-05-14 22:05:11] [INFO ] Deduced a trap composed of 70 places in 132 ms of which 1 ms to minimize.
[2021-05-14 22:05:12] [INFO ] Deduced a trap composed of 70 places in 142 ms of which 0 ms to minimize.
[2021-05-14 22:05:12] [INFO ] Deduced a trap composed of 66 places in 141 ms of which 0 ms to minimize.
[2021-05-14 22:05:12] [INFO ] Deduced a trap composed of 68 places in 141 ms of which 0 ms to minimize.
[2021-05-14 22:05:12] [INFO ] Deduced a trap composed of 36 places in 248 ms of which 1 ms to minimize.
[2021-05-14 22:05:13] [INFO ] Deduced a trap composed of 46 places in 253 ms of which 1 ms to minimize.
[2021-05-14 22:05:13] [INFO ] Deduced a trap composed of 78 places in 258 ms of which 1 ms to minimize.
[2021-05-14 22:05:13] [INFO ] Deduced a trap composed of 51 places in 249 ms of which 1 ms to minimize.
[2021-05-14 22:05:13] [INFO ] Deduced a trap composed of 74 places in 259 ms of which 1 ms to minimize.
[2021-05-14 22:05:14] [INFO ] Deduced a trap composed of 60 places in 243 ms of which 0 ms to minimize.
[2021-05-14 22:05:14] [INFO ] Deduced a trap composed of 55 places in 236 ms of which 1 ms to minimize.
[2021-05-14 22:05:14] [INFO ] Deduced a trap composed of 45 places in 247 ms of which 1 ms to minimize.
[2021-05-14 22:05:15] [INFO ] Deduced a trap composed of 55 places in 248 ms of which 0 ms to minimize.
[2021-05-14 22:05:15] [INFO ] Deduced a trap composed of 53 places in 252 ms of which 1 ms to minimize.
[2021-05-14 22:05:15] [INFO ] Deduced a trap composed of 53 places in 249 ms of which 1 ms to minimize.
[2021-05-14 22:05:16] [INFO ] Deduced a trap composed of 79 places in 244 ms of which 1 ms to minimize.
[2021-05-14 22:05:16] [INFO ] Deduced a trap composed of 33 places in 250 ms of which 1 ms to minimize.
[2021-05-14 22:05:16] [INFO ] Deduced a trap composed of 38 places in 267 ms of which 1 ms to minimize.
[2021-05-14 22:05:16] [INFO ] Deduced a trap composed of 38 places in 268 ms of which 1 ms to minimize.
[2021-05-14 22:05:17] [INFO ] Deduced a trap composed of 38 places in 250 ms of which 0 ms to minimize.
[2021-05-14 22:05:17] [INFO ] Deduced a trap composed of 77 places in 261 ms of which 1 ms to minimize.
[2021-05-14 22:05:17] [INFO ] Deduced a trap composed of 22 places in 280 ms of which 1 ms to minimize.
[2021-05-14 22:05:18] [INFO ] Deduced a trap composed of 98 places in 247 ms of which 0 ms to minimize.
[2021-05-14 22:05:18] [INFO ] Deduced a trap composed of 98 places in 233 ms of which 1 ms to minimize.
[2021-05-14 22:05:18] [INFO ] Deduced a trap composed of 98 places in 242 ms of which 1 ms to minimize.
[2021-05-14 22:05:19] [INFO ] Deduced a trap composed of 98 places in 222 ms of which 1 ms to minimize.
[2021-05-14 22:05:19] [INFO ] Deduced a trap composed of 98 places in 232 ms of which 1 ms to minimize.
[2021-05-14 22:05:19] [INFO ] Deduced a trap composed of 45 places in 233 ms of which 1 ms to minimize.
[2021-05-14 22:05:19] [INFO ] Deduced a trap composed of 26 places in 234 ms of which 0 ms to minimize.
[2021-05-14 22:05:20] [INFO ] Deduced a trap composed of 61 places in 202 ms of which 1 ms to minimize.
[2021-05-14 22:05:20] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 0 ms to minimize.
[2021-05-14 22:05:20] [INFO ] Deduced a trap composed of 55 places in 201 ms of which 1 ms to minimize.
[2021-05-14 22:05:20] [INFO ] Deduced a trap composed of 73 places in 200 ms of which 0 ms to minimize.
[2021-05-14 22:05:21] [INFO ] Deduced a trap composed of 84 places in 195 ms of which 1 ms to minimize.
[2021-05-14 22:05:21] [INFO ] Deduced a trap composed of 55 places in 199 ms of which 1 ms to minimize.
[2021-05-14 22:05:21] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 0 ms to minimize.
[2021-05-14 22:05:21] [INFO ] Deduced a trap composed of 75 places in 139 ms of which 1 ms to minimize.
[2021-05-14 22:05:21] [INFO ] Trap strengthening (SAT) tested/added 97/96 trap constraints in 25418 ms
[2021-05-14 22:05:21] [INFO ] Computed and/alt/rep : 1365/4565/1365 causal constraints (skipped 112 transitions) in 76 ms.
[2021-05-14 22:05:40] [INFO ] Added : 1020 causal constraints over 204 iterations in 19136 ms. Result :unknown
[2021-05-14 22:05:41] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2021-05-14 22:05:41] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:05:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:05:41] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2021-05-14 22:05:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:05:41] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2021-05-14 22:05:41] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:05:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:05:41] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2021-05-14 22:05:41] [INFO ] [Nat]Added 546 Read/Feed constraints in 66 ms returned sat
[2021-05-14 22:05:42] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 1 ms to minimize.
[2021-05-14 22:05:42] [INFO ] Deduced a trap composed of 27 places in 225 ms of which 1 ms to minimize.
[2021-05-14 22:05:42] [INFO ] Deduced a trap composed of 26 places in 234 ms of which 0 ms to minimize.
[2021-05-14 22:05:42] [INFO ] Deduced a trap composed of 26 places in 233 ms of which 0 ms to minimize.
[2021-05-14 22:05:43] [INFO ] Deduced a trap composed of 38 places in 241 ms of which 1 ms to minimize.
[2021-05-14 22:05:43] [INFO ] Deduced a trap composed of 27 places in 243 ms of which 1 ms to minimize.
[2021-05-14 22:05:43] [INFO ] Deduced a trap composed of 27 places in 244 ms of which 0 ms to minimize.
[2021-05-14 22:05:44] [INFO ] Deduced a trap composed of 27 places in 238 ms of which 0 ms to minimize.
[2021-05-14 22:05:44] [INFO ] Deduced a trap composed of 49 places in 231 ms of which 0 ms to minimize.
[2021-05-14 22:05:44] [INFO ] Deduced a trap composed of 50 places in 237 ms of which 0 ms to minimize.
[2021-05-14 22:05:44] [INFO ] Deduced a trap composed of 49 places in 232 ms of which 0 ms to minimize.
[2021-05-14 22:05:45] [INFO ] Deduced a trap composed of 49 places in 227 ms of which 1 ms to minimize.
[2021-05-14 22:05:45] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 1 ms to minimize.
[2021-05-14 22:05:45] [INFO ] Deduced a trap composed of 47 places in 214 ms of which 1 ms to minimize.
[2021-05-14 22:05:45] [INFO ] Deduced a trap composed of 48 places in 228 ms of which 1 ms to minimize.
[2021-05-14 22:05:46] [INFO ] Deduced a trap composed of 53 places in 246 ms of which 1 ms to minimize.
[2021-05-14 22:05:46] [INFO ] Deduced a trap composed of 81 places in 233 ms of which 1 ms to minimize.
[2021-05-14 22:05:46] [INFO ] Deduced a trap composed of 50 places in 230 ms of which 1 ms to minimize.
[2021-05-14 22:05:47] [INFO ] Deduced a trap composed of 81 places in 258 ms of which 0 ms to minimize.
[2021-05-14 22:05:47] [INFO ] Deduced a trap composed of 65 places in 237 ms of which 1 ms to minimize.
[2021-05-14 22:05:47] [INFO ] Deduced a trap composed of 50 places in 253 ms of which 1 ms to minimize.
[2021-05-14 22:05:47] [INFO ] Deduced a trap composed of 25 places in 248 ms of which 1 ms to minimize.
[2021-05-14 22:05:48] [INFO ] Deduced a trap composed of 34 places in 214 ms of which 1 ms to minimize.
[2021-05-14 22:05:48] [INFO ] Deduced a trap composed of 52 places in 223 ms of which 0 ms to minimize.
[2021-05-14 22:05:48] [INFO ] Deduced a trap composed of 53 places in 227 ms of which 0 ms to minimize.
[2021-05-14 22:05:49] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 0 ms to minimize.
[2021-05-14 22:05:49] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 1 ms to minimize.
[2021-05-14 22:05:49] [INFO ] Deduced a trap composed of 47 places in 211 ms of which 0 ms to minimize.
[2021-05-14 22:05:49] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 1 ms to minimize.
[2021-05-14 22:05:50] [INFO ] Deduced a trap composed of 47 places in 210 ms of which 0 ms to minimize.
[2021-05-14 22:05:50] [INFO ] Deduced a trap composed of 46 places in 213 ms of which 4 ms to minimize.
[2021-05-14 22:05:50] [INFO ] Deduced a trap composed of 92 places in 205 ms of which 0 ms to minimize.
[2021-05-14 22:05:50] [INFO ] Deduced a trap composed of 69 places in 206 ms of which 0 ms to minimize.
[2021-05-14 22:05:51] [INFO ] Deduced a trap composed of 96 places in 205 ms of which 0 ms to minimize.
[2021-05-14 22:05:51] [INFO ] Deduced a trap composed of 36 places in 191 ms of which 0 ms to minimize.
[2021-05-14 22:05:51] [INFO ] Deduced a trap composed of 69 places in 203 ms of which 1 ms to minimize.
[2021-05-14 22:05:51] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 1 ms to minimize.
[2021-05-14 22:05:52] [INFO ] Deduced a trap composed of 69 places in 193 ms of which 1 ms to minimize.
[2021-05-14 22:05:52] [INFO ] Deduced a trap composed of 73 places in 206 ms of which 0 ms to minimize.
[2021-05-14 22:05:52] [INFO ] Deduced a trap composed of 73 places in 191 ms of which 0 ms to minimize.
[2021-05-14 22:05:52] [INFO ] Deduced a trap composed of 69 places in 205 ms of which 1 ms to minimize.
[2021-05-14 22:05:53] [INFO ] Deduced a trap composed of 114 places in 195 ms of which 0 ms to minimize.
[2021-05-14 22:05:53] [INFO ] Deduced a trap composed of 116 places in 214 ms of which 0 ms to minimize.
[2021-05-14 22:05:53] [INFO ] Deduced a trap composed of 84 places in 208 ms of which 0 ms to minimize.
[2021-05-14 22:05:53] [INFO ] Deduced a trap composed of 85 places in 194 ms of which 0 ms to minimize.
[2021-05-14 22:05:54] [INFO ] Deduced a trap composed of 38 places in 195 ms of which 1 ms to minimize.
[2021-05-14 22:05:54] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 0 ms to minimize.
[2021-05-14 22:05:54] [INFO ] Deduced a trap composed of 36 places in 209 ms of which 1 ms to minimize.
[2021-05-14 22:05:54] [INFO ] Deduced a trap composed of 83 places in 195 ms of which 1 ms to minimize.
[2021-05-14 22:05:55] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 1 ms to minimize.
[2021-05-14 22:05:55] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 1 ms to minimize.
[2021-05-14 22:05:55] [INFO ] Deduced a trap composed of 77 places in 197 ms of which 0 ms to minimize.
[2021-05-14 22:05:55] [INFO ] Deduced a trap composed of 77 places in 195 ms of which 0 ms to minimize.
[2021-05-14 22:05:56] [INFO ] Deduced a trap composed of 58 places in 211 ms of which 0 ms to minimize.
[2021-05-14 22:05:56] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 1 ms to minimize.
[2021-05-14 22:05:56] [INFO ] Deduced a trap composed of 81 places in 215 ms of which 0 ms to minimize.
[2021-05-14 22:05:56] [INFO ] Deduced a trap composed of 58 places in 203 ms of which 0 ms to minimize.
[2021-05-14 22:05:57] [INFO ] Deduced a trap composed of 78 places in 204 ms of which 1 ms to minimize.
[2021-05-14 22:05:57] [INFO ] Deduced a trap composed of 69 places in 210 ms of which 1 ms to minimize.
[2021-05-14 22:05:57] [INFO ] Deduced a trap composed of 40 places in 213 ms of which 1 ms to minimize.
[2021-05-14 22:05:57] [INFO ] Deduced a trap composed of 72 places in 154 ms of which 1 ms to minimize.
[2021-05-14 22:05:57] [INFO ] Deduced a trap composed of 72 places in 154 ms of which 0 ms to minimize.
[2021-05-14 22:05:58] [INFO ] Deduced a trap composed of 58 places in 164 ms of which 1 ms to minimize.
[2021-05-14 22:05:58] [INFO ] Deduced a trap composed of 76 places in 160 ms of which 0 ms to minimize.
[2021-05-14 22:05:58] [INFO ] Deduced a trap composed of 69 places in 163 ms of which 1 ms to minimize.
[2021-05-14 22:05:58] [INFO ] Deduced a trap composed of 72 places in 167 ms of which 1 ms to minimize.
[2021-05-14 22:05:59] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 1 ms to minimize.
[2021-05-14 22:05:59] [INFO ] Deduced a trap composed of 77 places in 221 ms of which 0 ms to minimize.
[2021-05-14 22:05:59] [INFO ] Deduced a trap composed of 16 places in 227 ms of which 0 ms to minimize.
[2021-05-14 22:05:59] [INFO ] Deduced a trap composed of 15 places in 233 ms of which 0 ms to minimize.
[2021-05-14 22:06:00] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 1 ms to minimize.
[2021-05-14 22:06:00] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 1 ms to minimize.
[2021-05-14 22:06:00] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 1 ms to minimize.
[2021-05-14 22:06:01] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 0 ms to minimize.
[2021-05-14 22:06:01] [INFO ] Deduced a trap composed of 66 places in 185 ms of which 0 ms to minimize.
[2021-05-14 22:06:01] [INFO ] Deduced a trap composed of 67 places in 180 ms of which 0 ms to minimize.
[2021-05-14 22:06:01] [INFO ] Deduced a trap composed of 64 places in 196 ms of which 1 ms to minimize.
[2021-05-14 22:06:01] [INFO ] Deduced a trap composed of 54 places in 209 ms of which 0 ms to minimize.
[2021-05-14 22:06:02] [INFO ] Deduced a trap composed of 54 places in 214 ms of which 1 ms to minimize.
[2021-05-14 22:06:02] [INFO ] Deduced a trap composed of 68 places in 198 ms of which 1 ms to minimize.
[2021-05-14 22:06:02] [INFO ] Deduced a trap composed of 66 places in 210 ms of which 0 ms to minimize.
[2021-05-14 22:06:03] [INFO ] Deduced a trap composed of 84 places in 248 ms of which 0 ms to minimize.
[2021-05-14 22:06:03] [INFO ] Deduced a trap composed of 22 places in 252 ms of which 0 ms to minimize.
[2021-05-14 22:06:03] [INFO ] Deduced a trap composed of 16 places in 237 ms of which 1 ms to minimize.
[2021-05-14 22:06:03] [INFO ] Deduced a trap composed of 82 places in 222 ms of which 1 ms to minimize.
[2021-05-14 22:06:04] [INFO ] Deduced a trap composed of 61 places in 224 ms of which 1 ms to minimize.
[2021-05-14 22:06:04] [INFO ] Deduced a trap composed of 57 places in 222 ms of which 1 ms to minimize.
[2021-05-14 22:06:04] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 1 ms to minimize.
[2021-05-14 22:06:04] [INFO ] Trap strengthening (SAT) tested/added 89/88 trap constraints in 22975 ms
[2021-05-14 22:06:04] [INFO ] Computed and/alt/rep : 1365/4565/1365 causal constraints (skipped 112 transitions) in 79 ms.
[2021-05-14 22:06:25] [INFO ] Deduced a trap composed of 21 places in 254 ms of which 1 ms to minimize.
[2021-05-14 22:06:25] [INFO ] Deduced a trap composed of 72 places in 131 ms of which 0 ms to minimize.
[2021-05-14 22:06:25] [INFO ] Deduced a trap composed of 61 places in 144 ms of which 0 ms to minimize.
[2021-05-14 22:06:25] [INFO ] Deduced a trap composed of 61 places in 132 ms of which 1 ms to minimize.
[2021-05-14 22:06:25] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 0 ms to minimize.
[2021-05-14 22:06:26] [INFO ] Deduced a trap composed of 72 places in 144 ms of which 0 ms to minimize.
[2021-05-14 22:06:26] [INFO ] Deduced a trap composed of 73 places in 138 ms of which 0 ms to minimize.
[2021-05-14 22:06:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [7, 1, 1, 1, 1, 1, 1, 1] Max seen :[7, 0, 0, 0, 0, 0, 0, 0]
FORMULA Peterson-PT-7-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 362000 steps, including 1000 resets, run finished after 1164 ms. (steps per millisecond=310 ) properties (out of 7) seen :1 could not realise parikh vector
FORMULA Peterson-PT-7-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 1053900 steps, including 1000 resets, run finished after 3117 ms. (steps per millisecond=338 ) properties (out of 6) seen :2 could not realise parikh vector
FORMULA Peterson-PT-7-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-7-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 744600 steps, including 1000 resets, run finished after 2484 ms. (steps per millisecond=299 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 367000 steps, including 1000 resets, run finished after 1159 ms. (steps per millisecond=316 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 4 out of 717 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 717/717 places, 1821/1821 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 717 transition count 1818
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 714 transition count 1818
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 6 place count 714 transition count 1758
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 126 place count 654 transition count 1758
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 238 place count 598 transition count 1702
Applied a total of 238 rules in 235 ms. Remains 598 /717 variables (removed 119) and now considering 1702/1821 (removed 119) transitions.
Finished structural reductions, in 1 iterations. Remains : 598/717 places, 1702/1821 transitions.
Normalized transition count is 1366 out of 1702 initially.
// Phase 1: matrix 1366 rows 598 cols
[2021-05-14 22:06:34] [INFO ] Computed 31 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3301 ms. (steps per millisecond=302 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 781 ms. (steps per millisecond=1280 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 700 ms. (steps per millisecond=1428 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 672 ms. (steps per millisecond=1488 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 666 ms. (steps per millisecond=1501 ) properties (out of 4) seen :0
[2021-05-14 22:06:40] [INFO ] Flow matrix only has 1366 transitions (discarded 336 similar events)
// Phase 1: matrix 1366 rows 598 cols
[2021-05-14 22:06:40] [INFO ] Computed 31 place invariants in 4 ms
[2021-05-14 22:06:41] [INFO ] [Real]Absence check using 23 positive place invariants in 119 ms returned sat
[2021-05-14 22:06:41] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 40 ms returned sat
[2021-05-14 22:06:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:06:41] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2021-05-14 22:06:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:06:41] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2021-05-14 22:06:41] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:06:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:06:41] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2021-05-14 22:06:41] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 22:06:41] [INFO ] [Nat]Added 546 Read/Feed constraints in 64 ms returned sat
[2021-05-14 22:06:42] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 1 ms to minimize.
[2021-05-14 22:06:42] [INFO ] Deduced a trap composed of 16 places in 203 ms of which 1 ms to minimize.
[2021-05-14 22:06:42] [INFO ] Deduced a trap composed of 45 places in 205 ms of which 1 ms to minimize.
[2021-05-14 22:06:42] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 0 ms to minimize.
[2021-05-14 22:06:43] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 0 ms to minimize.
[2021-05-14 22:06:43] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 0 ms to minimize.
[2021-05-14 22:06:43] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 0 ms to minimize.
[2021-05-14 22:06:43] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 1 ms to minimize.
[2021-05-14 22:06:44] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 1 ms to minimize.
[2021-05-14 22:06:44] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 0 ms to minimize.
[2021-05-14 22:06:44] [INFO ] Deduced a trap composed of 22 places in 191 ms of which 0 ms to minimize.
[2021-05-14 22:06:44] [INFO ] Deduced a trap composed of 42 places in 184 ms of which 1 ms to minimize.
[2021-05-14 22:06:44] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 0 ms to minimize.
[2021-05-14 22:06:45] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 0 ms to minimize.
[2021-05-14 22:06:45] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 1 ms to minimize.
[2021-05-14 22:06:45] [INFO ] Deduced a trap composed of 77 places in 189 ms of which 1 ms to minimize.
[2021-05-14 22:06:45] [INFO ] Deduced a trap composed of 61 places in 192 ms of which 1 ms to minimize.
[2021-05-14 22:06:46] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 0 ms to minimize.
[2021-05-14 22:06:46] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 1 ms to minimize.
[2021-05-14 22:06:46] [INFO ] Deduced a trap composed of 72 places in 189 ms of which 1 ms to minimize.
[2021-05-14 22:06:46] [INFO ] Deduced a trap composed of 87 places in 192 ms of which 0 ms to minimize.
[2021-05-14 22:06:46] [INFO ] Deduced a trap composed of 42 places in 192 ms of which 1 ms to minimize.
[2021-05-14 22:06:47] [INFO ] Deduced a trap composed of 52 places in 191 ms of which 1 ms to minimize.
[2021-05-14 22:06:47] [INFO ] Deduced a trap composed of 72 places in 193 ms of which 1 ms to minimize.
[2021-05-14 22:06:47] [INFO ] Deduced a trap composed of 87 places in 210 ms of which 0 ms to minimize.
[2021-05-14 22:06:47] [INFO ] Deduced a trap composed of 60 places in 192 ms of which 1 ms to minimize.
[2021-05-14 22:06:48] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 0 ms to minimize.
[2021-05-14 22:06:48] [INFO ] Deduced a trap composed of 86 places in 195 ms of which 0 ms to minimize.
[2021-05-14 22:06:48] [INFO ] Deduced a trap composed of 54 places in 189 ms of which 0 ms to minimize.
[2021-05-14 22:06:48] [INFO ] Deduced a trap composed of 93 places in 179 ms of which 0 ms to minimize.
[2021-05-14 22:06:49] [INFO ] Deduced a trap composed of 51 places in 192 ms of which 1 ms to minimize.
[2021-05-14 22:06:49] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 0 ms to minimize.
[2021-05-14 22:06:49] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 0 ms to minimize.
[2021-05-14 22:06:49] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 1 ms to minimize.
[2021-05-14 22:06:49] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 0 ms to minimize.
[2021-05-14 22:06:50] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 1 ms to minimize.
[2021-05-14 22:06:50] [INFO ] Deduced a trap composed of 51 places in 165 ms of which 0 ms to minimize.
[2021-05-14 22:06:50] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 1 ms to minimize.
[2021-05-14 22:06:50] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 0 ms to minimize.
[2021-05-14 22:06:51] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 1 ms to minimize.
[2021-05-14 22:06:51] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 0 ms to minimize.
[2021-05-14 22:06:51] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 0 ms to minimize.
[2021-05-14 22:06:51] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 0 ms to minimize.
[2021-05-14 22:06:51] [INFO ] Deduced a trap composed of 62 places in 162 ms of which 1 ms to minimize.
[2021-05-14 22:06:52] [INFO ] Deduced a trap composed of 33 places in 171 ms of which 0 ms to minimize.
[2021-05-14 22:06:52] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 1 ms to minimize.
[2021-05-14 22:06:52] [INFO ] Deduced a trap composed of 108 places in 179 ms of which 1 ms to minimize.
[2021-05-14 22:06:52] [INFO ] Deduced a trap composed of 51 places in 171 ms of which 1 ms to minimize.
[2021-05-14 22:06:52] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 0 ms to minimize.
[2021-05-14 22:06:53] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 1 ms to minimize.
[2021-05-14 22:06:53] [INFO ] Deduced a trap composed of 62 places in 172 ms of which 1 ms to minimize.
[2021-05-14 22:06:53] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 1 ms to minimize.
[2021-05-14 22:06:53] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 0 ms to minimize.
[2021-05-14 22:06:53] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 0 ms to minimize.
[2021-05-14 22:06:54] [INFO ] Deduced a trap composed of 59 places in 145 ms of which 0 ms to minimize.
[2021-05-14 22:06:54] [INFO ] Deduced a trap composed of 51 places in 163 ms of which 16 ms to minimize.
[2021-05-14 22:06:54] [INFO ] Deduced a trap composed of 55 places in 148 ms of which 0 ms to minimize.
[2021-05-14 22:06:54] [INFO ] Deduced a trap composed of 59 places in 156 ms of which 0 ms to minimize.
[2021-05-14 22:06:54] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 0 ms to minimize.
[2021-05-14 22:06:55] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 0 ms to minimize.
[2021-05-14 22:06:55] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 1 ms to minimize.
[2021-05-14 22:06:55] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 1 ms to minimize.
[2021-05-14 22:06:55] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 0 ms to minimize.
[2021-05-14 22:06:56] [INFO ] Deduced a trap composed of 42 places in 187 ms of which 1 ms to minimize.
[2021-05-14 22:06:56] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 1 ms to minimize.
[2021-05-14 22:06:56] [INFO ] Deduced a trap composed of 61 places in 163 ms of which 1 ms to minimize.
[2021-05-14 22:06:56] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 1 ms to minimize.
[2021-05-14 22:06:56] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 1 ms to minimize.
[2021-05-14 22:06:57] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 1 ms to minimize.
[2021-05-14 22:06:57] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 1 ms to minimize.
[2021-05-14 22:06:57] [INFO ] Deduced a trap composed of 47 places in 155 ms of which 0 ms to minimize.
[2021-05-14 22:06:57] [INFO ] Trap strengthening (SAT) tested/added 72/71 trap constraints in 15726 ms
[2021-05-14 22:06:57] [INFO ] Computed and/alt/rep : 1246/4782/1246 causal constraints (skipped 112 transitions) in 74 ms.
[2021-05-14 22:07:07] [INFO ] Deduced a trap composed of 14 places in 222 ms of which 1 ms to minimize.
[2021-05-14 22:07:07] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 1 ms to minimize.
[2021-05-14 22:07:07] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 1 ms to minimize.
[2021-05-14 22:07:08] [INFO ] Deduced a trap composed of 98 places in 224 ms of which 1 ms to minimize.
[2021-05-14 22:07:08] [INFO ] Deduced a trap composed of 25 places in 217 ms of which 0 ms to minimize.
[2021-05-14 22:07:08] [INFO ] Deduced a trap composed of 57 places in 213 ms of which 0 ms to minimize.
[2021-05-14 22:07:08] [INFO ] Deduced a trap composed of 11 places in 217 ms of which 0 ms to minimize.
[2021-05-14 22:07:09] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 1 ms to minimize.
[2021-05-14 22:07:09] [INFO ] Deduced a trap composed of 57 places in 182 ms of which 1 ms to minimize.
[2021-05-14 22:07:09] [INFO ] Deduced a trap composed of 97 places in 182 ms of which 0 ms to minimize.
[2021-05-14 22:07:10] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 0 ms to minimize.
[2021-05-14 22:07:10] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 1 ms to minimize.
[2021-05-14 22:07:10] [INFO ] Deduced a trap composed of 98 places in 194 ms of which 0 ms to minimize.
[2021-05-14 22:07:10] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 1 ms to minimize.
[2021-05-14 22:07:11] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 1 ms to minimize.
[2021-05-14 22:07:11] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 0 ms to minimize.
[2021-05-14 22:07:11] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 0 ms to minimize.
[2021-05-14 22:07:12] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 0 ms to minimize.
[2021-05-14 22:07:12] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 1 ms to minimize.
[2021-05-14 22:07:12] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5692 ms
[2021-05-14 22:07:12] [INFO ] Added : 675 causal constraints over 135 iterations in 15051 ms. Result :sat
Minimization took 554 ms.
[2021-05-14 22:07:13] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2021-05-14 22:07:13] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:07:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:07:13] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2021-05-14 22:07:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:07:13] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2021-05-14 22:07:13] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:07:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:07:14] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2021-05-14 22:07:14] [INFO ] [Nat]Added 546 Read/Feed constraints in 64 ms returned sat
[2021-05-14 22:07:14] [INFO ] Deduced a trap composed of 39 places in 223 ms of which 1 ms to minimize.
[2021-05-14 22:07:14] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 1 ms to minimize.
[2021-05-14 22:07:14] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 0 ms to minimize.
[2021-05-14 22:07:15] [INFO ] Deduced a trap composed of 28 places in 219 ms of which 1 ms to minimize.
[2021-05-14 22:07:15] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 1 ms to minimize.
[2021-05-14 22:07:15] [INFO ] Deduced a trap composed of 48 places in 235 ms of which 1 ms to minimize.
[2021-05-14 22:07:15] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 0 ms to minimize.
[2021-05-14 22:07:16] [INFO ] Deduced a trap composed of 92 places in 221 ms of which 0 ms to minimize.
[2021-05-14 22:07:16] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 0 ms to minimize.
[2021-05-14 22:07:16] [INFO ] Deduced a trap composed of 24 places in 230 ms of which 1 ms to minimize.
[2021-05-14 22:07:16] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 1 ms to minimize.
[2021-05-14 22:07:17] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 1 ms to minimize.
[2021-05-14 22:07:17] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 1 ms to minimize.
[2021-05-14 22:07:17] [INFO ] Deduced a trap composed of 24 places in 217 ms of which 1 ms to minimize.
[2021-05-14 22:07:18] [INFO ] Deduced a trap composed of 25 places in 227 ms of which 1 ms to minimize.
[2021-05-14 22:07:18] [INFO ] Deduced a trap composed of 60 places in 221 ms of which 0 ms to minimize.
[2021-05-14 22:07:18] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 0 ms to minimize.
[2021-05-14 22:07:18] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 1 ms to minimize.
[2021-05-14 22:07:19] [INFO ] Deduced a trap composed of 24 places in 231 ms of which 1 ms to minimize.
[2021-05-14 22:07:19] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 1 ms to minimize.
[2021-05-14 22:07:19] [INFO ] Deduced a trap composed of 52 places in 222 ms of which 1 ms to minimize.
[2021-05-14 22:07:19] [INFO ] Deduced a trap composed of 52 places in 210 ms of which 1 ms to minimize.
[2021-05-14 22:07:20] [INFO ] Deduced a trap composed of 15 places in 222 ms of which 1 ms to minimize.
[2021-05-14 22:07:20] [INFO ] Deduced a trap composed of 12 places in 234 ms of which 0 ms to minimize.
[2021-05-14 22:07:20] [INFO ] Deduced a trap composed of 53 places in 219 ms of which 0 ms to minimize.
[2021-05-14 22:07:20] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 1 ms to minimize.
[2021-05-14 22:07:21] [INFO ] Deduced a trap composed of 16 places in 211 ms of which 1 ms to minimize.
[2021-05-14 22:07:21] [INFO ] Deduced a trap composed of 70 places in 218 ms of which 0 ms to minimize.
[2021-05-14 22:07:21] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 1 ms to minimize.
[2021-05-14 22:07:21] [INFO ] Deduced a trap composed of 30 places in 236 ms of which 0 ms to minimize.
[2021-05-14 22:07:22] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 0 ms to minimize.
[2021-05-14 22:07:22] [INFO ] Deduced a trap composed of 12 places in 224 ms of which 0 ms to minimize.
[2021-05-14 22:07:22] [INFO ] Deduced a trap composed of 40 places in 223 ms of which 0 ms to minimize.
[2021-05-14 22:07:23] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 0 ms to minimize.
[2021-05-14 22:07:23] [INFO ] Deduced a trap composed of 70 places in 215 ms of which 0 ms to minimize.
[2021-05-14 22:07:23] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 0 ms to minimize.
[2021-05-14 22:07:23] [INFO ] Deduced a trap composed of 52 places in 176 ms of which 1 ms to minimize.
[2021-05-14 22:07:23] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 0 ms to minimize.
[2021-05-14 22:07:24] [INFO ] Deduced a trap composed of 57 places in 178 ms of which 0 ms to minimize.
[2021-05-14 22:07:24] [INFO ] Deduced a trap composed of 61 places in 181 ms of which 0 ms to minimize.
[2021-05-14 22:07:24] [INFO ] Deduced a trap composed of 61 places in 180 ms of which 1 ms to minimize.
[2021-05-14 22:07:24] [INFO ] Deduced a trap composed of 91 places in 172 ms of which 1 ms to minimize.
[2021-05-14 22:07:25] [INFO ] Deduced a trap composed of 57 places in 190 ms of which 0 ms to minimize.
[2021-05-14 22:07:25] [INFO ] Deduced a trap composed of 57 places in 182 ms of which 0 ms to minimize.
[2021-05-14 22:07:25] [INFO ] Deduced a trap composed of 64 places in 205 ms of which 0 ms to minimize.
[2021-05-14 22:07:25] [INFO ] Deduced a trap composed of 11 places in 262 ms of which 0 ms to minimize.
[2021-05-14 22:07:26] [INFO ] Deduced a trap composed of 14 places in 241 ms of which 0 ms to minimize.
[2021-05-14 22:07:26] [INFO ] Deduced a trap composed of 22 places in 234 ms of which 1 ms to minimize.
[2021-05-14 22:07:26] [INFO ] Deduced a trap composed of 47 places in 200 ms of which 1 ms to minimize.
[2021-05-14 22:07:26] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 12656 ms
[2021-05-14 22:07:26] [INFO ] Computed and/alt/rep : 1246/4782/1246 causal constraints (skipped 112 transitions) in 76 ms.
[2021-05-14 22:07:31] [INFO ] Deduced a trap composed of 28 places in 219 ms of which 0 ms to minimize.
[2021-05-14 22:07:31] [INFO ] Deduced a trap composed of 25 places in 214 ms of which 1 ms to minimize.
[2021-05-14 22:07:32] [INFO ] Deduced a trap composed of 57 places in 215 ms of which 1 ms to minimize.
[2021-05-14 22:07:32] [INFO ] Deduced a trap composed of 80 places in 210 ms of which 0 ms to minimize.
[2021-05-14 22:07:32] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 0 ms to minimize.
[2021-05-14 22:07:33] [INFO ] Deduced a trap composed of 48 places in 210 ms of which 1 ms to minimize.
[2021-05-14 22:07:33] [INFO ] Deduced a trap composed of 86 places in 225 ms of which 0 ms to minimize.
[2021-05-14 22:07:33] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 1 ms to minimize.
[2021-05-14 22:07:33] [INFO ] Deduced a trap composed of 133 places in 208 ms of which 1 ms to minimize.
[2021-05-14 22:07:34] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 0 ms to minimize.
[2021-05-14 22:07:34] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3006 ms
[2021-05-14 22:07:34] [INFO ] Added : 363 causal constraints over 74 iterations in 7834 ms. Result :sat
Minimization took 308 ms.
[2021-05-14 22:07:35] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2021-05-14 22:07:35] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:07:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:07:35] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2021-05-14 22:07:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:07:35] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2021-05-14 22:07:35] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:07:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:07:35] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2021-05-14 22:07:35] [INFO ] [Nat]Added 546 Read/Feed constraints in 61 ms returned sat
[2021-05-14 22:07:35] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 0 ms to minimize.
[2021-05-14 22:07:36] [INFO ] Deduced a trap composed of 45 places in 199 ms of which 0 ms to minimize.
[2021-05-14 22:07:36] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 0 ms to minimize.
[2021-05-14 22:07:36] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 0 ms to minimize.
[2021-05-14 22:07:36] [INFO ] Deduced a trap composed of 12 places in 215 ms of which 1 ms to minimize.
[2021-05-14 22:07:37] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 0 ms to minimize.
[2021-05-14 22:07:37] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 1 ms to minimize.
[2021-05-14 22:07:37] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 0 ms to minimize.
[2021-05-14 22:07:37] [INFO ] Deduced a trap composed of 22 places in 199 ms of which 1 ms to minimize.
[2021-05-14 22:07:38] [INFO ] Deduced a trap composed of 58 places in 199 ms of which 0 ms to minimize.
[2021-05-14 22:07:38] [INFO ] Deduced a trap composed of 43 places in 194 ms of which 0 ms to minimize.
[2021-05-14 22:07:38] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 0 ms to minimize.
[2021-05-14 22:07:38] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 1 ms to minimize.
[2021-05-14 22:07:39] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 1 ms to minimize.
[2021-05-14 22:07:39] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 1 ms to minimize.
[2021-05-14 22:07:39] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 1 ms to minimize.
[2021-05-14 22:07:39] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 1 ms to minimize.
[2021-05-14 22:07:40] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 1 ms to minimize.
[2021-05-14 22:07:40] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 1 ms to minimize.
[2021-05-14 22:07:40] [INFO ] Deduced a trap composed of 59 places in 191 ms of which 0 ms to minimize.
[2021-05-14 22:07:40] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 1 ms to minimize.
[2021-05-14 22:07:40] [INFO ] Deduced a trap composed of 48 places in 192 ms of which 0 ms to minimize.
[2021-05-14 22:07:41] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 0 ms to minimize.
[2021-05-14 22:07:41] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 0 ms to minimize.
[2021-05-14 22:07:41] [INFO ] Deduced a trap composed of 38 places in 189 ms of which 0 ms to minimize.
[2021-05-14 22:07:41] [INFO ] Deduced a trap composed of 57 places in 192 ms of which 0 ms to minimize.
[2021-05-14 22:07:42] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 0 ms to minimize.
[2021-05-14 22:07:42] [INFO ] Deduced a trap composed of 20 places in 189 ms of which 0 ms to minimize.
[2021-05-14 22:07:42] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 0 ms to minimize.
[2021-05-14 22:07:42] [INFO ] Deduced a trap composed of 73 places in 179 ms of which 0 ms to minimize.
[2021-05-14 22:07:42] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 0 ms to minimize.
[2021-05-14 22:07:43] [INFO ] Deduced a trap composed of 59 places in 176 ms of which 1 ms to minimize.
[2021-05-14 22:07:43] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 0 ms to minimize.
[2021-05-14 22:07:43] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 1 ms to minimize.
[2021-05-14 22:07:43] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 1 ms to minimize.
[2021-05-14 22:07:44] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 1 ms to minimize.
[2021-05-14 22:07:44] [INFO ] Deduced a trap composed of 100 places in 213 ms of which 0 ms to minimize.
[2021-05-14 22:07:44] [INFO ] Deduced a trap composed of 39 places in 207 ms of which 0 ms to minimize.
[2021-05-14 22:07:44] [INFO ] Deduced a trap composed of 66 places in 208 ms of which 1 ms to minimize.
[2021-05-14 22:07:45] [INFO ] Deduced a trap composed of 48 places in 208 ms of which 1 ms to minimize.
[2021-05-14 22:07:45] [INFO ] Deduced a trap composed of 59 places in 207 ms of which 1 ms to minimize.
[2021-05-14 22:07:45] [INFO ] Deduced a trap composed of 59 places in 216 ms of which 9 ms to minimize.
[2021-05-14 22:07:45] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 1 ms to minimize.
[2021-05-14 22:07:45] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 1 ms to minimize.
[2021-05-14 22:07:46] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 1 ms to minimize.
[2021-05-14 22:07:46] [INFO ] Deduced a trap composed of 33 places in 193 ms of which 1 ms to minimize.
[2021-05-14 22:07:46] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 0 ms to minimize.
[2021-05-14 22:07:46] [INFO ] Deduced a trap composed of 43 places in 206 ms of which 1 ms to minimize.
[2021-05-14 22:07:47] [INFO ] Deduced a trap composed of 56 places in 157 ms of which 1 ms to minimize.
[2021-05-14 22:07:47] [INFO ] Deduced a trap composed of 64 places in 163 ms of which 0 ms to minimize.
[2021-05-14 22:07:47] [INFO ] Deduced a trap composed of 57 places in 158 ms of which 1 ms to minimize.
[2021-05-14 22:07:47] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 0 ms to minimize.
[2021-05-14 22:07:47] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 0 ms to minimize.
[2021-05-14 22:07:48] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 0 ms to minimize.
[2021-05-14 22:07:48] [INFO ] Deduced a trap composed of 58 places in 144 ms of which 1 ms to minimize.
[2021-05-14 22:07:48] [INFO ] Deduced a trap composed of 58 places in 160 ms of which 0 ms to minimize.
[2021-05-14 22:07:48] [INFO ] Deduced a trap composed of 47 places in 149 ms of which 1 ms to minimize.
[2021-05-14 22:07:48] [INFO ] Deduced a trap composed of 50 places in 147 ms of which 1 ms to minimize.
[2021-05-14 22:07:49] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 1 ms to minimize.
[2021-05-14 22:07:49] [INFO ] Deduced a trap composed of 60 places in 153 ms of which 0 ms to minimize.
[2021-05-14 22:07:49] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 0 ms to minimize.
[2021-05-14 22:07:49] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 0 ms to minimize.
[2021-05-14 22:07:49] [INFO ] Deduced a trap composed of 11 places in 240 ms of which 0 ms to minimize.
[2021-05-14 22:07:50] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 1 ms to minimize.
[2021-05-14 22:07:50] [INFO ] Deduced a trap composed of 36 places in 226 ms of which 0 ms to minimize.
[2021-05-14 22:07:50] [INFO ] Deduced a trap composed of 51 places in 191 ms of which 0 ms to minimize.
[2021-05-14 22:07:50] [INFO ] Deduced a trap composed of 22 places in 197 ms of which 1 ms to minimize.
[2021-05-14 22:07:51] [INFO ] Deduced a trap composed of 29 places in 201 ms of which 1 ms to minimize.
[2021-05-14 22:07:51] [INFO ] Deduced a trap composed of 73 places in 204 ms of which 1 ms to minimize.
[2021-05-14 22:07:51] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 1 ms to minimize.
[2021-05-14 22:07:51] [INFO ] Deduced a trap composed of 48 places in 158 ms of which 0 ms to minimize.
[2021-05-14 22:07:52] [INFO ] Deduced a trap composed of 48 places in 159 ms of which 0 ms to minimize.
[2021-05-14 22:07:52] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 1 ms to minimize.
[2021-05-14 22:07:52] [INFO ] Deduced a trap composed of 66 places in 139 ms of which 1 ms to minimize.
[2021-05-14 22:07:52] [INFO ] Deduced a trap composed of 66 places in 120 ms of which 0 ms to minimize.
[2021-05-14 22:07:52] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 0 ms to minimize.
[2021-05-14 22:07:52] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 0 ms to minimize.
[2021-05-14 22:07:52] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 1 ms to minimize.
[2021-05-14 22:07:53] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 0 ms to minimize.
[2021-05-14 22:07:53] [INFO ] Trap strengthening (SAT) tested/added 80/79 trap constraints in 17414 ms
[2021-05-14 22:07:53] [INFO ] Computed and/alt/rep : 1246/4782/1246 causal constraints (skipped 112 transitions) in 84 ms.
[2021-05-14 22:08:05] [INFO ] Deduced a trap composed of 24 places in 217 ms of which 0 ms to minimize.
[2021-05-14 22:08:05] [INFO ] Deduced a trap composed of 50 places in 241 ms of which 0 ms to minimize.
[2021-05-14 22:08:06] [INFO ] Deduced a trap composed of 16 places in 229 ms of which 0 ms to minimize.
[2021-05-14 22:08:06] [INFO ] Deduced a trap composed of 25 places in 237 ms of which 1 ms to minimize.
[2021-05-14 22:08:06] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 1 ms to minimize.
[2021-05-14 22:08:06] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 1 ms to minimize.
[2021-05-14 22:08:07] [INFO ] Deduced a trap composed of 48 places in 178 ms of which 0 ms to minimize.
[2021-05-14 22:08:07] [INFO ] Deduced a trap composed of 67 places in 172 ms of which 1 ms to minimize.
[2021-05-14 22:08:07] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 0 ms to minimize.
[2021-05-14 22:08:08] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 1 ms to minimize.
[2021-05-14 22:08:08] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 0 ms to minimize.
[2021-05-14 22:08:08] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 0 ms to minimize.
[2021-05-14 22:08:08] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 1 ms to minimize.
[2021-05-14 22:08:09] [INFO ] Deduced a trap composed of 57 places in 106 ms of which 0 ms to minimize.
[2021-05-14 22:08:09] [INFO ] Deduced a trap composed of 58 places in 106 ms of which 0 ms to minimize.
[2021-05-14 22:08:09] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 1 ms to minimize.
[2021-05-14 22:08:09] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 0 ms to minimize.
[2021-05-14 22:08:09] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4607 ms
[2021-05-14 22:08:10] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 0 ms to minimize.
[2021-05-14 22:08:10] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 0 ms to minimize.
[2021-05-14 22:08:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 624 ms
[2021-05-14 22:08:10] [INFO ] Added : 839 causal constraints over 169 iterations in 17483 ms. Result :sat
Minimization took 605 ms.
[2021-05-14 22:08:11] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2021-05-14 22:08:11] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:08:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:08:11] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2021-05-14 22:08:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:08:11] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2021-05-14 22:08:11] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:08:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:08:12] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2021-05-14 22:08:12] [INFO ] [Nat]Added 546 Read/Feed constraints in 66 ms returned sat
[2021-05-14 22:08:12] [INFO ] Deduced a trap composed of 31 places in 210 ms of which 1 ms to minimize.
[2021-05-14 22:08:12] [INFO ] Deduced a trap composed of 38 places in 225 ms of which 0 ms to minimize.
[2021-05-14 22:08:12] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 0 ms to minimize.
[2021-05-14 22:08:13] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 1 ms to minimize.
[2021-05-14 22:08:13] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 0 ms to minimize.
[2021-05-14 22:08:13] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 0 ms to minimize.
[2021-05-14 22:08:13] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 1 ms to minimize.
[2021-05-14 22:08:14] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 1 ms to minimize.
[2021-05-14 22:08:14] [INFO ] Deduced a trap composed of 25 places in 190 ms of which 0 ms to minimize.
[2021-05-14 22:08:14] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 0 ms to minimize.
[2021-05-14 22:08:14] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 1 ms to minimize.
[2021-05-14 22:08:14] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 1 ms to minimize.
[2021-05-14 22:08:15] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 1 ms to minimize.
[2021-05-14 22:08:15] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 1 ms to minimize.
[2021-05-14 22:08:15] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 0 ms to minimize.
[2021-05-14 22:08:15] [INFO ] Deduced a trap composed of 12 places in 205 ms of which 0 ms to minimize.
[2021-05-14 22:08:16] [INFO ] Deduced a trap composed of 63 places in 178 ms of which 1 ms to minimize.
[2021-05-14 22:08:16] [INFO ] Deduced a trap composed of 55 places in 192 ms of which 1 ms to minimize.
[2021-05-14 22:08:16] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 0 ms to minimize.
[2021-05-14 22:08:16] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 1 ms to minimize.
[2021-05-14 22:08:17] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 1 ms to minimize.
[2021-05-14 22:08:17] [INFO ] Deduced a trap composed of 55 places in 178 ms of which 0 ms to minimize.
[2021-05-14 22:08:17] [INFO ] Deduced a trap composed of 55 places in 190 ms of which 1 ms to minimize.
[2021-05-14 22:08:17] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 0 ms to minimize.
[2021-05-14 22:08:17] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 0 ms to minimize.
[2021-05-14 22:08:18] [INFO ] Deduced a trap composed of 56 places in 175 ms of which 0 ms to minimize.
[2021-05-14 22:08:18] [INFO ] Deduced a trap composed of 59 places in 179 ms of which 0 ms to minimize.
[2021-05-14 22:08:18] [INFO ] Deduced a trap composed of 57 places in 191 ms of which 1 ms to minimize.
[2021-05-14 22:08:18] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 1 ms to minimize.
[2021-05-14 22:08:19] [INFO ] Deduced a trap composed of 34 places in 199 ms of which 0 ms to minimize.
[2021-05-14 22:08:19] [INFO ] Deduced a trap composed of 57 places in 188 ms of which 1 ms to minimize.
[2021-05-14 22:08:19] [INFO ] Deduced a trap composed of 57 places in 179 ms of which 1 ms to minimize.
[2021-05-14 22:08:19] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 1 ms to minimize.
[2021-05-14 22:08:19] [INFO ] Deduced a trap composed of 45 places in 196 ms of which 0 ms to minimize.
[2021-05-14 22:08:20] [INFO ] Deduced a trap composed of 29 places in 197 ms of which 1 ms to minimize.
[2021-05-14 22:08:20] [INFO ] Deduced a trap composed of 29 places in 189 ms of which 0 ms to minimize.
[2021-05-14 22:08:20] [INFO ] Deduced a trap composed of 45 places in 199 ms of which 1 ms to minimize.
[2021-05-14 22:08:20] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 0 ms to minimize.
[2021-05-14 22:08:21] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 1 ms to minimize.
[2021-05-14 22:08:21] [INFO ] Deduced a trap composed of 52 places in 185 ms of which 1 ms to minimize.
[2021-05-14 22:08:21] [INFO ] Deduced a trap composed of 36 places in 179 ms of which 0 ms to minimize.
[2021-05-14 22:08:21] [INFO ] Deduced a trap composed of 29 places in 208 ms of which 0 ms to minimize.
[2021-05-14 22:08:22] [INFO ] Deduced a trap composed of 36 places in 181 ms of which 0 ms to minimize.
[2021-05-14 22:08:22] [INFO ] Deduced a trap composed of 29 places in 234 ms of which 1 ms to minimize.
[2021-05-14 22:08:22] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 1 ms to minimize.
[2021-05-14 22:08:22] [INFO ] Deduced a trap composed of 31 places in 193 ms of which 1 ms to minimize.
[2021-05-14 22:08:22] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 1 ms to minimize.
[2021-05-14 22:08:23] [INFO ] Deduced a trap composed of 29 places in 222 ms of which 1 ms to minimize.
[2021-05-14 22:08:23] [INFO ] Deduced a trap composed of 45 places in 218 ms of which 1 ms to minimize.
[2021-05-14 22:08:23] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 1 ms to minimize.
[2021-05-14 22:08:24] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 1 ms to minimize.
[2021-05-14 22:08:24] [INFO ] Deduced a trap composed of 68 places in 193 ms of which 1 ms to minimize.
[2021-05-14 22:08:24] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 0 ms to minimize.
[2021-05-14 22:08:24] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 1 ms to minimize.
[2021-05-14 22:08:24] [INFO ] Deduced a trap composed of 66 places in 220 ms of which 0 ms to minimize.
[2021-05-14 22:08:25] [INFO ] Deduced a trap composed of 48 places in 196 ms of which 0 ms to minimize.
[2021-05-14 22:08:25] [INFO ] Deduced a trap composed of 66 places in 177 ms of which 0 ms to minimize.
[2021-05-14 22:08:25] [INFO ] Deduced a trap composed of 66 places in 178 ms of which 1 ms to minimize.
[2021-05-14 22:08:25] [INFO ] Deduced a trap composed of 66 places in 172 ms of which 0 ms to minimize.
[2021-05-14 22:08:26] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 0 ms to minimize.
[2021-05-14 22:08:26] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 1 ms to minimize.
[2021-05-14 22:08:26] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 1 ms to minimize.
[2021-05-14 22:08:26] [INFO ] Deduced a trap composed of 48 places in 141 ms of which 0 ms to minimize.
[2021-05-14 22:08:26] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 0 ms to minimize.
[2021-05-14 22:08:26] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 0 ms to minimize.
[2021-05-14 22:08:27] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 0 ms to minimize.
[2021-05-14 22:08:27] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 1 ms to minimize.
[2021-05-14 22:08:27] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 1 ms to minimize.
[2021-05-14 22:08:27] [INFO ] Deduced a trap composed of 57 places in 146 ms of which 0 ms to minimize.
[2021-05-14 22:08:27] [INFO ] Deduced a trap composed of 66 places in 145 ms of which 0 ms to minimize.
[2021-05-14 22:08:28] [INFO ] Deduced a trap composed of 66 places in 136 ms of which 1 ms to minimize.
[2021-05-14 22:08:28] [INFO ] Deduced a trap composed of 46 places in 146 ms of which 0 ms to minimize.
[2021-05-14 22:08:28] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 0 ms to minimize.
[2021-05-14 22:08:28] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 0 ms to minimize.
[2021-05-14 22:08:28] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 0 ms to minimize.
[2021-05-14 22:08:28] [INFO ] Deduced a trap composed of 56 places in 148 ms of which 1 ms to minimize.
[2021-05-14 22:08:29] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 0 ms to minimize.
[2021-05-14 22:08:29] [INFO ] Trap strengthening (SAT) tested/added 78/77 trap constraints in 17114 ms
[2021-05-14 22:08:29] [INFO ] Computed and/alt/rep : 1246/4782/1246 causal constraints (skipped 112 transitions) in 70 ms.
[2021-05-14 22:08:37] [INFO ] Deduced a trap composed of 42 places in 249 ms of which 1 ms to minimize.
[2021-05-14 22:08:38] [INFO ] Deduced a trap composed of 15 places in 222 ms of which 1 ms to minimize.
[2021-05-14 22:08:38] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 0 ms to minimize.
[2021-05-14 22:08:38] [INFO ] Deduced a trap composed of 51 places in 213 ms of which 0 ms to minimize.
[2021-05-14 22:08:39] [INFO ] Deduced a trap composed of 24 places in 223 ms of which 0 ms to minimize.
[2021-05-14 22:08:39] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 1 ms to minimize.
[2021-05-14 22:08:39] [INFO ] Deduced a trap composed of 20 places in 196 ms of which 1 ms to minimize.
[2021-05-14 22:08:40] [INFO ] Deduced a trap composed of 42 places in 204 ms of which 1 ms to minimize.
[2021-05-14 22:08:40] [INFO ] Deduced a trap composed of 75 places in 221 ms of which 1 ms to minimize.
[2021-05-14 22:08:40] [INFO ] Deduced a trap composed of 56 places in 198 ms of which 1 ms to minimize.
[2021-05-14 22:08:40] [INFO ] Deduced a trap composed of 47 places in 208 ms of which 0 ms to minimize.
[2021-05-14 22:08:41] [INFO ] Deduced a trap composed of 51 places in 230 ms of which 0 ms to minimize.
[2021-05-14 22:08:41] [INFO ] Deduced a trap composed of 56 places in 198 ms of which 0 ms to minimize.
[2021-05-14 22:08:41] [INFO ] Deduced a trap composed of 79 places in 167 ms of which 1 ms to minimize.
[2021-05-14 22:08:42] [INFO ] Deduced a trap composed of 50 places in 181 ms of which 0 ms to minimize.
[2021-05-14 22:08:42] [INFO ] Deduced a trap composed of 53 places in 183 ms of which 0 ms to minimize.
[2021-05-14 22:08:43] [INFO ] Deduced a trap composed of 20 places in 194 ms of which 1 ms to minimize.
[2021-05-14 22:08:43] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 1 ms to minimize.
[2021-05-14 22:08:43] [INFO ] Deduced a trap composed of 47 places in 153 ms of which 1 ms to minimize.
[2021-05-14 22:08:43] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 0 ms to minimize.
[2021-05-14 22:08:43] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 6152 ms
[2021-05-14 22:08:44] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 1 ms to minimize.
[2021-05-14 22:08:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 338 ms
[2021-05-14 22:08:44] [INFO ] Added : 637 causal constraints over 128 iterations in 15251 ms. Result :sat
Minimization took 386 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 95600 steps, including 1000 resets, run finished after 285 ms. (steps per millisecond=335 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 247700 steps, including 1000 resets, run finished after 710 ms. (steps per millisecond=348 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 555500 steps, including 1000 resets, run finished after 1490 ms. (steps per millisecond=372 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 662900 steps, including 1000 resets, run finished after 1785 ms. (steps per millisecond=371 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 4 out of 598 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 598/598 places, 1702/1702 transitions.
Applied a total of 0 rules in 44 ms. Remains 598 /598 variables (removed 0) and now considering 1702/1702 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 598/598 places, 1702/1702 transitions.
Starting structural reductions, iteration 0 : 598/598 places, 1702/1702 transitions.
Applied a total of 0 rules in 41 ms. Remains 598 /598 variables (removed 0) and now considering 1702/1702 (removed 0) transitions.
[2021-05-14 22:08:49] [INFO ] Flow matrix only has 1366 transitions (discarded 336 similar events)
// Phase 1: matrix 1366 rows 598 cols
[2021-05-14 22:08:49] [INFO ] Computed 31 place invariants in 4 ms
[2021-05-14 22:08:49] [INFO ] Implicit Places using invariants in 690 ms returned [582, 583, 584, 585, 586, 595, 596, 597]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 695 ms to find 8 implicit places.
[2021-05-14 22:08:50] [INFO ] Redundant transitions in 148 ms returned []
[2021-05-14 22:08:50] [INFO ] Flow matrix only has 1366 transitions (discarded 336 similar events)
// Phase 1: matrix 1366 rows 590 cols
[2021-05-14 22:08:50] [INFO ] Computed 23 place invariants in 4 ms
[2021-05-14 22:08:50] [INFO ] Dead Transitions using invariants and state equation in 724 ms returned []
Starting structural reductions, iteration 1 : 590/598 places, 1702/1702 transitions.
Applied a total of 0 rules in 34 ms. Remains 590 /590 variables (removed 0) and now considering 1702/1702 (removed 0) transitions.
[2021-05-14 22:08:50] [INFO ] Redundant transitions in 109 ms returned []
[2021-05-14 22:08:50] [INFO ] Flow matrix only has 1366 transitions (discarded 336 similar events)
// Phase 1: matrix 1366 rows 590 cols
[2021-05-14 22:08:51] [INFO ] Computed 23 place invariants in 3 ms
[2021-05-14 22:08:51] [INFO ] Dead Transitions using invariants and state equation in 835 ms returned []
Finished structural reductions, in 2 iterations. Remains : 590/598 places, 1702/1702 transitions.
Normalized transition count is 1366 out of 1702 initially.
// Phase 1: matrix 1366 rows 590 cols
[2021-05-14 22:08:51] [INFO ] Computed 23 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3015 ms. (steps per millisecond=331 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 696 ms. (steps per millisecond=1436 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 675 ms. (steps per millisecond=1481 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 677 ms. (steps per millisecond=1477 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 705 ms. (steps per millisecond=1418 ) properties (out of 4) seen :0
[2021-05-14 22:08:57] [INFO ] Flow matrix only has 1366 transitions (discarded 336 similar events)
// Phase 1: matrix 1366 rows 590 cols
[2021-05-14 22:08:57] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-14 22:08:57] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2021-05-14 22:08:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:08:57] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2021-05-14 22:08:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:08:58] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2021-05-14 22:08:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:08:58] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2021-05-14 22:08:58] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 22:08:58] [INFO ] [Nat]Added 546 Read/Feed constraints in 64 ms returned sat
[2021-05-14 22:08:58] [INFO ] Deduced a trap composed of 83 places in 218 ms of which 1 ms to minimize.
[2021-05-14 22:08:58] [INFO ] Deduced a trap composed of 12 places in 224 ms of which 1 ms to minimize.
[2021-05-14 22:08:59] [INFO ] Deduced a trap composed of 55 places in 230 ms of which 1 ms to minimize.
[2021-05-14 22:08:59] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 1 ms to minimize.
[2021-05-14 22:08:59] [INFO ] Deduced a trap composed of 52 places in 219 ms of which 0 ms to minimize.
[2021-05-14 22:09:00] [INFO ] Deduced a trap composed of 27 places in 233 ms of which 1 ms to minimize.
[2021-05-14 22:09:00] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 0 ms to minimize.
[2021-05-14 22:09:00] [INFO ] Deduced a trap composed of 68 places in 224 ms of which 1 ms to minimize.
[2021-05-14 22:09:00] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 0 ms to minimize.
[2021-05-14 22:09:01] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 0 ms to minimize.
[2021-05-14 22:09:01] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 1 ms to minimize.
[2021-05-14 22:09:01] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 0 ms to minimize.
[2021-05-14 22:09:01] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 1 ms to minimize.
[2021-05-14 22:09:02] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 1 ms to minimize.
[2021-05-14 22:09:02] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 0 ms to minimize.
[2021-05-14 22:09:02] [INFO ] Deduced a trap composed of 44 places in 202 ms of which 1 ms to minimize.
[2021-05-14 22:09:02] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 0 ms to minimize.
[2021-05-14 22:09:03] [INFO ] Deduced a trap composed of 71 places in 204 ms of which 0 ms to minimize.
[2021-05-14 22:09:03] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 0 ms to minimize.
[2021-05-14 22:09:03] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 1 ms to minimize.
[2021-05-14 22:09:03] [INFO ] Deduced a trap composed of 62 places in 196 ms of which 1 ms to minimize.
[2021-05-14 22:09:04] [INFO ] Deduced a trap composed of 71 places in 215 ms of which 1 ms to minimize.
[2021-05-14 22:09:04] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 0 ms to minimize.
[2021-05-14 22:09:04] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 1 ms to minimize.
[2021-05-14 22:09:04] [INFO ] Deduced a trap composed of 44 places in 204 ms of which 0 ms to minimize.
[2021-05-14 22:09:05] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 0 ms to minimize.
[2021-05-14 22:09:05] [INFO ] Deduced a trap composed of 60 places in 185 ms of which 1 ms to minimize.
[2021-05-14 22:09:05] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 0 ms to minimize.
[2021-05-14 22:09:05] [INFO ] Deduced a trap composed of 12 places in 200 ms of which 1 ms to minimize.
[2021-05-14 22:09:06] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 1 ms to minimize.
[2021-05-14 22:09:06] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 0 ms to minimize.
[2021-05-14 22:09:06] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 1 ms to minimize.
[2021-05-14 22:09:06] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 0 ms to minimize.
[2021-05-14 22:09:06] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 0 ms to minimize.
[2021-05-14 22:09:07] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 0 ms to minimize.
[2021-05-14 22:09:07] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 1 ms to minimize.
[2021-05-14 22:09:07] [INFO ] Deduced a trap composed of 62 places in 190 ms of which 1 ms to minimize.
[2021-05-14 22:09:07] [INFO ] Deduced a trap composed of 62 places in 180 ms of which 0 ms to minimize.
[2021-05-14 22:09:08] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 0 ms to minimize.
[2021-05-14 22:09:08] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 0 ms to minimize.
[2021-05-14 22:09:08] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 1 ms to minimize.
[2021-05-14 22:09:08] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 0 ms to minimize.
[2021-05-14 22:09:08] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 1 ms to minimize.
[2021-05-14 22:09:09] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 1 ms to minimize.
[2021-05-14 22:09:09] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 1 ms to minimize.
[2021-05-14 22:09:09] [INFO ] Deduced a trap composed of 77 places in 237 ms of which 0 ms to minimize.
[2021-05-14 22:09:09] [INFO ] Deduced a trap composed of 16 places in 240 ms of which 0 ms to minimize.
[2021-05-14 22:09:10] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 1 ms to minimize.
[2021-05-14 22:09:10] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 0 ms to minimize.
[2021-05-14 22:09:10] [INFO ] Deduced a trap composed of 57 places in 196 ms of which 0 ms to minimize.
[2021-05-14 22:09:10] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 0 ms to minimize.
[2021-05-14 22:09:11] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 12597 ms
[2021-05-14 22:09:11] [INFO ] Computed and/alt/rep : 1246/4782/1246 causal constraints (skipped 112 transitions) in 72 ms.
[2021-05-14 22:09:26] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 1 ms to minimize.
[2021-05-14 22:09:27] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 1 ms to minimize.
[2021-05-14 22:09:27] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 1 ms to minimize.
[2021-05-14 22:09:27] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 1 ms to minimize.
[2021-05-14 22:09:28] [INFO ] Deduced a trap composed of 12 places in 242 ms of which 1 ms to minimize.
[2021-05-14 22:09:28] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 0 ms to minimize.
[2021-05-14 22:09:28] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 0 ms to minimize.
[2021-05-14 22:09:29] [INFO ] Deduced a trap composed of 78 places in 185 ms of which 0 ms to minimize.
[2021-05-14 22:09:29] [INFO ] Deduced a trap composed of 78 places in 213 ms of which 0 ms to minimize.
[2021-05-14 22:09:29] [INFO ] Deduced a trap composed of 92 places in 214 ms of which 0 ms to minimize.
[2021-05-14 22:09:30] [INFO ] Deduced a trap composed of 50 places in 185 ms of which 0 ms to minimize.
[2021-05-14 22:09:30] [INFO ] Deduced a trap composed of 71 places in 178 ms of which 0 ms to minimize.
[2021-05-14 22:09:30] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 0 ms to minimize.
[2021-05-14 22:09:31] [INFO ] Deduced a trap composed of 52 places in 197 ms of which 1 ms to minimize.
[2021-05-14 22:09:31] [INFO ] Deduced a trap composed of 51 places in 195 ms of which 0 ms to minimize.
[2021-05-14 22:09:31] [INFO ] Deduced a trap composed of 41 places in 219 ms of which 0 ms to minimize.
[2021-05-14 22:09:31] [INFO ] Deduced a trap composed of 31 places in 212 ms of which 0 ms to minimize.
[2021-05-14 22:09:32] [INFO ] Deduced a trap composed of 22 places in 211 ms of which 0 ms to minimize.
[2021-05-14 22:09:32] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 0 ms to minimize.
[2021-05-14 22:09:32] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 0 ms to minimize.
[2021-05-14 22:09:33] [INFO ] Deduced a trap composed of 73 places in 179 ms of which 1 ms to minimize.
[2021-05-14 22:09:33] [INFO ] Deduced a trap composed of 82 places in 181 ms of which 1 ms to minimize.
[2021-05-14 22:09:33] [INFO ] Deduced a trap composed of 58 places in 154 ms of which 0 ms to minimize.
[2021-05-14 22:09:34] [INFO ] Deduced a trap composed of 82 places in 186 ms of which 0 ms to minimize.
[2021-05-14 22:09:34] [INFO ] Deduced a trap composed of 82 places in 199 ms of which 1 ms to minimize.
[2021-05-14 22:09:34] [INFO ] Deduced a trap composed of 70 places in 192 ms of which 0 ms to minimize.
[2021-05-14 22:09:34] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 0 ms to minimize.
[2021-05-14 22:09:35] [INFO ] Deduced a trap composed of 82 places in 174 ms of which 1 ms to minimize.
[2021-05-14 22:09:35] [INFO ] Deduced a trap composed of 59 places in 194 ms of which 1 ms to minimize.
[2021-05-14 22:09:35] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 1 ms to minimize.
[2021-05-14 22:09:36] [INFO ] Deduced a trap composed of 49 places in 195 ms of which 0 ms to minimize.
[2021-05-14 22:09:36] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 0 ms to minimize.
[2021-05-14 22:09:36] [INFO ] Deduced a trap composed of 20 places in 201 ms of which 0 ms to minimize.
[2021-05-14 22:09:37] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 1 ms to minimize.
[2021-05-14 22:09:37] [INFO ] Deduced a trap composed of 22 places in 189 ms of which 1 ms to minimize.
[2021-05-14 22:09:37] [INFO ] Deduced a trap composed of 54 places in 219 ms of which 1 ms to minimize.
[2021-05-14 22:09:38] [INFO ] Deduced a trap composed of 45 places in 221 ms of which 0 ms to minimize.
[2021-05-14 22:09:38] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 0 ms to minimize.
[2021-05-14 22:09:38] [INFO ] Deduced a trap composed of 36 places in 208 ms of which 0 ms to minimize.
[2021-05-14 22:09:38] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 0 ms to minimize.
[2021-05-14 22:09:39] [INFO ] Deduced a trap composed of 65 places in 216 ms of which 1 ms to minimize.
[2021-05-14 22:09:39] [INFO ] Deduced a trap composed of 40 places in 215 ms of which 0 ms to minimize.
[2021-05-14 22:09:39] [INFO ] Deduced a trap composed of 36 places in 216 ms of which 1 ms to minimize.
[2021-05-14 22:09:40] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 0 ms to minimize.
[2021-05-14 22:09:40] [INFO ] Deduced a trap composed of 69 places in 202 ms of which 0 ms to minimize.
[2021-05-14 22:09:40] [INFO ] Deduced a trap composed of 80 places in 202 ms of which 1 ms to minimize.
[2021-05-14 22:09:41] [INFO ] Deduced a trap composed of 40 places in 202 ms of which 1 ms to minimize.
[2021-05-14 22:09:41] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 14728 ms
[2021-05-14 22:09:41] [INFO ] Added : 1019 causal constraints over 205 iterations in 30488 ms.(timeout) Result :sat
Minimization took 893 ms.
[2021-05-14 22:09:42] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2021-05-14 22:09:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:09:42] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2021-05-14 22:09:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:09:42] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2021-05-14 22:09:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:09:43] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2021-05-14 22:09:43] [INFO ] [Nat]Added 546 Read/Feed constraints in 66 ms returned sat
[2021-05-14 22:09:43] [INFO ] Deduced a trap composed of 30 places in 220 ms of which 1 ms to minimize.
[2021-05-14 22:09:43] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 1 ms to minimize.
[2021-05-14 22:09:44] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 1 ms to minimize.
[2021-05-14 22:09:44] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 0 ms to minimize.
[2021-05-14 22:09:44] [INFO ] Deduced a trap composed of 87 places in 242 ms of which 1 ms to minimize.
[2021-05-14 22:09:44] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 0 ms to minimize.
[2021-05-14 22:09:45] [INFO ] Deduced a trap composed of 22 places in 194 ms of which 0 ms to minimize.
[2021-05-14 22:09:45] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 0 ms to minimize.
[2021-05-14 22:09:45] [INFO ] Deduced a trap composed of 48 places in 192 ms of which 0 ms to minimize.
[2021-05-14 22:09:45] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 1 ms to minimize.
[2021-05-14 22:09:46] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 0 ms to minimize.
[2021-05-14 22:09:46] [INFO ] Deduced a trap composed of 44 places in 207 ms of which 1 ms to minimize.
[2021-05-14 22:09:46] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 0 ms to minimize.
[2021-05-14 22:09:46] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 0 ms to minimize.
[2021-05-14 22:09:47] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 1 ms to minimize.
[2021-05-14 22:09:47] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 0 ms to minimize.
[2021-05-14 22:09:47] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 1 ms to minimize.
[2021-05-14 22:09:47] [INFO ] Deduced a trap composed of 11 places in 227 ms of which 1 ms to minimize.
[2021-05-14 22:09:48] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 0 ms to minimize.
[2021-05-14 22:09:48] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 0 ms to minimize.
[2021-05-14 22:09:48] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 1 ms to minimize.
[2021-05-14 22:09:48] [INFO ] Deduced a trap composed of 86 places in 210 ms of which 0 ms to minimize.
[2021-05-14 22:09:49] [INFO ] Deduced a trap composed of 71 places in 212 ms of which 1 ms to minimize.
[2021-05-14 22:09:49] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 1 ms to minimize.
[2021-05-14 22:09:49] [INFO ] Deduced a trap composed of 49 places in 182 ms of which 1 ms to minimize.
[2021-05-14 22:09:49] [INFO ] Deduced a trap composed of 64 places in 177 ms of which 0 ms to minimize.
[2021-05-14 22:09:49] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 0 ms to minimize.
[2021-05-14 22:09:50] [INFO ] Deduced a trap composed of 48 places in 199 ms of which 0 ms to minimize.
[2021-05-14 22:09:50] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 0 ms to minimize.
[2021-05-14 22:09:50] [INFO ] Deduced a trap composed of 80 places in 162 ms of which 0 ms to minimize.
[2021-05-14 22:09:50] [INFO ] Deduced a trap composed of 31 places in 177 ms of which 1 ms to minimize.
[2021-05-14 22:09:51] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 0 ms to minimize.
[2021-05-14 22:09:51] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 1 ms to minimize.
[2021-05-14 22:09:51] [INFO ] Deduced a trap composed of 68 places in 177 ms of which 0 ms to minimize.
[2021-05-14 22:09:51] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 0 ms to minimize.
[2021-05-14 22:09:51] [INFO ] Deduced a trap composed of 39 places in 201 ms of which 1 ms to minimize.
[2021-05-14 22:09:52] [INFO ] Deduced a trap composed of 38 places in 217 ms of which 1 ms to minimize.
[2021-05-14 22:09:52] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 0 ms to minimize.
[2021-05-14 22:09:52] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 0 ms to minimize.
[2021-05-14 22:09:52] [INFO ] Deduced a trap composed of 61 places in 176 ms of which 1 ms to minimize.
[2021-05-14 22:09:53] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 0 ms to minimize.
[2021-05-14 22:09:53] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 1 ms to minimize.
[2021-05-14 22:09:53] [INFO ] Deduced a trap composed of 57 places in 175 ms of which 0 ms to minimize.
[2021-05-14 22:09:53] [INFO ] Deduced a trap composed of 62 places in 179 ms of which 1 ms to minimize.
[2021-05-14 22:09:53] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 0 ms to minimize.
[2021-05-14 22:09:54] [INFO ] Deduced a trap composed of 70 places in 174 ms of which 0 ms to minimize.
[2021-05-14 22:09:54] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 0 ms to minimize.
[2021-05-14 22:09:54] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 0 ms to minimize.
[2021-05-14 22:09:54] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 0 ms to minimize.
[2021-05-14 22:09:54] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 0 ms to minimize.
[2021-05-14 22:09:55] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 0 ms to minimize.
[2021-05-14 22:09:55] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 1 ms to minimize.
[2021-05-14 22:09:55] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 1 ms to minimize.
[2021-05-14 22:09:55] [INFO ] Deduced a trap composed of 20 places in 201 ms of which 1 ms to minimize.
[2021-05-14 22:09:55] [INFO ] Deduced a trap composed of 29 places in 210 ms of which 1 ms to minimize.
[2021-05-14 22:09:56] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 1 ms to minimize.
[2021-05-14 22:09:56] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 1 ms to minimize.
[2021-05-14 22:09:56] [INFO ] Deduced a trap composed of 70 places in 171 ms of which 1 ms to minimize.
[2021-05-14 22:09:56] [INFO ] Deduced a trap composed of 66 places in 181 ms of which 0 ms to minimize.
[2021-05-14 22:09:57] [INFO ] Deduced a trap composed of 62 places in 147 ms of which 0 ms to minimize.
[2021-05-14 22:09:57] [INFO ] Deduced a trap composed of 57 places in 144 ms of which 1 ms to minimize.
[2021-05-14 22:09:57] [INFO ] Deduced a trap composed of 57 places in 144 ms of which 1 ms to minimize.
[2021-05-14 22:09:57] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 0 ms to minimize.
[2021-05-14 22:09:57] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 1 ms to minimize.
[2021-05-14 22:09:57] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 1 ms to minimize.
[2021-05-14 22:09:58] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 0 ms to minimize.
[2021-05-14 22:09:58] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 1 ms to minimize.
[2021-05-14 22:09:58] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 0 ms to minimize.
[2021-05-14 22:09:58] [INFO ] Deduced a trap composed of 44 places in 193 ms of which 0 ms to minimize.
[2021-05-14 22:09:59] [INFO ] Deduced a trap composed of 47 places in 205 ms of which 1 ms to minimize.
[2021-05-14 22:09:59] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 1 ms to minimize.
[2021-05-14 22:09:59] [INFO ] Deduced a trap composed of 58 places in 187 ms of which 1 ms to minimize.
[2021-05-14 22:09:59] [INFO ] Deduced a trap composed of 58 places in 183 ms of which 1 ms to minimize.
[2021-05-14 22:09:59] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 1 ms to minimize.
[2021-05-14 22:10:00] [INFO ] Deduced a trap composed of 68 places in 183 ms of which 1 ms to minimize.
[2021-05-14 22:10:00] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 0 ms to minimize.
[2021-05-14 22:10:00] [INFO ] Deduced a trap composed of 44 places in 182 ms of which 0 ms to minimize.
[2021-05-14 22:10:00] [INFO ] Deduced a trap composed of 76 places in 218 ms of which 0 ms to minimize.
[2021-05-14 22:10:01] [INFO ] Deduced a trap composed of 67 places in 183 ms of which 0 ms to minimize.
[2021-05-14 22:10:01] [INFO ] Deduced a trap composed of 53 places in 191 ms of which 1 ms to minimize.
[2021-05-14 22:10:01] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 1 ms to minimize.
[2021-05-14 22:10:01] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 0 ms to minimize.
[2021-05-14 22:10:02] [INFO ] Deduced a trap composed of 53 places in 177 ms of which 1 ms to minimize.
[2021-05-14 22:10:02] [INFO ] Deduced a trap composed of 22 places in 240 ms of which 0 ms to minimize.
[2021-05-14 22:10:02] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 0 ms to minimize.
[2021-05-14 22:10:02] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 0 ms to minimize.
[2021-05-14 22:10:03] [INFO ] Deduced a trap composed of 68 places in 149 ms of which 0 ms to minimize.
[2021-05-14 22:10:03] [INFO ] Deduced a trap composed of 61 places in 146 ms of which 0 ms to minimize.
[2021-05-14 22:10:03] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 1 ms to minimize.
[2021-05-14 22:10:03] [INFO ] Deduced a trap composed of 59 places in 146 ms of which 0 ms to minimize.
[2021-05-14 22:10:03] [INFO ] Deduced a trap composed of 70 places in 146 ms of which 0 ms to minimize.
[2021-05-14 22:10:03] [INFO ] Deduced a trap composed of 59 places in 150 ms of which 1 ms to minimize.
[2021-05-14 22:10:04] [INFO ] Deduced a trap composed of 71 places in 152 ms of which 1 ms to minimize.
[2021-05-14 22:10:04] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 1 ms to minimize.
[2021-05-14 22:10:04] [INFO ] Deduced a trap composed of 59 places in 150 ms of which 0 ms to minimize.
[2021-05-14 22:10:04] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 1 ms to minimize.
[2021-05-14 22:10:04] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 1 ms to minimize.
[2021-05-14 22:10:05] [INFO ] Deduced a trap composed of 24 places in 204 ms of which 1 ms to minimize.
[2021-05-14 22:10:05] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 1 ms to minimize.
[2021-05-14 22:10:05] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 0 ms to minimize.
[2021-05-14 22:10:05] [INFO ] Deduced a trap composed of 71 places in 181 ms of which 1 ms to minimize.
[2021-05-14 22:10:06] [INFO ] Deduced a trap composed of 40 places in 182 ms of which 0 ms to minimize.
[2021-05-14 22:10:06] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 0 ms to minimize.
[2021-05-14 22:10:06] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 1 ms to minimize.
[2021-05-14 22:10:06] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 1 ms to minimize.
[2021-05-14 22:10:07] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 1 ms to minimize.
[2021-05-14 22:10:07] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 1 ms to minimize.
[2021-05-14 22:10:07] [INFO ] Deduced a trap composed of 20 places in 199 ms of which 0 ms to minimize.
[2021-05-14 22:10:07] [INFO ] Deduced a trap composed of 29 places in 180 ms of which 0 ms to minimize.
[2021-05-14 22:10:07] [INFO ] Trap strengthening (SAT) tested/added 110/109 trap constraints in 24507 ms
[2021-05-14 22:10:07] [INFO ] Computed and/alt/rep : 1246/4782/1246 causal constraints (skipped 112 transitions) in 104 ms.
[2021-05-14 22:10:26] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 0 ms to minimize.
[2021-05-14 22:10:26] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 1 ms to minimize.
[2021-05-14 22:10:27] [INFO ] Deduced a trap composed of 45 places in 158 ms of which 0 ms to minimize.
[2021-05-14 22:10:27] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 0 ms to minimize.
[2021-05-14 22:10:27] [INFO ] Deduced a trap composed of 67 places in 158 ms of which 0 ms to minimize.
[2021-05-14 22:10:27] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 0 ms to minimize.
[2021-05-14 22:10:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-14 22:10:28] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2021-05-14 22:10:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:10:28] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2021-05-14 22:10:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:10:28] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2021-05-14 22:10:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:10:28] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2021-05-14 22:10:28] [INFO ] [Nat]Added 546 Read/Feed constraints in 69 ms returned sat
[2021-05-14 22:10:28] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 1 ms to minimize.
[2021-05-14 22:10:29] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 1 ms to minimize.
[2021-05-14 22:10:29] [INFO ] Deduced a trap composed of 39 places in 216 ms of which 1 ms to minimize.
[2021-05-14 22:10:29] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 0 ms to minimize.
[2021-05-14 22:10:29] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 1 ms to minimize.
[2021-05-14 22:10:30] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 1 ms to minimize.
[2021-05-14 22:10:30] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 0 ms to minimize.
[2021-05-14 22:10:30] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 1 ms to minimize.
[2021-05-14 22:10:31] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 1 ms to minimize.
[2021-05-14 22:10:31] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 0 ms to minimize.
[2021-05-14 22:10:31] [INFO ] Deduced a trap composed of 59 places in 203 ms of which 1 ms to minimize.
[2021-05-14 22:10:31] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 0 ms to minimize.
[2021-05-14 22:10:31] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 0 ms to minimize.
[2021-05-14 22:10:32] [INFO ] Deduced a trap composed of 48 places in 202 ms of which 0 ms to minimize.
[2021-05-14 22:10:32] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 1 ms to minimize.
[2021-05-14 22:10:32] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 1 ms to minimize.
[2021-05-14 22:10:32] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 0 ms to minimize.
[2021-05-14 22:10:33] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 0 ms to minimize.
[2021-05-14 22:10:33] [INFO ] Deduced a trap composed of 39 places in 226 ms of which 1 ms to minimize.
[2021-05-14 22:10:33] [INFO ] Deduced a trap composed of 39 places in 227 ms of which 0 ms to minimize.
[2021-05-14 22:10:33] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 1 ms to minimize.
[2021-05-14 22:10:34] [INFO ] Deduced a trap composed of 39 places in 225 ms of which 1 ms to minimize.
[2021-05-14 22:10:34] [INFO ] Deduced a trap composed of 40 places in 224 ms of which 1 ms to minimize.
[2021-05-14 22:10:34] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 0 ms to minimize.
[2021-05-14 22:10:34] [INFO ] Deduced a trap composed of 100 places in 216 ms of which 1 ms to minimize.
[2021-05-14 22:10:35] [INFO ] Deduced a trap composed of 58 places in 217 ms of which 1 ms to minimize.
[2021-05-14 22:10:35] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 0 ms to minimize.
[2021-05-14 22:10:35] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 0 ms to minimize.
[2021-05-14 22:10:35] [INFO ] Deduced a trap composed of 22 places in 217 ms of which 0 ms to minimize.
[2021-05-14 22:10:36] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 1 ms to minimize.
[2021-05-14 22:10:36] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 1 ms to minimize.
[2021-05-14 22:10:36] [INFO ] Deduced a trap composed of 22 places in 199 ms of which 0 ms to minimize.
[2021-05-14 22:10:36] [INFO ] Deduced a trap composed of 66 places in 200 ms of which 0 ms to minimize.
[2021-05-14 22:10:37] [INFO ] Deduced a trap composed of 33 places in 200 ms of which 0 ms to minimize.
[2021-05-14 22:10:37] [INFO ] Deduced a trap composed of 48 places in 201 ms of which 1 ms to minimize.
[2021-05-14 22:10:37] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 1 ms to minimize.
[2021-05-14 22:10:37] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 1 ms to minimize.
[2021-05-14 22:10:38] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 1 ms to minimize.
[2021-05-14 22:10:38] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 1 ms to minimize.
[2021-05-14 22:10:38] [INFO ] Deduced a trap composed of 48 places in 156 ms of which 0 ms to minimize.
[2021-05-14 22:10:38] [INFO ] Deduced a trap composed of 57 places in 156 ms of which 0 ms to minimize.
[2021-05-14 22:10:38] [INFO ] Deduced a trap composed of 66 places in 157 ms of which 0 ms to minimize.
[2021-05-14 22:10:39] [INFO ] Deduced a trap composed of 66 places in 169 ms of which 1 ms to minimize.
[2021-05-14 22:10:39] [INFO ] Deduced a trap composed of 57 places in 169 ms of which 0 ms to minimize.
[2021-05-14 22:10:39] [INFO ] Deduced a trap composed of 51 places in 170 ms of which 0 ms to minimize.
[2021-05-14 22:10:39] [INFO ] Deduced a trap composed of 57 places in 170 ms of which 1 ms to minimize.
[2021-05-14 22:10:39] [INFO ] Deduced a trap composed of 57 places in 171 ms of which 0 ms to minimize.
[2021-05-14 22:10:40] [INFO ] Deduced a trap composed of 57 places in 170 ms of which 1 ms to minimize.
[2021-05-14 22:10:40] [INFO ] Deduced a trap composed of 57 places in 170 ms of which 1 ms to minimize.
[2021-05-14 22:10:40] [INFO ] Deduced a trap composed of 66 places in 144 ms of which 0 ms to minimize.
[2021-05-14 22:10:40] [INFO ] Deduced a trap composed of 66 places in 144 ms of which 0 ms to minimize.
[2021-05-14 22:10:40] [INFO ] Deduced a trap composed of 60 places in 112 ms of which 0 ms to minimize.
[2021-05-14 22:10:41] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 0 ms to minimize.
[2021-05-14 22:10:41] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 12326 ms
[2021-05-14 22:10:41] [INFO ] Computed and/alt/rep : 1246/4782/1246 causal constraints (skipped 112 transitions) in 74 ms.
[2021-05-14 22:10:47] [INFO ] Deduced a trap composed of 18 places in 252 ms of which 1 ms to minimize.
[2021-05-14 22:10:48] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 0 ms to minimize.
[2021-05-14 22:10:48] [INFO ] Deduced a trap composed of 35 places in 200 ms of which 1 ms to minimize.
[2021-05-14 22:10:48] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 0 ms to minimize.
[2021-05-14 22:10:49] [INFO ] Deduced a trap composed of 53 places in 195 ms of which 1 ms to minimize.
[2021-05-14 22:10:49] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 1 ms to minimize.
[2021-05-14 22:10:49] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 0 ms to minimize.
[2021-05-14 22:10:49] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 1 ms to minimize.
[2021-05-14 22:10:50] [INFO ] Deduced a trap composed of 62 places in 173 ms of which 0 ms to minimize.
[2021-05-14 22:10:50] [INFO ] Deduced a trap composed of 53 places in 193 ms of which 1 ms to minimize.
[2021-05-14 22:10:50] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 1 ms to minimize.
[2021-05-14 22:10:50] [INFO ] Deduced a trap composed of 29 places in 217 ms of which 1 ms to minimize.
[2021-05-14 22:10:51] [INFO ] Deduced a trap composed of 70 places in 179 ms of which 0 ms to minimize.
[2021-05-14 22:10:51] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 1 ms to minimize.
[2021-05-14 22:10:51] [INFO ] Deduced a trap composed of 20 places in 229 ms of which 0 ms to minimize.
[2021-05-14 22:10:52] [INFO ] Deduced a trap composed of 63 places in 140 ms of which 1 ms to minimize.
[2021-05-14 22:10:52] [INFO ] Deduced a trap composed of 62 places in 154 ms of which 1 ms to minimize.
[2021-05-14 22:10:52] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5016 ms
[2021-05-14 22:10:53] [INFO ] Added : 545 causal constraints over 110 iterations in 12436 ms. Result :sat
Minimization took 556 ms.
[2021-05-14 22:10:54] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2021-05-14 22:10:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:10:54] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2021-05-14 22:10:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:10:54] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2021-05-14 22:10:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:10:54] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2021-05-14 22:10:54] [INFO ] [Nat]Added 546 Read/Feed constraints in 64 ms returned sat
[2021-05-14 22:10:55] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 0 ms to minimize.
[2021-05-14 22:10:55] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 0 ms to minimize.
[2021-05-14 22:10:55] [INFO ] Deduced a trap composed of 11 places in 236 ms of which 0 ms to minimize.
[2021-05-14 22:10:55] [INFO ] Deduced a trap composed of 16 places in 217 ms of which 0 ms to minimize.
[2021-05-14 22:10:56] [INFO ] Deduced a trap composed of 17 places in 230 ms of which 0 ms to minimize.
[2021-05-14 22:10:56] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 1 ms to minimize.
[2021-05-14 22:10:56] [INFO ] Deduced a trap composed of 16 places in 232 ms of which 1 ms to minimize.
[2021-05-14 22:10:56] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 1 ms to minimize.
[2021-05-14 22:10:57] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 1 ms to minimize.
[2021-05-14 22:10:57] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 1 ms to minimize.
[2021-05-14 22:10:57] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 0 ms to minimize.
[2021-05-14 22:10:58] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 0 ms to minimize.
[2021-05-14 22:10:58] [INFO ] Deduced a trap composed of 59 places in 237 ms of which 1 ms to minimize.
[2021-05-14 22:10:58] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 0 ms to minimize.
[2021-05-14 22:10:58] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 1 ms to minimize.
[2021-05-14 22:10:59] [INFO ] Deduced a trap composed of 46 places in 227 ms of which 1 ms to minimize.
[2021-05-14 22:10:59] [INFO ] Deduced a trap composed of 43 places in 211 ms of which 1 ms to minimize.
[2021-05-14 22:10:59] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 1 ms to minimize.
[2021-05-14 22:10:59] [INFO ] Deduced a trap composed of 21 places in 254 ms of which 1 ms to minimize.
[2021-05-14 22:11:00] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 1 ms to minimize.
[2021-05-14 22:11:00] [INFO ] Deduced a trap composed of 20 places in 241 ms of which 1 ms to minimize.
[2021-05-14 22:11:00] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 1 ms to minimize.
[2021-05-14 22:11:00] [INFO ] Deduced a trap composed of 35 places in 230 ms of which 0 ms to minimize.
[2021-05-14 22:11:01] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 1 ms to minimize.
[2021-05-14 22:11:01] [INFO ] Deduced a trap composed of 47 places in 225 ms of which 1 ms to minimize.
[2021-05-14 22:11:01] [INFO ] Deduced a trap composed of 20 places in 235 ms of which 1 ms to minimize.
[2021-05-14 22:11:02] [INFO ] Deduced a trap composed of 57 places in 242 ms of which 1 ms to minimize.
[2021-05-14 22:11:02] [INFO ] Deduced a trap composed of 56 places in 216 ms of which 0 ms to minimize.
[2021-05-14 22:11:02] [INFO ] Deduced a trap composed of 25 places in 225 ms of which 0 ms to minimize.
[2021-05-14 22:11:02] [INFO ] Deduced a trap composed of 34 places in 222 ms of which 1 ms to minimize.
[2021-05-14 22:11:03] [INFO ] Deduced a trap composed of 20 places in 227 ms of which 0 ms to minimize.
[2021-05-14 22:11:03] [INFO ] Deduced a trap composed of 31 places in 249 ms of which 0 ms to minimize.
[2021-05-14 22:11:03] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 0 ms to minimize.
[2021-05-14 22:11:03] [INFO ] Deduced a trap composed of 39 places in 219 ms of which 1 ms to minimize.
[2021-05-14 22:11:04] [INFO ] Deduced a trap composed of 31 places in 218 ms of which 0 ms to minimize.
[2021-05-14 22:11:04] [INFO ] Deduced a trap composed of 47 places in 221 ms of which 0 ms to minimize.
[2021-05-14 22:11:04] [INFO ] Deduced a trap composed of 47 places in 233 ms of which 0 ms to minimize.
[2021-05-14 22:11:04] [INFO ] Deduced a trap composed of 47 places in 224 ms of which 1 ms to minimize.
[2021-05-14 22:11:05] [INFO ] Deduced a trap composed of 47 places in 217 ms of which 0 ms to minimize.
[2021-05-14 22:11:05] [INFO ] Deduced a trap composed of 47 places in 234 ms of which 0 ms to minimize.
[2021-05-14 22:11:05] [INFO ] Deduced a trap composed of 47 places in 217 ms of which 0 ms to minimize.
[2021-05-14 22:11:06] [INFO ] Deduced a trap composed of 56 places in 217 ms of which 1 ms to minimize.
[2021-05-14 22:11:06] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 1 ms to minimize.
[2021-05-14 22:11:06] [INFO ] Deduced a trap composed of 44 places in 203 ms of which 0 ms to minimize.
[2021-05-14 22:11:06] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 0 ms to minimize.
[2021-05-14 22:11:07] [INFO ] Deduced a trap composed of 59 places in 215 ms of which 1 ms to minimize.
[2021-05-14 22:11:07] [INFO ] Deduced a trap composed of 46 places in 208 ms of which 1 ms to minimize.
[2021-05-14 22:11:07] [INFO ] Deduced a trap composed of 38 places in 198 ms of which 0 ms to minimize.
[2021-05-14 22:11:07] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 0 ms to minimize.
[2021-05-14 22:11:07] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 0 ms to minimize.
[2021-05-14 22:11:08] [INFO ] Deduced a trap composed of 29 places in 195 ms of which 1 ms to minimize.
[2021-05-14 22:11:08] [INFO ] Deduced a trap composed of 26 places in 219 ms of which 0 ms to minimize.
[2021-05-14 22:11:08] [INFO ] Deduced a trap composed of 64 places in 214 ms of which 0 ms to minimize.
[2021-05-14 22:11:09] [INFO ] Deduced a trap composed of 42 places in 214 ms of which 1 ms to minimize.
[2021-05-14 22:11:09] [INFO ] Deduced a trap composed of 47 places in 206 ms of which 0 ms to minimize.
[2021-05-14 22:11:09] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 0 ms to minimize.
[2021-05-14 22:11:09] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 0 ms to minimize.
[2021-05-14 22:11:10] [INFO ] Deduced a trap composed of 66 places in 213 ms of which 0 ms to minimize.
[2021-05-14 22:11:10] [INFO ] Deduced a trap composed of 43 places in 206 ms of which 0 ms to minimize.
[2021-05-14 22:11:10] [INFO ] Deduced a trap composed of 47 places in 157 ms of which 0 ms to minimize.
[2021-05-14 22:11:10] [INFO ] Deduced a trap composed of 52 places in 181 ms of which 0 ms to minimize.
[2021-05-14 22:11:10] [INFO ] Deduced a trap composed of 55 places in 179 ms of which 0 ms to minimize.
[2021-05-14 22:11:11] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 0 ms to minimize.
[2021-05-14 22:11:11] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 0 ms to minimize.
[2021-05-14 22:11:11] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 0 ms to minimize.
[2021-05-14 22:11:11] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 0 ms to minimize.
[2021-05-14 22:11:12] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 0 ms to minimize.
[2021-05-14 22:11:12] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 0 ms to minimize.
[2021-05-14 22:11:12] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 1 ms to minimize.
[2021-05-14 22:11:12] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 1 ms to minimize.
[2021-05-14 22:11:12] [INFO ] Deduced a trap composed of 60 places in 176 ms of which 1 ms to minimize.
[2021-05-14 22:11:13] [INFO ] Deduced a trap composed of 62 places in 163 ms of which 1 ms to minimize.
[2021-05-14 22:11:13] [INFO ] Deduced a trap composed of 62 places in 173 ms of which 1 ms to minimize.
[2021-05-14 22:11:13] [INFO ] Deduced a trap composed of 62 places in 174 ms of which 1 ms to minimize.
[2021-05-14 22:11:13] [INFO ] Deduced a trap composed of 56 places in 170 ms of which 1 ms to minimize.
[2021-05-14 22:11:13] [INFO ] Deduced a trap composed of 56 places in 163 ms of which 1 ms to minimize.
[2021-05-14 22:11:14] [INFO ] Deduced a trap composed of 62 places in 174 ms of which 1 ms to minimize.
[2021-05-14 22:11:14] [INFO ] Deduced a trap composed of 61 places in 171 ms of which 0 ms to minimize.
[2021-05-14 22:11:14] [INFO ] Deduced a trap composed of 61 places in 190 ms of which 0 ms to minimize.
[2021-05-14 22:11:14] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 0 ms to minimize.
[2021-05-14 22:11:15] [INFO ] Deduced a trap composed of 56 places in 191 ms of which 1 ms to minimize.
[2021-05-14 22:11:15] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 1 ms to minimize.
[2021-05-14 22:11:15] [INFO ] Deduced a trap composed of 40 places in 190 ms of which 1 ms to minimize.
[2021-05-14 22:11:15] [INFO ] Deduced a trap composed of 71 places in 144 ms of which 1 ms to minimize.
[2021-05-14 22:11:15] [INFO ] Deduced a trap composed of 56 places in 148 ms of which 1 ms to minimize.
[2021-05-14 22:11:16] [INFO ] Deduced a trap composed of 61 places in 132 ms of which 0 ms to minimize.
[2021-05-14 22:11:16] [INFO ] Deduced a trap composed of 71 places in 116 ms of which 0 ms to minimize.
[2021-05-14 22:11:16] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 1 ms to minimize.
[2021-05-14 22:11:16] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 0 ms to minimize.
[2021-05-14 22:11:16] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 1 ms to minimize.
[2021-05-14 22:11:16] [INFO ] Trap strengthening (SAT) tested/added 91/90 trap constraints in 21825 ms
[2021-05-14 22:11:16] [INFO ] Computed and/alt/rep : 1246/4782/1246 causal constraints (skipped 112 transitions) in 88 ms.
[2021-05-14 22:11:36] [INFO ] Added : 1020 causal constraints over 204 iterations in 20085 ms.(timeout) Result :sat
Minimization took 662 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 89400 steps, including 1000 resets, run finished after 291 ms. (steps per millisecond=307 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 370100 steps, including 1000 resets, run finished after 995 ms. (steps per millisecond=371 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 438700 steps, including 1000 resets, run finished after 1162 ms. (steps per millisecond=377 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 4 out of 590 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 590/590 places, 1702/1702 transitions.
Applied a total of 0 rules in 24 ms. Remains 590 /590 variables (removed 0) and now considering 1702/1702 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 590/590 places, 1702/1702 transitions.
Starting structural reductions, iteration 0 : 590/590 places, 1702/1702 transitions.
Applied a total of 0 rules in 23 ms. Remains 590 /590 variables (removed 0) and now considering 1702/1702 (removed 0) transitions.
[2021-05-14 22:11:39] [INFO ] Flow matrix only has 1366 transitions (discarded 336 similar events)
// Phase 1: matrix 1366 rows 590 cols
[2021-05-14 22:11:40] [INFO ] Computed 23 place invariants in 3 ms
[2021-05-14 22:11:40] [INFO ] Implicit Places using invariants in 498 ms returned []
[2021-05-14 22:11:40] [INFO ] Flow matrix only has 1366 transitions (discarded 336 similar events)
// Phase 1: matrix 1366 rows 590 cols
[2021-05-14 22:11:40] [INFO ] Computed 23 place invariants in 3 ms
[2021-05-14 22:11:40] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 22:11:45] [INFO ] Implicit Places using invariants and state equation in 4527 ms returned []
Implicit Place search using SMT with State Equation took 5034 ms to find 0 implicit places.
[2021-05-14 22:11:45] [INFO ] Redundant transitions in 34 ms returned []
[2021-05-14 22:11:45] [INFO ] Flow matrix only has 1366 transitions (discarded 336 similar events)
// Phase 1: matrix 1366 rows 590 cols
[2021-05-14 22:11:45] [INFO ] Computed 23 place invariants in 3 ms
[2021-05-14 22:11:45] [INFO ] Dead Transitions using invariants and state equation in 867 ms returned []
Finished structural reductions, in 1 iterations. Remains : 590/590 places, 1702/1702 transitions.
Starting property specific reduction for Peterson-PT-7-UpperBounds-09
Normalized transition count is 1366 out of 1702 initially.
// Phase 1: matrix 1366 rows 590 cols
[2021-05-14 22:11:47] [INFO ] Computed 23 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2021-05-14 22:11:47] [INFO ] Flow matrix only has 1366 transitions (discarded 336 similar events)
// Phase 1: matrix 1366 rows 590 cols
[2021-05-14 22:11:47] [INFO ] Computed 23 place invariants in 13 ms
[2021-05-14 22:11:47] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2021-05-14 22:11:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:11:47] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2021-05-14 22:11:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:11:47] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2021-05-14 22:11:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:11:48] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2021-05-14 22:11:48] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 22:11:48] [INFO ] [Nat]Added 546 Read/Feed constraints in 68 ms returned sat
[2021-05-14 22:11:48] [INFO ] Deduced a trap composed of 83 places in 212 ms of which 1 ms to minimize.
[2021-05-14 22:11:48] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 1 ms to minimize.
[2021-05-14 22:11:49] [INFO ] Deduced a trap composed of 55 places in 208 ms of which 0 ms to minimize.
[2021-05-14 22:11:49] [INFO ] Deduced a trap composed of 32 places in 224 ms of which 0 ms to minimize.
[2021-05-14 22:11:49] [INFO ] Deduced a trap composed of 52 places in 224 ms of which 0 ms to minimize.
[2021-05-14 22:11:49] [INFO ] Deduced a trap composed of 27 places in 216 ms of which 0 ms to minimize.
[2021-05-14 22:11:50] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 1 ms to minimize.
[2021-05-14 22:11:50] [INFO ] Deduced a trap composed of 68 places in 216 ms of which 1 ms to minimize.
[2021-05-14 22:11:50] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 0 ms to minimize.
[2021-05-14 22:11:50] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 1 ms to minimize.
[2021-05-14 22:11:51] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 1 ms to minimize.
[2021-05-14 22:11:51] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 0 ms to minimize.
[2021-05-14 22:11:51] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 1 ms to minimize.
[2021-05-14 22:11:51] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 0 ms to minimize.
[2021-05-14 22:11:52] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 0 ms to minimize.
[2021-05-14 22:11:52] [INFO ] Deduced a trap composed of 44 places in 218 ms of which 1 ms to minimize.
[2021-05-14 22:11:52] [INFO ] Deduced a trap composed of 44 places in 219 ms of which 1 ms to minimize.
[2021-05-14 22:11:52] [INFO ] Deduced a trap composed of 71 places in 210 ms of which 1 ms to minimize.
[2021-05-14 22:11:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 590 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 590/590 places, 1701/1701 transitions.
Reduce places removed 1 places and 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 589 transition count 1697
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 587 transition count 1697
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 5 place count 587 transition count 1694
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 11 place count 584 transition count 1694
Applied a total of 11 rules in 49 ms. Remains 584 /590 variables (removed 6) and now considering 1694/1701 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 584/590 places, 1694/1701 transitions.
Normalized transition count is 1358 out of 1694 initially.
// Phase 1: matrix 1358 rows 584 cols
[2021-05-14 22:11:53] [INFO ] Computed 23 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3294 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 711 ms. (steps per millisecond=1406 ) properties (out of 1) seen :0
[2021-05-14 22:11:57] [INFO ] Flow matrix only has 1358 transitions (discarded 336 similar events)
// Phase 1: matrix 1358 rows 584 cols
[2021-05-14 22:11:57] [INFO ] Computed 23 place invariants in 8 ms
[2021-05-14 22:11:57] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2021-05-14 22:11:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:11:57] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2021-05-14 22:11:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:11:57] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2021-05-14 22:11:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:11:57] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2021-05-14 22:11:57] [INFO ] State equation strengthened by 545 read => feed constraints.
[2021-05-14 22:11:57] [INFO ] [Nat]Added 545 Read/Feed constraints in 64 ms returned sat
[2021-05-14 22:11:58] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 1 ms to minimize.
[2021-05-14 22:11:58] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 0 ms to minimize.
[2021-05-14 22:11:58] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 0 ms to minimize.
[2021-05-14 22:11:58] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 0 ms to minimize.
[2021-05-14 22:11:59] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 0 ms to minimize.
[2021-05-14 22:11:59] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 1 ms to minimize.
[2021-05-14 22:11:59] [INFO ] Deduced a trap composed of 20 places in 214 ms of which 1 ms to minimize.
[2021-05-14 22:11:59] [INFO ] Deduced a trap composed of 20 places in 213 ms of which 1 ms to minimize.
[2021-05-14 22:12:00] [INFO ] Deduced a trap composed of 70 places in 214 ms of which 0 ms to minimize.
[2021-05-14 22:12:00] [INFO ] Deduced a trap composed of 29 places in 177 ms of which 1 ms to minimize.
[2021-05-14 22:12:00] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 1 ms to minimize.
[2021-05-14 22:12:00] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 0 ms to minimize.
[2021-05-14 22:12:01] [INFO ] Deduced a trap composed of 29 places in 189 ms of which 0 ms to minimize.
[2021-05-14 22:12:01] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 0 ms to minimize.
[2021-05-14 22:12:01] [INFO ] Deduced a trap composed of 29 places in 189 ms of which 1 ms to minimize.
[2021-05-14 22:12:01] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 0 ms to minimize.
[2021-05-14 22:12:01] [INFO ] Deduced a trap composed of 48 places in 178 ms of which 0 ms to minimize.
[2021-05-14 22:12:02] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 1 ms to minimize.
[2021-05-14 22:12:02] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 0 ms to minimize.
[2021-05-14 22:12:02] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 0 ms to minimize.
[2021-05-14 22:12:02] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 1 ms to minimize.
[2021-05-14 22:12:03] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 1 ms to minimize.
[2021-05-14 22:12:03] [INFO ] Deduced a trap composed of 43 places in 211 ms of which 0 ms to minimize.
[2021-05-14 22:12:03] [INFO ] Deduced a trap composed of 29 places in 210 ms of which 0 ms to minimize.
[2021-05-14 22:12:03] [INFO ] Deduced a trap composed of 56 places in 171 ms of which 1 ms to minimize.
[2021-05-14 22:12:03] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 1 ms to minimize.
[2021-05-14 22:12:04] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 1 ms to minimize.
[2021-05-14 22:12:04] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 1 ms to minimize.
[2021-05-14 22:12:04] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 0 ms to minimize.
[2021-05-14 22:12:04] [INFO ] Deduced a trap composed of 56 places in 145 ms of which 0 ms to minimize.
[2021-05-14 22:12:04] [INFO ] Deduced a trap composed of 47 places in 148 ms of which 0 ms to minimize.
[2021-05-14 22:12:05] [INFO ] Deduced a trap composed of 52 places in 148 ms of which 0 ms to minimize.
[2021-05-14 22:12:05] [INFO ] Deduced a trap composed of 38 places in 206 ms of which 1 ms to minimize.
[2021-05-14 22:12:05] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 1 ms to minimize.
[2021-05-14 22:12:05] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 1 ms to minimize.
[2021-05-14 22:12:06] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 1 ms to minimize.
[2021-05-14 22:12:06] [INFO ] Deduced a trap composed of 66 places in 184 ms of which 0 ms to minimize.
[2021-05-14 22:12:06] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 0 ms to minimize.
[2021-05-14 22:12:06] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 1 ms to minimize.
[2021-05-14 22:12:06] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 0 ms to minimize.
[2021-05-14 22:12:07] [INFO ] Deduced a trap composed of 54 places in 146 ms of which 0 ms to minimize.
[2021-05-14 22:12:07] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 1 ms to minimize.
[2021-05-14 22:12:07] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 1 ms to minimize.
[2021-05-14 22:12:07] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 0 ms to minimize.
[2021-05-14 22:12:07] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 0 ms to minimize.
[2021-05-14 22:12:08] [INFO ] Deduced a trap composed of 62 places in 138 ms of which 0 ms to minimize.
[2021-05-14 22:12:08] [INFO ] Deduced a trap composed of 53 places in 145 ms of which 0 ms to minimize.
[2021-05-14 22:12:08] [INFO ] Deduced a trap composed of 53 places in 141 ms of which 0 ms to minimize.
[2021-05-14 22:12:08] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 1 ms to minimize.
[2021-05-14 22:12:08] [INFO ] Deduced a trap composed of 53 places in 139 ms of which 1 ms to minimize.
[2021-05-14 22:12:08] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 0 ms to minimize.
[2021-05-14 22:12:09] [INFO ] Deduced a trap composed of 12 places in 218 ms of which 1 ms to minimize.
[2021-05-14 22:12:09] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 0 ms to minimize.
[2021-05-14 22:12:09] [INFO ] Deduced a trap composed of 54 places in 198 ms of which 0 ms to minimize.
[2021-05-14 22:12:09] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 0 ms to minimize.
[2021-05-14 22:12:10] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 1 ms to minimize.
[2021-05-14 22:12:10] [INFO ] Deduced a trap composed of 73 places in 208 ms of which 0 ms to minimize.
[2021-05-14 22:12:10] [INFO ] Deduced a trap composed of 39 places in 231 ms of which 1 ms to minimize.
[2021-05-14 22:12:10] [INFO ] Deduced a trap composed of 57 places in 222 ms of which 1 ms to minimize.
[2021-05-14 22:12:11] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 0 ms to minimize.
[2021-05-14 22:12:11] [INFO ] Deduced a trap composed of 72 places in 197 ms of which 1 ms to minimize.
[2021-05-14 22:12:11] [INFO ] Deduced a trap composed of 51 places in 185 ms of which 0 ms to minimize.
[2021-05-14 22:12:11] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 0 ms to minimize.
[2021-05-14 22:12:12] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 1 ms to minimize.
[2021-05-14 22:12:12] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 1 ms to minimize.
[2021-05-14 22:12:12] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 0 ms to minimize.
[2021-05-14 22:12:12] [INFO ] Deduced a trap composed of 51 places in 140 ms of which 1 ms to minimize.
[2021-05-14 22:12:12] [INFO ] Trap strengthening (SAT) tested/added 68/67 trap constraints in 15023 ms
[2021-05-14 22:12:12] [INFO ] Computed and/alt/rep : 1238/4765/1238 causal constraints (skipped 112 transitions) in 72 ms.
[2021-05-14 22:12:24] [INFO ] Deduced a trap composed of 22 places in 224 ms of which 1 ms to minimize.
[2021-05-14 22:12:24] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 1 ms to minimize.
[2021-05-14 22:12:24] [INFO ] Deduced a trap composed of 47 places in 226 ms of which 1 ms to minimize.
[2021-05-14 22:12:24] [INFO ] Deduced a trap composed of 47 places in 197 ms of which 1 ms to minimize.
[2021-05-14 22:12:25] [INFO ] Deduced a trap composed of 47 places in 216 ms of which 0 ms to minimize.
[2021-05-14 22:12:25] [INFO ] Deduced a trap composed of 65 places in 188 ms of which 0 ms to minimize.
[2021-05-14 22:12:25] [INFO ] Deduced a trap composed of 31 places in 220 ms of which 0 ms to minimize.
[2021-05-14 22:12:26] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 0 ms to minimize.
[2021-05-14 22:12:26] [INFO ] Deduced a trap composed of 43 places in 195 ms of which 0 ms to minimize.
[2021-05-14 22:12:26] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 1 ms to minimize.
[2021-05-14 22:12:26] [INFO ] Deduced a trap composed of 50 places in 177 ms of which 1 ms to minimize.
[2021-05-14 22:12:27] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 1 ms to minimize.
[2021-05-14 22:12:27] [INFO ] Deduced a trap composed of 51 places in 177 ms of which 1 ms to minimize.
[2021-05-14 22:12:27] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 0 ms to minimize.
[2021-05-14 22:12:27] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 1 ms to minimize.
[2021-05-14 22:12:28] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 1 ms to minimize.
[2021-05-14 22:12:29] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 0 ms to minimize.
[2021-05-14 22:12:29] [INFO ] Deduced a trap composed of 51 places in 180 ms of which 0 ms to minimize.
[2021-05-14 22:12:29] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 1 ms to minimize.
[2021-05-14 22:12:29] [INFO ] Deduced a trap composed of 41 places in 187 ms of which 0 ms to minimize.
[2021-05-14 22:12:30] [INFO ] Deduced a trap composed of 80 places in 188 ms of which 0 ms to minimize.
[2021-05-14 22:12:30] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 0 ms to minimize.
[2021-05-14 22:12:30] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 6806 ms
[2021-05-14 22:12:30] [INFO ] Added : 754 causal constraints over 152 iterations in 17933 ms. Result :sat
Minimization took 652 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 239100 steps, including 1000 resets, run finished after 667 ms. (steps per millisecond=358 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 584 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 584/584 places, 1694/1694 transitions.
Applied a total of 0 rules in 23 ms. Remains 584 /584 variables (removed 0) and now considering 1694/1694 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 584/584 places, 1694/1694 transitions.
Starting structural reductions, iteration 0 : 584/584 places, 1694/1694 transitions.
Applied a total of 0 rules in 22 ms. Remains 584 /584 variables (removed 0) and now considering 1694/1694 (removed 0) transitions.
[2021-05-14 22:12:32] [INFO ] Flow matrix only has 1358 transitions (discarded 336 similar events)
// Phase 1: matrix 1358 rows 584 cols
[2021-05-14 22:12:32] [INFO ] Computed 23 place invariants in 3 ms
[2021-05-14 22:12:32] [INFO ] Implicit Places using invariants in 400 ms returned []
[2021-05-14 22:12:32] [INFO ] Flow matrix only has 1358 transitions (discarded 336 similar events)
// Phase 1: matrix 1358 rows 584 cols
[2021-05-14 22:12:32] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-14 22:12:32] [INFO ] State equation strengthened by 545 read => feed constraints.
[2021-05-14 22:12:37] [INFO ] Implicit Places using invariants and state equation in 4657 ms returned []
Implicit Place search using SMT with State Equation took 5071 ms to find 0 implicit places.
[2021-05-14 22:12:37] [INFO ] Redundant transitions in 24 ms returned []
[2021-05-14 22:12:37] [INFO ] Flow matrix only has 1358 transitions (discarded 336 similar events)
// Phase 1: matrix 1358 rows 584 cols
[2021-05-14 22:12:37] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-14 22:12:37] [INFO ] Dead Transitions using invariants and state equation in 644 ms returned []
Finished structural reductions, in 1 iterations. Remains : 584/584 places, 1694/1694 transitions.
Ending property specific reduction for Peterson-PT-7-UpperBounds-09 in 52004 ms.
Starting property specific reduction for Peterson-PT-7-UpperBounds-11
Normalized transition count is 1366 out of 1702 initially.
// Phase 1: matrix 1366 rows 590 cols
[2021-05-14 22:12:37] [INFO ] Computed 23 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2021-05-14 22:12:38] [INFO ] Flow matrix only has 1366 transitions (discarded 336 similar events)
// Phase 1: matrix 1366 rows 590 cols
[2021-05-14 22:12:38] [INFO ] Computed 23 place invariants in 3 ms
[2021-05-14 22:12:38] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2021-05-14 22:12:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:12:38] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2021-05-14 22:12:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:12:38] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2021-05-14 22:12:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:12:38] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2021-05-14 22:12:38] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 22:12:38] [INFO ] [Nat]Added 546 Read/Feed constraints in 90 ms returned sat
[2021-05-14 22:12:39] [INFO ] Deduced a trap composed of 30 places in 480 ms of which 1 ms to minimize.
[2021-05-14 22:12:39] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 1 ms to minimize.
[2021-05-14 22:12:39] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 0 ms to minimize.
[2021-05-14 22:12:40] [INFO ] Deduced a trap composed of 25 places in 239 ms of which 1 ms to minimize.
[2021-05-14 22:12:40] [INFO ] Deduced a trap composed of 87 places in 207 ms of which 0 ms to minimize.
[2021-05-14 22:12:40] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 0 ms to minimize.
[2021-05-14 22:12:40] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 1 ms to minimize.
[2021-05-14 22:12:41] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 1 ms to minimize.
[2021-05-14 22:12:41] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 0 ms to minimize.
[2021-05-14 22:12:41] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 0 ms to minimize.
[2021-05-14 22:12:41] [INFO ] Deduced a trap composed of 44 places in 208 ms of which 1 ms to minimize.
[2021-05-14 22:12:41] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 0 ms to minimize.
[2021-05-14 22:12:42] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 0 ms to minimize.
[2021-05-14 22:12:42] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 0 ms to minimize.
[2021-05-14 22:12:42] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 1 ms to minimize.
[2021-05-14 22:12:42] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 1 ms to minimize.
[2021-05-14 22:12:43] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 0 ms to minimize.
[2021-05-14 22:12:43] [INFO ] Deduced a trap composed of 11 places in 227 ms of which 1 ms to minimize.
[2021-05-14 22:12:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 590 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 590/590 places, 1701/1701 transitions.
Reduce places removed 1 places and 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 589 transition count 1698
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 587 transition count 1696
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 586 transition count 1694
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6 place count 585 transition count 1692
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7 place count 584 transition count 1690
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 7 place count 584 transition count 1687
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 13 place count 581 transition count 1687
Applied a total of 13 rules in 46 ms. Remains 581 /590 variables (removed 9) and now considering 1687/1701 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 581/590 places, 1687/1701 transitions.
Normalized transition count is 1351 out of 1687 initially.
// Phase 1: matrix 1351 rows 581 cols
[2021-05-14 22:12:43] [INFO ] Computed 23 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2958 ms. (steps per millisecond=338 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 669 ms. (steps per millisecond=1494 ) properties (out of 1) seen :0
[2021-05-14 22:12:47] [INFO ] Flow matrix only has 1351 transitions (discarded 336 similar events)
// Phase 1: matrix 1351 rows 581 cols
[2021-05-14 22:12:47] [INFO ] Computed 23 place invariants in 3 ms
[2021-05-14 22:12:47] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2021-05-14 22:12:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:12:47] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2021-05-14 22:12:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:12:47] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2021-05-14 22:12:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:12:47] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2021-05-14 22:12:47] [INFO ] State equation strengthened by 541 read => feed constraints.
[2021-05-14 22:12:47] [INFO ] [Nat]Added 541 Read/Feed constraints in 68 ms returned sat
[2021-05-14 22:12:48] [INFO ] Deduced a trap composed of 12 places in 239 ms of which 0 ms to minimize.
[2021-05-14 22:12:48] [INFO ] Deduced a trap composed of 14 places in 237 ms of which 1 ms to minimize.
[2021-05-14 22:12:48] [INFO ] Deduced a trap composed of 16 places in 240 ms of which 1 ms to minimize.
[2021-05-14 22:12:49] [INFO ] Deduced a trap composed of 24 places in 240 ms of which 0 ms to minimize.
[2021-05-14 22:12:49] [INFO ] Deduced a trap composed of 103 places in 210 ms of which 1 ms to minimize.
[2021-05-14 22:12:49] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 1 ms to minimize.
[2021-05-14 22:12:49] [INFO ] Deduced a trap composed of 70 places in 201 ms of which 0 ms to minimize.
[2021-05-14 22:12:50] [INFO ] Deduced a trap composed of 69 places in 211 ms of which 0 ms to minimize.
[2021-05-14 22:12:50] [INFO ] Deduced a trap composed of 52 places in 215 ms of which 0 ms to minimize.
[2021-05-14 22:12:50] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 0 ms to minimize.
[2021-05-14 22:12:50] [INFO ] Deduced a trap composed of 51 places in 192 ms of which 1 ms to minimize.
[2021-05-14 22:12:51] [INFO ] Deduced a trap composed of 51 places in 219 ms of which 1 ms to minimize.
[2021-05-14 22:12:51] [INFO ] Deduced a trap composed of 68 places in 204 ms of which 0 ms to minimize.
[2021-05-14 22:12:51] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 1 ms to minimize.
[2021-05-14 22:12:51] [INFO ] Deduced a trap composed of 51 places in 219 ms of which 0 ms to minimize.
[2021-05-14 22:12:52] [INFO ] Deduced a trap composed of 90 places in 192 ms of which 1 ms to minimize.
[2021-05-14 22:12:52] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 0 ms to minimize.
[2021-05-14 22:12:52] [INFO ] Deduced a trap composed of 51 places in 199 ms of which 1 ms to minimize.
[2021-05-14 22:12:52] [INFO ] Deduced a trap composed of 52 places in 190 ms of which 0 ms to minimize.
[2021-05-14 22:12:53] [INFO ] Deduced a trap composed of 42 places in 191 ms of which 1 ms to minimize.
[2021-05-14 22:12:53] [INFO ] Deduced a trap composed of 34 places in 192 ms of which 0 ms to minimize.
[2021-05-14 22:12:53] [INFO ] Deduced a trap composed of 105 places in 221 ms of which 1 ms to minimize.
[2021-05-14 22:12:53] [INFO ] Deduced a trap composed of 130 places in 206 ms of which 0 ms to minimize.
[2021-05-14 22:12:54] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 0 ms to minimize.
[2021-05-14 22:12:54] [INFO ] Deduced a trap composed of 61 places in 204 ms of which 1 ms to minimize.
[2021-05-14 22:12:54] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 1 ms to minimize.
[2021-05-14 22:12:54] [INFO ] Deduced a trap composed of 69 places in 219 ms of which 0 ms to minimize.
[2021-05-14 22:12:55] [INFO ] Deduced a trap composed of 34 places in 210 ms of which 1 ms to minimize.
[2021-05-14 22:12:55] [INFO ] Deduced a trap composed of 69 places in 213 ms of which 1 ms to minimize.
[2021-05-14 22:12:55] [INFO ] Deduced a trap composed of 69 places in 209 ms of which 1 ms to minimize.
[2021-05-14 22:12:55] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 7586 ms
[2021-05-14 22:12:55] [INFO ] Computed and/alt/rep : 1231/4754/1231 causal constraints (skipped 112 transitions) in 84 ms.
[2021-05-14 22:13:02] [INFO ] Deduced a trap composed of 22 places in 201 ms of which 1 ms to minimize.
[2021-05-14 22:13:02] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 1 ms to minimize.
[2021-05-14 22:13:03] [INFO ] Deduced a trap composed of 117 places in 197 ms of which 0 ms to minimize.
[2021-05-14 22:13:03] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 1 ms to minimize.
[2021-05-14 22:13:03] [INFO ] Deduced a trap composed of 59 places in 185 ms of which 0 ms to minimize.
[2021-05-14 22:13:04] [INFO ] Deduced a trap composed of 54 places in 200 ms of which 0 ms to minimize.
[2021-05-14 22:13:04] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 0 ms to minimize.
[2021-05-14 22:13:04] [INFO ] Deduced a trap composed of 39 places in 199 ms of which 0 ms to minimize.
[2021-05-14 22:13:04] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 0 ms to minimize.
[2021-05-14 22:13:05] [INFO ] Deduced a trap composed of 40 places in 191 ms of which 0 ms to minimize.
[2021-05-14 22:13:05] [INFO ] Deduced a trap composed of 58 places in 223 ms of which 0 ms to minimize.
[2021-05-14 22:13:05] [INFO ] Deduced a trap composed of 77 places in 207 ms of which 1 ms to minimize.
[2021-05-14 22:13:05] [INFO ] Deduced a trap composed of 61 places in 214 ms of which 1 ms to minimize.
[2021-05-14 22:13:06] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 1 ms to minimize.
[2021-05-14 22:13:06] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 1 ms to minimize.
[2021-05-14 22:13:07] [INFO ] Deduced a trap composed of 42 places in 241 ms of which 0 ms to minimize.
[2021-05-14 22:13:07] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 0 ms to minimize.
[2021-05-14 22:13:07] [INFO ] Deduced a trap composed of 29 places in 220 ms of which 1 ms to minimize.
[2021-05-14 22:13:07] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 0 ms to minimize.
[2021-05-14 22:13:08] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5582 ms
[2021-05-14 22:13:08] [INFO ] Deduced a trap composed of 29 places in 219 ms of which 1 ms to minimize.
[2021-05-14 22:13:08] [INFO ] Deduced a trap composed of 29 places in 223 ms of which 0 ms to minimize.
[2021-05-14 22:13:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 643 ms
[2021-05-14 22:13:08] [INFO ] Added : 508 causal constraints over 103 iterations in 13323 ms. Result :sat
Minimization took 327 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 209100 steps, including 1000 resets, run finished after 568 ms. (steps per millisecond=368 ) properties (out of 1) seen :1 could not realise parikh vector
FORMULA Peterson-PT-7-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Ending property specific reduction for Peterson-PT-7-UpperBounds-11 in 31890 ms.
Starting property specific reduction for Peterson-PT-7-UpperBounds-12
Normalized transition count is 1366 out of 1702 initially.
// Phase 1: matrix 1366 rows 590 cols
[2021-05-14 22:13:09] [INFO ] Computed 23 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2021-05-14 22:13:09] [INFO ] Flow matrix only has 1366 transitions (discarded 336 similar events)
// Phase 1: matrix 1366 rows 590 cols
[2021-05-14 22:13:09] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-14 22:13:09] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2021-05-14 22:13:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:13:10] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2021-05-14 22:13:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:13:10] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2021-05-14 22:13:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:13:10] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2021-05-14 22:13:10] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 22:13:10] [INFO ] [Nat]Added 546 Read/Feed constraints in 74 ms returned sat
[2021-05-14 22:13:10] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 0 ms to minimize.
[2021-05-14 22:13:11] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 0 ms to minimize.
[2021-05-14 22:13:11] [INFO ] Deduced a trap composed of 39 places in 223 ms of which 0 ms to minimize.
[2021-05-14 22:13:11] [INFO ] Deduced a trap composed of 13 places in 227 ms of which 1 ms to minimize.
[2021-05-14 22:13:12] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 0 ms to minimize.
[2021-05-14 22:13:12] [INFO ] Deduced a trap composed of 14 places in 229 ms of which 1 ms to minimize.
[2021-05-14 22:13:12] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 1 ms to minimize.
[2021-05-14 22:13:12] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 0 ms to minimize.
[2021-05-14 22:13:13] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 1 ms to minimize.
[2021-05-14 22:13:13] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 0 ms to minimize.
[2021-05-14 22:13:13] [INFO ] Deduced a trap composed of 59 places in 218 ms of which 0 ms to minimize.
[2021-05-14 22:13:13] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 0 ms to minimize.
[2021-05-14 22:13:14] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 0 ms to minimize.
[2021-05-14 22:13:14] [INFO ] Deduced a trap composed of 48 places in 219 ms of which 0 ms to minimize.
[2021-05-14 22:13:14] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 0 ms to minimize.
[2021-05-14 22:13:14] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 0 ms to minimize.
[2021-05-14 22:13:15] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 1 ms to minimize.
[2021-05-14 22:13:15] [INFO ] Deduced a trap composed of 39 places in 226 ms of which 0 ms to minimize.
[2021-05-14 22:13:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 590 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 590/590 places, 1701/1701 transitions.
Reduce places removed 1 places and 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 589 transition count 1698
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 587 transition count 1696
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 586 transition count 1694
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6 place count 585 transition count 1692
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7 place count 584 transition count 1691
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 8 place count 583 transition count 1689
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 8 place count 583 transition count 1687
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 12 place count 581 transition count 1687
Applied a total of 12 rules in 69 ms. Remains 581 /590 variables (removed 9) and now considering 1687/1701 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 581/590 places, 1687/1701 transitions.
Normalized transition count is 1351 out of 1687 initially.
// Phase 1: matrix 1351 rows 581 cols
[2021-05-14 22:13:15] [INFO ] Computed 23 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2954 ms. (steps per millisecond=338 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 676 ms. (steps per millisecond=1479 ) properties (out of 1) seen :0
[2021-05-14 22:13:19] [INFO ] Flow matrix only has 1351 transitions (discarded 336 similar events)
// Phase 1: matrix 1351 rows 581 cols
[2021-05-14 22:13:19] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-14 22:13:19] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2021-05-14 22:13:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:13:19] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2021-05-14 22:13:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:13:19] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2021-05-14 22:13:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:13:19] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2021-05-14 22:13:19] [INFO ] State equation strengthened by 541 read => feed constraints.
[2021-05-14 22:13:20] [INFO ] [Nat]Added 541 Read/Feed constraints in 64 ms returned sat
[2021-05-14 22:13:20] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 0 ms to minimize.
[2021-05-14 22:13:20] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 0 ms to minimize.
[2021-05-14 22:13:20] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 0 ms to minimize.
[2021-05-14 22:13:20] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 1 ms to minimize.
[2021-05-14 22:13:21] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 0 ms to minimize.
[2021-05-14 22:13:21] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 1 ms to minimize.
[2021-05-14 22:13:21] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 0 ms to minimize.
[2021-05-14 22:13:21] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 1 ms to minimize.
[2021-05-14 22:13:22] [INFO ] Deduced a trap composed of 56 places in 195 ms of which 0 ms to minimize.
[2021-05-14 22:13:22] [INFO ] Deduced a trap composed of 41 places in 195 ms of which 0 ms to minimize.
[2021-05-14 22:13:22] [INFO ] Deduced a trap composed of 43 places in 197 ms of which 1 ms to minimize.
[2021-05-14 22:13:22] [INFO ] Deduced a trap composed of 52 places in 194 ms of which 0 ms to minimize.
[2021-05-14 22:13:22] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 1 ms to minimize.
[2021-05-14 22:13:23] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 0 ms to minimize.
[2021-05-14 22:13:23] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 0 ms to minimize.
[2021-05-14 22:13:23] [INFO ] Deduced a trap composed of 50 places in 194 ms of which 0 ms to minimize.
[2021-05-14 22:13:23] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 1 ms to minimize.
[2021-05-14 22:13:24] [INFO ] Deduced a trap composed of 53 places in 196 ms of which 0 ms to minimize.
[2021-05-14 22:13:24] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 1 ms to minimize.
[2021-05-14 22:13:24] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 0 ms to minimize.
[2021-05-14 22:13:24] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 1 ms to minimize.
[2021-05-14 22:13:25] [INFO ] Deduced a trap composed of 75 places in 200 ms of which 0 ms to minimize.
[2021-05-14 22:13:25] [INFO ] Deduced a trap composed of 56 places in 189 ms of which 0 ms to minimize.
[2021-05-14 22:13:25] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 0 ms to minimize.
[2021-05-14 22:13:25] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 0 ms to minimize.
[2021-05-14 22:13:26] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 0 ms to minimize.
[2021-05-14 22:13:26] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 1 ms to minimize.
[2021-05-14 22:13:26] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 0 ms to minimize.
[2021-05-14 22:13:26] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 0 ms to minimize.
[2021-05-14 22:13:26] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 0 ms to minimize.
[2021-05-14 22:13:27] [INFO ] Deduced a trap composed of 20 places in 170 ms of which 0 ms to minimize.
[2021-05-14 22:13:27] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 0 ms to minimize.
[2021-05-14 22:13:27] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 0 ms to minimize.
[2021-05-14 22:13:27] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 1 ms to minimize.
[2021-05-14 22:13:28] [INFO ] Deduced a trap composed of 12 places in 206 ms of which 2 ms to minimize.
[2021-05-14 22:13:28] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 1 ms to minimize.
[2021-05-14 22:13:28] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 1 ms to minimize.
[2021-05-14 22:13:28] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 1 ms to minimize.
[2021-05-14 22:13:29] [INFO ] Deduced a trap composed of 60 places in 179 ms of which 1 ms to minimize.
[2021-05-14 22:13:29] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 1 ms to minimize.
[2021-05-14 22:13:29] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 0 ms to minimize.
[2021-05-14 22:13:29] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 0 ms to minimize.
[2021-05-14 22:13:29] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 0 ms to minimize.
[2021-05-14 22:13:29] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 9957 ms
[2021-05-14 22:13:30] [INFO ] Computed and/alt/rep : 1231/4754/1231 causal constraints (skipped 112 transitions) in 72 ms.
[2021-05-14 22:13:42] [INFO ] Deduced a trap composed of 33 places in 216 ms of which 1 ms to minimize.
[2021-05-14 22:13:43] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 0 ms to minimize.
[2021-05-14 22:13:43] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 1 ms to minimize.
[2021-05-14 22:13:43] [INFO ] Deduced a trap composed of 22 places in 219 ms of which 1 ms to minimize.
[2021-05-14 22:13:44] [INFO ] Deduced a trap composed of 53 places in 221 ms of which 1 ms to minimize.
[2021-05-14 22:13:44] [INFO ] Deduced a trap composed of 23 places in 235 ms of which 0 ms to minimize.
[2021-05-14 22:13:44] [INFO ] Deduced a trap composed of 24 places in 203 ms of which 0 ms to minimize.
[2021-05-14 22:13:44] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 0 ms to minimize.
[2021-05-14 22:13:45] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 1 ms to minimize.
[2021-05-14 22:13:45] [INFO ] Deduced a trap composed of 25 places in 248 ms of which 0 ms to minimize.
[2021-05-14 22:13:45] [INFO ] Deduced a trap composed of 44 places in 218 ms of which 0 ms to minimize.
[2021-05-14 22:13:46] [INFO ] Deduced a trap composed of 62 places in 178 ms of which 1 ms to minimize.
[2021-05-14 22:13:46] [INFO ] Deduced a trap composed of 53 places in 167 ms of which 1 ms to minimize.
[2021-05-14 22:13:46] [INFO ] Deduced a trap composed of 40 places in 188 ms of which 0 ms to minimize.
[2021-05-14 22:13:47] [INFO ] Deduced a trap composed of 90 places in 186 ms of which 1 ms to minimize.
[2021-05-14 22:13:47] [INFO ] Deduced a trap composed of 53 places in 131 ms of which 1 ms to minimize.
[2021-05-14 22:13:47] [INFO ] Deduced a trap composed of 52 places in 174 ms of which 0 ms to minimize.
[2021-05-14 22:13:48] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 2 ms to minimize.
[2021-05-14 22:13:48] [INFO ] Deduced a trap composed of 68 places in 212 ms of which 0 ms to minimize.
[2021-05-14 22:13:48] [INFO ] Deduced a trap composed of 62 places in 153 ms of which 0 ms to minimize.
[2021-05-14 22:13:48] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 0 ms to minimize.
[2021-05-14 22:13:49] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 0 ms to minimize.
[2021-05-14 22:13:49] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 0 ms to minimize.
[2021-05-14 22:13:49] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 1 ms to minimize.
[2021-05-14 22:13:49] [INFO ] Deduced a trap composed of 62 places in 124 ms of which 0 ms to minimize.
[2021-05-14 22:13:50] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 1 ms to minimize.
[2021-05-14 22:13:50] [INFO ] Deduced a trap composed of 29 places in 185 ms of which 0 ms to minimize.
[2021-05-14 22:13:50] [INFO ] Deduced a trap composed of 70 places in 158 ms of which 0 ms to minimize.
[2021-05-14 22:13:50] [INFO ] Deduced a trap composed of 53 places in 142 ms of which 0 ms to minimize.
[2021-05-14 22:13:51] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 0 ms to minimize.
[2021-05-14 22:13:51] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 1 ms to minimize.
[2021-05-14 22:13:52] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 1 ms to minimize.
[2021-05-14 22:13:52] [INFO ] Deduced a trap composed of 58 places in 143 ms of which 0 ms to minimize.
[2021-05-14 22:13:52] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 0 ms to minimize.
[2021-05-14 22:13:52] [INFO ] Deduced a trap composed of 102 places in 139 ms of which 1 ms to minimize.
[2021-05-14 22:13:53] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 0 ms to minimize.
[2021-05-14 22:13:53] [INFO ] Deduced a trap composed of 62 places in 138 ms of which 0 ms to minimize.
[2021-05-14 22:13:53] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 1 ms to minimize.
[2021-05-14 22:13:53] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 11232 ms
[2021-05-14 22:13:53] [INFO ] Added : 861 causal constraints over 173 iterations in 23954 ms.(timeout) Result :sat
Minimization took 622 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 107400 steps, including 1000 resets, run finished after 346 ms. (steps per millisecond=310 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 581/581 places, 1687/1687 transitions.
Applied a total of 0 rules in 23 ms. Remains 581 /581 variables (removed 0) and now considering 1687/1687 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1687/1687 transitions.
Starting structural reductions, iteration 0 : 581/581 places, 1687/1687 transitions.
Applied a total of 0 rules in 23 ms. Remains 581 /581 variables (removed 0) and now considering 1687/1687 (removed 0) transitions.
[2021-05-14 22:13:55] [INFO ] Flow matrix only has 1351 transitions (discarded 336 similar events)
// Phase 1: matrix 1351 rows 581 cols
[2021-05-14 22:13:55] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-14 22:13:55] [INFO ] Implicit Places using invariants in 398 ms returned []
[2021-05-14 22:13:55] [INFO ] Flow matrix only has 1351 transitions (discarded 336 similar events)
// Phase 1: matrix 1351 rows 581 cols
[2021-05-14 22:13:55] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-14 22:13:55] [INFO ] State equation strengthened by 541 read => feed constraints.
[2021-05-14 22:13:59] [INFO ] Implicit Places using invariants and state equation in 3968 ms returned []
Implicit Place search using SMT with State Equation took 4367 ms to find 0 implicit places.
[2021-05-14 22:13:59] [INFO ] Redundant transitions in 260 ms returned []
[2021-05-14 22:13:59] [INFO ] Flow matrix only has 1351 transitions (discarded 336 similar events)
// Phase 1: matrix 1351 rows 581 cols
[2021-05-14 22:13:59] [INFO ] Computed 23 place invariants in 3 ms
[2021-05-14 22:14:00] [INFO ] Dead Transitions using invariants and state equation in 714 ms returned []
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1687/1687 transitions.
Ending property specific reduction for Peterson-PT-7-UpperBounds-12 in 50538 ms.
Starting property specific reduction for Peterson-PT-7-UpperBounds-14
Normalized transition count is 1366 out of 1702 initially.
// Phase 1: matrix 1366 rows 590 cols
[2021-05-14 22:14:00] [INFO ] Computed 23 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2021-05-14 22:14:00] [INFO ] Flow matrix only has 1366 transitions (discarded 336 similar events)
// Phase 1: matrix 1366 rows 590 cols
[2021-05-14 22:14:00] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-14 22:14:00] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2021-05-14 22:14:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:14:00] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2021-05-14 22:14:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:14:01] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2021-05-14 22:14:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:14:01] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2021-05-14 22:14:01] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 22:14:01] [INFO ] [Nat]Added 546 Read/Feed constraints in 66 ms returned sat
[2021-05-14 22:14:01] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 0 ms to minimize.
[2021-05-14 22:14:01] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 1 ms to minimize.
[2021-05-14 22:14:02] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 0 ms to minimize.
[2021-05-14 22:14:02] [INFO ] Deduced a trap composed of 16 places in 232 ms of which 1 ms to minimize.
[2021-05-14 22:14:02] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 1 ms to minimize.
[2021-05-14 22:14:02] [INFO ] Deduced a trap composed of 16 places in 230 ms of which 1 ms to minimize.
[2021-05-14 22:14:03] [INFO ] Deduced a trap composed of 16 places in 231 ms of which 0 ms to minimize.
[2021-05-14 22:14:03] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 0 ms to minimize.
[2021-05-14 22:14:03] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 1 ms to minimize.
[2021-05-14 22:14:03] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 0 ms to minimize.
[2021-05-14 22:14:04] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 1 ms to minimize.
[2021-05-14 22:14:04] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 0 ms to minimize.
[2021-05-14 22:14:04] [INFO ] Deduced a trap composed of 59 places in 213 ms of which 1 ms to minimize.
[2021-05-14 22:14:05] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 1 ms to minimize.
[2021-05-14 22:14:05] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 1 ms to minimize.
[2021-05-14 22:14:05] [INFO ] Deduced a trap composed of 46 places in 215 ms of which 1 ms to minimize.
[2021-05-14 22:14:05] [INFO ] Deduced a trap composed of 43 places in 219 ms of which 1 ms to minimize.
[2021-05-14 22:14:06] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 1 ms to minimize.
[2021-05-14 22:14:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 590 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 590/590 places, 1701/1701 transitions.
Reduce places removed 1 places and 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 589 transition count 1697
Reduce places removed 3 places and 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 586 transition count 1695
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 585 transition count 1693
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 7 place count 585 transition count 1690
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 13 place count 582 transition count 1690
Applied a total of 13 rules in 36 ms. Remains 582 /590 variables (removed 8) and now considering 1690/1701 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 582/590 places, 1690/1701 transitions.
Normalized transition count is 1354 out of 1690 initially.
// Phase 1: matrix 1354 rows 582 cols
[2021-05-14 22:14:06] [INFO ] Computed 23 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2976 ms. (steps per millisecond=336 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 679 ms. (steps per millisecond=1472 ) properties (out of 1) seen :0
[2021-05-14 22:14:09] [INFO ] Flow matrix only has 1354 transitions (discarded 336 similar events)
// Phase 1: matrix 1354 rows 582 cols
[2021-05-14 22:14:09] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-14 22:14:09] [INFO ] [Real]Absence check using 23 positive place invariants in 23 ms returned sat
[2021-05-14 22:14:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:14:10] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2021-05-14 22:14:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:14:10] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2021-05-14 22:14:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:14:10] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2021-05-14 22:14:10] [INFO ] State equation strengthened by 543 read => feed constraints.
[2021-05-14 22:14:10] [INFO ] [Nat]Added 543 Read/Feed constraints in 66 ms returned sat
[2021-05-14 22:14:10] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 1 ms to minimize.
[2021-05-14 22:14:11] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 0 ms to minimize.
[2021-05-14 22:14:11] [INFO ] Deduced a trap composed of 22 places in 214 ms of which 0 ms to minimize.
[2021-05-14 22:14:11] [INFO ] Deduced a trap composed of 37 places in 233 ms of which 1 ms to minimize.
[2021-05-14 22:14:11] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 1 ms to minimize.
[2021-05-14 22:14:12] [INFO ] Deduced a trap composed of 55 places in 213 ms of which 1 ms to minimize.
[2021-05-14 22:14:12] [INFO ] Deduced a trap composed of 29 places in 212 ms of which 1 ms to minimize.
[2021-05-14 22:14:12] [INFO ] Deduced a trap composed of 37 places in 201 ms of which 1 ms to minimize.
[2021-05-14 22:14:12] [INFO ] Deduced a trap composed of 51 places in 186 ms of which 0 ms to minimize.
[2021-05-14 22:14:13] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 0 ms to minimize.
[2021-05-14 22:14:13] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 0 ms to minimize.
[2021-05-14 22:14:13] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 1 ms to minimize.
[2021-05-14 22:14:13] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 1 ms to minimize.
[2021-05-14 22:14:13] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 0 ms to minimize.
[2021-05-14 22:14:14] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 0 ms to minimize.
[2021-05-14 22:14:14] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 0 ms to minimize.
[2021-05-14 22:14:14] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 0 ms to minimize.
[2021-05-14 22:14:14] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 1 ms to minimize.
[2021-05-14 22:14:15] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 1 ms to minimize.
[2021-05-14 22:14:15] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 1 ms to minimize.
[2021-05-14 22:14:15] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 0 ms to minimize.
[2021-05-14 22:14:15] [INFO ] Deduced a trap composed of 20 places in 170 ms of which 0 ms to minimize.
[2021-05-14 22:14:15] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 0 ms to minimize.
[2021-05-14 22:14:16] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 0 ms to minimize.
[2021-05-14 22:14:16] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 1 ms to minimize.
[2021-05-14 22:14:16] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 0 ms to minimize.
[2021-05-14 22:14:16] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 0 ms to minimize.
[2021-05-14 22:14:16] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 0 ms to minimize.
[2021-05-14 22:14:17] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 0 ms to minimize.
[2021-05-14 22:14:17] [INFO ] Deduced a trap composed of 55 places in 168 ms of which 1 ms to minimize.
[2021-05-14 22:14:17] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 1 ms to minimize.
[2021-05-14 22:14:17] [INFO ] Deduced a trap composed of 50 places in 174 ms of which 0 ms to minimize.
[2021-05-14 22:14:17] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 1 ms to minimize.
[2021-05-14 22:14:18] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 0 ms to minimize.
[2021-05-14 22:14:18] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 1 ms to minimize.
[2021-05-14 22:14:18] [INFO ] Deduced a trap composed of 50 places in 165 ms of which 0 ms to minimize.
[2021-05-14 22:14:18] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 0 ms to minimize.
[2021-05-14 22:14:18] [INFO ] Deduced a trap composed of 50 places in 167 ms of which 0 ms to minimize.
[2021-05-14 22:14:19] [INFO ] Deduced a trap composed of 50 places in 177 ms of which 0 ms to minimize.
[2021-05-14 22:14:19] [INFO ] Deduced a trap composed of 50 places in 175 ms of which 1 ms to minimize.
[2021-05-14 22:14:19] [INFO ] Deduced a trap composed of 59 places in 171 ms of which 1 ms to minimize.
[2021-05-14 22:14:19] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 0 ms to minimize.
[2021-05-14 22:14:19] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 1 ms to minimize.
[2021-05-14 22:14:20] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 1 ms to minimize.
[2021-05-14 22:14:20] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 0 ms to minimize.
[2021-05-14 22:14:20] [INFO ] Deduced a trap composed of 66 places in 151 ms of which 0 ms to minimize.
[2021-05-14 22:14:20] [INFO ] Deduced a trap composed of 48 places in 150 ms of which 1 ms to minimize.
[2021-05-14 22:14:20] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 0 ms to minimize.
[2021-05-14 22:14:21] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 1 ms to minimize.
[2021-05-14 22:14:21] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 0 ms to minimize.
[2021-05-14 22:14:21] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 1 ms to minimize.
[2021-05-14 22:14:21] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 1 ms to minimize.
[2021-05-14 22:14:21] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 1 ms to minimize.
[2021-05-14 22:14:22] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 0 ms to minimize.
[2021-05-14 22:14:22] [INFO ] Trap strengthening (SAT) tested/added 55/54 trap constraints in 11594 ms
[2021-05-14 22:14:22] [INFO ] Computed and/alt/rep : 1234/4759/1234 causal constraints (skipped 112 transitions) in 88 ms.
[2021-05-14 22:14:28] [INFO ] Deduced a trap composed of 52 places in 207 ms of which 0 ms to minimize.
[2021-05-14 22:14:29] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 1 ms to minimize.
[2021-05-14 22:14:29] [INFO ] Deduced a trap composed of 64 places in 188 ms of which 0 ms to minimize.
[2021-05-14 22:14:29] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 0 ms to minimize.
[2021-05-14 22:14:29] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 1 ms to minimize.
[2021-05-14 22:14:30] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 1 ms to minimize.
[2021-05-14 22:14:30] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 0 ms to minimize.
[2021-05-14 22:14:30] [INFO ] Deduced a trap composed of 42 places in 227 ms of which 0 ms to minimize.
[2021-05-14 22:14:31] [INFO ] Deduced a trap composed of 47 places in 215 ms of which 1 ms to minimize.
[2021-05-14 22:14:31] [INFO ] Deduced a trap composed of 27 places in 223 ms of which 0 ms to minimize.
[2021-05-14 22:14:31] [INFO ] Deduced a trap composed of 40 places in 214 ms of which 0 ms to minimize.
[2021-05-14 22:14:31] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 1 ms to minimize.
[2021-05-14 22:14:32] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 0 ms to minimize.
[2021-05-14 22:14:32] [INFO ] Deduced a trap composed of 47 places in 199 ms of which 0 ms to minimize.
[2021-05-14 22:14:32] [INFO ] Deduced a trap composed of 39 places in 204 ms of which 0 ms to minimize.
[2021-05-14 22:14:33] [INFO ] Deduced a trap composed of 56 places in 208 ms of which 1 ms to minimize.
[2021-05-14 22:14:33] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 1 ms to minimize.
[2021-05-14 22:14:33] [INFO ] Deduced a trap composed of 57 places in 217 ms of which 0 ms to minimize.
[2021-05-14 22:14:33] [INFO ] Deduced a trap composed of 29 places in 221 ms of which 1 ms to minimize.
[2021-05-14 22:14:34] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 1 ms to minimize.
[2021-05-14 22:14:34] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 0 ms to minimize.
[2021-05-14 22:14:34] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 0 ms to minimize.
[2021-05-14 22:14:34] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 6342 ms
[2021-05-14 22:14:35] [INFO ] Added : 487 causal constraints over 99 iterations in 12981 ms. Result :sat
Minimization took 404 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 310000 steps, including 1000 resets, run finished after 837 ms. (steps per millisecond=370 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 582 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 582/582 places, 1690/1690 transitions.
Applied a total of 0 rules in 22 ms. Remains 582 /582 variables (removed 0) and now considering 1690/1690 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 582/582 places, 1690/1690 transitions.
Starting structural reductions, iteration 0 : 582/582 places, 1690/1690 transitions.
Applied a total of 0 rules in 23 ms. Remains 582 /582 variables (removed 0) and now considering 1690/1690 (removed 0) transitions.
[2021-05-14 22:14:36] [INFO ] Flow matrix only has 1354 transitions (discarded 336 similar events)
// Phase 1: matrix 1354 rows 582 cols
[2021-05-14 22:14:36] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-14 22:14:36] [INFO ] Implicit Places using invariants in 400 ms returned []
[2021-05-14 22:14:36] [INFO ] Flow matrix only has 1354 transitions (discarded 336 similar events)
// Phase 1: matrix 1354 rows 582 cols
[2021-05-14 22:14:36] [INFO ] Computed 23 place invariants in 3 ms
[2021-05-14 22:14:37] [INFO ] State equation strengthened by 543 read => feed constraints.
[2021-05-14 22:14:41] [INFO ] Implicit Places using invariants and state equation in 4478 ms returned []
Implicit Place search using SMT with State Equation took 4879 ms to find 0 implicit places.
[2021-05-14 22:14:41] [INFO ] Redundant transitions in 34 ms returned []
[2021-05-14 22:14:41] [INFO ] Flow matrix only has 1354 transitions (discarded 336 similar events)
// Phase 1: matrix 1354 rows 582 cols
[2021-05-14 22:14:41] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-14 22:14:42] [INFO ] Dead Transitions using invariants and state equation in 782 ms returned []
Finished structural reductions, in 1 iterations. Remains : 582/582 places, 1690/1690 transitions.
Ending property specific reduction for Peterson-PT-7-UpperBounds-14 in 41836 ms.
[2021-05-14 22:14:42] [INFO ] Flatten gal took : 157 ms
[2021-05-14 22:14:42] [INFO ] Applying decomposition
[2021-05-14 22:14:42] [INFO ] Flatten gal took : 93 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13932430942610386565.txt, -o, /tmp/graph13932430942610386565.bin, -w, /tmp/graph13932430942610386565.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13932430942610386565.bin, -l, -1, -v, -w, /tmp/graph13932430942610386565.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 22:14:42] [INFO ] Decomposing Gal with order
[2021-05-14 22:14:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 22:14:43] [INFO ] Removed a total of 2508 redundant transitions.
[2021-05-14 22:14:43] [INFO ] Flatten gal took : 274 ms
[2021-05-14 22:14:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 815 labels/synchronizations in 92 ms.
[2021-05-14 22:14:43] [INFO ] Time to serialize gal into /tmp/UpperBounds6851123487508389157.gal : 29 ms
[2021-05-14 22:14:43] [INFO ] Time to serialize properties into /tmp/UpperBounds7827522269084033592.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds6851123487508389157.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds7827522269084033592.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds6851123487508389157.gal -t CGAL -reachable-file /tmp/UpperBounds7827522269084033592.prop --nowitness
Loading property file /tmp/UpperBounds7827522269084033592.prop.
Detected timeout of ITS tools.
[2021-05-14 22:39:47] [INFO ] Applying decomposition
[2021-05-14 22:39:48] [INFO ] Flatten gal took : 440 ms
[2021-05-14 22:39:48] [INFO ] Decomposing Gal with order
[2021-05-14 22:39:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 22:39:49] [INFO ] Removed a total of 2098 redundant transitions.
[2021-05-14 22:39:50] [INFO ] Flatten gal took : 1437 ms
[2021-05-14 22:39:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 966 labels/synchronizations in 121 ms.
[2021-05-14 22:39:50] [INFO ] Time to serialize gal into /tmp/UpperBounds16864349024878908786.gal : 60 ms
[2021-05-14 22:39:50] [INFO ] Time to serialize properties into /tmp/UpperBounds13696552838384546121.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds16864349024878908786.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds13696552838384546121.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds16864349024878908786.gal -t CGAL -reachable-file /tmp/UpperBounds13696552838384546121.prop --nowitness
Loading property file /tmp/UpperBounds13696552838384546121.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-7"
export BK_EXAMINATION="UpperBounds"
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-4028"
echo " Executing tool itstools"
echo " Input is Peterson-PT-7, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089128200643"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-7.tgz
mv Peterson-PT-7 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;