About the Execution of ITS-Tools for Peterson-PT-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16239.048 | 3600000.00 | 2675848.00 | 424112.40 | ? 6 6 6 6 6 6 6 1 1 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-162089128200627.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-5, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128200627
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.8M
-rw-r--r-- 1 mcc users 562K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.1M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 612K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.7M 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 52K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 165K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 60K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 201K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 69K Mar 27 07:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Mar 27 07:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 47K Mar 25 08:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 154K Mar 25 08:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 26K 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 927K 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-5-UpperBounds-00
FORMULA_NAME Peterson-PT-5-UpperBounds-01
FORMULA_NAME Peterson-PT-5-UpperBounds-02
FORMULA_NAME Peterson-PT-5-UpperBounds-03
FORMULA_NAME Peterson-PT-5-UpperBounds-04
FORMULA_NAME Peterson-PT-5-UpperBounds-05
FORMULA_NAME Peterson-PT-5-UpperBounds-06
FORMULA_NAME Peterson-PT-5-UpperBounds-07
FORMULA_NAME Peterson-PT-5-UpperBounds-08
FORMULA_NAME Peterson-PT-5-UpperBounds-09
FORMULA_NAME Peterson-PT-5-UpperBounds-10
FORMULA_NAME Peterson-PT-5-UpperBounds-11
FORMULA_NAME Peterson-PT-5-UpperBounds-12
FORMULA_NAME Peterson-PT-5-UpperBounds-13
FORMULA_NAME Peterson-PT-5-UpperBounds-14
FORMULA_NAME Peterson-PT-5-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1621022351090
Running Version 0
[2021-05-14 19:59:12] [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 19:59:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 19:59:13] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2021-05-14 19:59:13] [INFO ] Transformed 834 places.
[2021-05-14 19:59:13] [INFO ] Transformed 1242 transitions.
[2021-05-14 19:59:13] [INFO ] Found NUPN structural information;
[2021-05-14 19:59:13] [INFO ] Parsed PT model containing 834 places and 1242 transitions in 160 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Normalized transition count is 1122 out of 1242 initially.
// Phase 1: matrix 1122 rows 834 cols
[2021-05-14 19:59:13] [INFO ] Computed 23 place invariants in 37 ms
FORMULA Peterson-PT-5-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 14) seen :30
FORMULA Peterson-PT-5-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :23
[2021-05-14 19:59:13] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2021-05-14 19:59:13] [INFO ] Computed 23 place invariants in 36 ms
[2021-05-14 19:59:13] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2021-05-14 19:59:13] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 19:59:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:59:14] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2021-05-14 19:59:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:59:14] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2021-05-14 19:59:14] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 19:59:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:59:14] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2021-05-14 19:59:14] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 19:59:14] [INFO ] [Nat]Added 230 Read/Feed constraints in 46 ms returned sat
[2021-05-14 19:59:15] [INFO ] Deduced a trap composed of 11 places in 351 ms of which 4 ms to minimize.
[2021-05-14 19:59:15] [INFO ] Deduced a trap composed of 11 places in 326 ms of which 2 ms to minimize.
[2021-05-14 19:59:16] [INFO ] Deduced a trap composed of 155 places in 324 ms of which 1 ms to minimize.
[2021-05-14 19:59:16] [INFO ] Deduced a trap composed of 39 places in 254 ms of which 1 ms to minimize.
[2021-05-14 19:59:16] [INFO ] Deduced a trap composed of 39 places in 248 ms of which 16 ms to minimize.
[2021-05-14 19:59:16] [INFO ] Deduced a trap composed of 92 places in 287 ms of which 1 ms to minimize.
[2021-05-14 19:59:17] [INFO ] Deduced a trap composed of 39 places in 248 ms of which 1 ms to minimize.
[2021-05-14 19:59:17] [INFO ] Deduced a trap composed of 39 places in 239 ms of which 1 ms to minimize.
[2021-05-14 19:59:17] [INFO ] Deduced a trap composed of 39 places in 209 ms of which 1 ms to minimize.
[2021-05-14 19:59:18] [INFO ] Deduced a trap composed of 18 places in 272 ms of which 1 ms to minimize.
[2021-05-14 19:59:18] [INFO ] Deduced a trap composed of 11 places in 268 ms of which 1 ms to minimize.
[2021-05-14 19:59:18] [INFO ] Deduced a trap composed of 73 places in 231 ms of which 0 ms to minimize.
[2021-05-14 19:59:18] [INFO ] Deduced a trap composed of 53 places in 229 ms of which 1 ms to minimize.
[2021-05-14 19:59:19] [INFO ] Deduced a trap composed of 185 places in 243 ms of which 1 ms to minimize.
[2021-05-14 19:59:19] [INFO ] Deduced a trap composed of 77 places in 252 ms of which 0 ms to minimize.
[2021-05-14 19:59:19] [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: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 19:59:19] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned unsat
[2021-05-14 19:59:19] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned unsat
[2021-05-14 19:59:20] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned unsat
[2021-05-14 19:59:20] [INFO ] [Real]Absence check using 17 positive place invariants in 43 ms returned unsat
[2021-05-14 19:59:20] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned unsat
[2021-05-14 19:59:20] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2021-05-14 19:59:20] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 10 ms returned sat
[2021-05-14 19:59:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:59:20] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2021-05-14 19:59:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:59:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2021-05-14 19:59:20] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-14 19:59:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:59:21] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2021-05-14 19:59:21] [INFO ] [Nat]Added 230 Read/Feed constraints in 54 ms returned sat
[2021-05-14 19:59:21] [INFO ] Deduced a trap composed of 67 places in 281 ms of which 1 ms to minimize.
[2021-05-14 19:59:21] [INFO ] Deduced a trap composed of 67 places in 282 ms of which 0 ms to minimize.
[2021-05-14 19:59:22] [INFO ] Deduced a trap composed of 67 places in 284 ms of which 1 ms to minimize.
[2021-05-14 19:59:22] [INFO ] Deduced a trap composed of 67 places in 272 ms of which 1 ms to minimize.
[2021-05-14 19:59:22] [INFO ] Deduced a trap composed of 67 places in 299 ms of which 0 ms to minimize.
[2021-05-14 19:59:23] [INFO ] Deduced a trap composed of 30 places in 334 ms of which 1 ms to minimize.
[2021-05-14 19:59:23] [INFO ] Deduced a trap composed of 52 places in 293 ms of which 0 ms to minimize.
[2021-05-14 19:59:23] [INFO ] Deduced a trap composed of 41 places in 303 ms of which 1 ms to minimize.
[2021-05-14 19:59:24] [INFO ] Deduced a trap composed of 52 places in 282 ms of which 1 ms to minimize.
[2021-05-14 19:59:24] [INFO ] Deduced a trap composed of 11 places in 302 ms of which 0 ms to minimize.
[2021-05-14 19:59:24] [INFO ] Deduced a trap composed of 27 places in 321 ms of which 1 ms to minimize.
[2021-05-14 19:59:25] [INFO ] Deduced a trap composed of 11 places in 313 ms of which 1 ms to minimize.
[2021-05-14 19:59:25] [INFO ] Deduced a trap composed of 11 places in 305 ms of which 3 ms to minimize.
[2021-05-14 19:59:26] [INFO ] Deduced a trap composed of 18 places in 291 ms of which 1 ms to minimize.
[2021-05-14 19:59: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 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 19:59:26] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2021-05-14 19:59:26] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 19:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:59:26] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2021-05-14 19:59:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:59:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2021-05-14 19:59:26] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-14 19:59:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:59:26] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2021-05-14 19:59:27] [INFO ] [Nat]Added 230 Read/Feed constraints in 57 ms returned sat
[2021-05-14 19:59:27] [INFO ] Deduced a trap composed of 129 places in 272 ms of which 1 ms to minimize.
[2021-05-14 19:59:27] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 1 ms to minimize.
[2021-05-14 19:59:27] [INFO ] Deduced a trap composed of 45 places in 238 ms of which 1 ms to minimize.
[2021-05-14 19:59:28] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 0 ms to minimize.
[2021-05-14 19:59:28] [INFO ] Deduced a trap composed of 71 places in 244 ms of which 1 ms to minimize.
[2021-05-14 19:59:28] [INFO ] Deduced a trap composed of 11 places in 277 ms of which 1 ms to minimize.
[2021-05-14 19:59:29] [INFO ] Deduced a trap composed of 11 places in 279 ms of which 0 ms to minimize.
[2021-05-14 19:59:29] [INFO ] Deduced a trap composed of 14 places in 285 ms of which 0 ms to minimize.
[2021-05-14 19:59:29] [INFO ] Deduced a trap composed of 26 places in 275 ms of which 0 ms to minimize.
[2021-05-14 19:59:30] [INFO ] Deduced a trap composed of 11 places in 273 ms of which 1 ms to minimize.
[2021-05-14 19:59:30] [INFO ] Deduced a trap composed of 41 places in 257 ms of which 9 ms to minimize.
[2021-05-14 19:59:30] [INFO ] Deduced a trap composed of 52 places in 258 ms of which 0 ms to minimize.
[2021-05-14 19:59:30] [INFO ] Deduced a trap composed of 53 places in 253 ms of which 0 ms to minimize.
[2021-05-14 19:59:31] [INFO ] Deduced a trap composed of 104 places in 232 ms of which 1 ms to minimize.
[2021-05-14 19:59:31] [INFO ] Deduced a trap composed of 93 places in 206 ms of which 1 ms to minimize.
[2021-05-14 19:59:31] [INFO ] Deduced a trap composed of 93 places in 241 ms of which 1 ms to minimize.
[2021-05-14 19:59:31] [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 19:59:31] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2021-05-14 19:59:31] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-14 19:59:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:59:32] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2021-05-14 19:59:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:59:32] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 19:59:32] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-14 19:59:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:59:32] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2021-05-14 19:59:32] [INFO ] [Nat]Added 230 Read/Feed constraints in 48 ms returned sat
[2021-05-14 19:59:32] [INFO ] Deduced a trap composed of 13 places in 273 ms of which 1 ms to minimize.
[2021-05-14 19:59:33] [INFO ] Deduced a trap composed of 27 places in 280 ms of which 1 ms to minimize.
[2021-05-14 19:59:33] [INFO ] Deduced a trap composed of 39 places in 311 ms of which 0 ms to minimize.
[2021-05-14 19:59:33] [INFO ] Deduced a trap composed of 27 places in 306 ms of which 1 ms to minimize.
[2021-05-14 19:59:34] [INFO ] Deduced a trap composed of 11 places in 308 ms of which 0 ms to minimize.
[2021-05-14 19:59:34] [INFO ] Deduced a trap composed of 13 places in 292 ms of which 9 ms to minimize.
[2021-05-14 19:59:34] [INFO ] Deduced a trap composed of 109 places in 296 ms of which 1 ms to minimize.
[2021-05-14 19:59:35] [INFO ] Deduced a trap composed of 14 places in 274 ms of which 1 ms to minimize.
[2021-05-14 19:59:35] [INFO ] Deduced a trap composed of 63 places in 218 ms of which 1 ms to minimize.
[2021-05-14 19:59:35] [INFO ] Deduced a trap composed of 29 places in 238 ms of which 1 ms to minimize.
[2021-05-14 19:59:36] [INFO ] Deduced a trap composed of 29 places in 223 ms of which 0 ms to minimize.
[2021-05-14 19:59:36] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 8 ms to minimize.
[2021-05-14 19:59:36] [INFO ] Deduced a trap composed of 29 places in 223 ms of which 1 ms to minimize.
[2021-05-14 19:59:36] [INFO ] Deduced a trap composed of 29 places in 217 ms of which 0 ms to minimize.
[2021-05-14 19:59:37] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 0 ms to minimize.
[2021-05-14 19:59:37] [INFO ] Deduced a trap composed of 2 places in 471 ms of which 0 ms to minimize.
[2021-05-14 19:59:37] [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 19:59:37] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2021-05-14 19:59:37] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-14 19:59:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:59:38] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2021-05-14 19:59:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:59:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 19:59:38] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-14 19:59:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:59:38] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2021-05-14 19:59:38] [INFO ] [Nat]Added 230 Read/Feed constraints in 43 ms returned sat
[2021-05-14 19:59:38] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 1 ms to minimize.
[2021-05-14 19:59:39] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 0 ms to minimize.
[2021-05-14 19:59:39] [INFO ] Deduced a trap composed of 101 places in 235 ms of which 1 ms to minimize.
[2021-05-14 19:59:39] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 1 ms to minimize.
[2021-05-14 19:59:39] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 2 ms to minimize.
[2021-05-14 19:59:40] [INFO ] Deduced a trap composed of 39 places in 219 ms of which 2 ms to minimize.
[2021-05-14 19:59:40] [INFO ] Deduced a trap composed of 39 places in 236 ms of which 9 ms to minimize.
[2021-05-14 19:59:40] [INFO ] Deduced a trap composed of 56 places in 230 ms of which 2 ms to minimize.
[2021-05-14 19:59:40] [INFO ] Deduced a trap composed of 11 places in 235 ms of which 1 ms to minimize.
[2021-05-14 19:59:41] [INFO ] Deduced a trap composed of 43 places in 251 ms of which 1 ms to minimize.
[2021-05-14 19:59:41] [INFO ] Deduced a trap composed of 43 places in 237 ms of which 1 ms to minimize.
[2021-05-14 19:59:41] [INFO ] Deduced a trap composed of 43 places in 240 ms of which 1 ms to minimize.
[2021-05-14 19:59:42] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 0 ms to minimize.
[2021-05-14 19:59:42] [INFO ] Deduced a trap composed of 43 places in 237 ms of which 0 ms to minimize.
[2021-05-14 19:59:42] [INFO ] Deduced a trap composed of 37 places in 219 ms of which 0 ms to minimize.
[2021-05-14 19:59:42] [INFO ] Deduced a trap composed of 37 places in 230 ms of which 1 ms to minimize.
[2021-05-14 19:59:43] [INFO ] Deduced a trap composed of 63 places in 225 ms of which 0 ms to minimize.
[2021-05-14 19:59: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 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)
Current structural bounds on expressions (after SMT) : [6, 6, 6, 6, 6, 6, 1, 1, 1, 1] Max seen :[1, 6, 6, 6, 6, 6, 0, 0, 0, 0]
FORMULA Peterson-PT-5-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-01 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 10 out of 834 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 834 transition count 892
Reduce places removed 350 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 353 rules applied. Total rules applied 703 place count 484 transition count 889
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 706 place count 481 transition count 889
Performed 173 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 173 Pre rules applied. Total rules applied 706 place count 481 transition count 716
Deduced a syphon composed of 173 places in 1 ms
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 3 with 346 rules applied. Total rules applied 1052 place count 308 transition count 716
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1112 place count 278 transition count 686
Applied a total of 1112 rules in 109 ms. Remains 278 /834 variables (removed 556) and now considering 686/1242 (removed 556) transitions.
Finished structural reductions, in 1 iterations. Remains : 278/834 places, 686/1242 transitions.
Normalized transition count is 566 out of 686 initially.
// Phase 1: matrix 566 rows 278 cols
[2021-05-14 19:59:43] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2684 ms. (steps per millisecond=372 ) properties (out of 5) seen :2
FORMULA Peterson-PT-5-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 688 ms. (steps per millisecond=1453 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 644 ms. (steps per millisecond=1552 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 654 ms. (steps per millisecond=1529 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 632 ms. (steps per millisecond=1582 ) properties (out of 4) seen :1
[2021-05-14 19:59:48] [INFO ] Flow matrix only has 566 transitions (discarded 120 similar events)
// Phase 1: matrix 566 rows 278 cols
[2021-05-14 19:59:48] [INFO ] Computed 23 place invariants in 17 ms
[2021-05-14 19:59:48] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2021-05-14 19:59:48] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-14 19:59:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:59:48] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2021-05-14 19:59:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:59:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2021-05-14 19:59:48] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-14 19:59:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:59:48] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2021-05-14 19:59:48] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 19:59:49] [INFO ] [Nat]Added 230 Read/Feed constraints in 22 ms returned sat
[2021-05-14 19:59:49] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 0 ms to minimize.
[2021-05-14 19:59:49] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2021-05-14 19:59:49] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2021-05-14 19:59:49] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2021-05-14 19:59:49] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2021-05-14 19:59:49] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2021-05-14 19:59:49] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 0 ms to minimize.
[2021-05-14 19:59:49] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 0 ms to minimize.
[2021-05-14 19:59:49] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 0 ms to minimize.
[2021-05-14 19:59:49] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 0 ms to minimize.
[2021-05-14 19:59:50] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
[2021-05-14 19:59:50] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 0 ms to minimize.
[2021-05-14 19:59:50] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 0 ms to minimize.
[2021-05-14 19:59:50] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 0 ms to minimize.
[2021-05-14 19:59:50] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 0 ms to minimize.
[2021-05-14 19:59:50] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2021-05-14 19:59:50] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
[2021-05-14 19:59:50] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2021-05-14 19:59:50] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2021-05-14 19:59:50] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 0 ms to minimize.
[2021-05-14 19:59:50] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2021-05-14 19:59:50] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:59:50] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2021-05-14 19:59:50] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2021-05-14 19:59:50] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:59:51] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:59:51] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2021-05-14 19:59:51] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2021-05-14 19:59:51] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2021-05-14 19:59:51] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2021-05-14 19:59:51] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 0 ms to minimize.
[2021-05-14 19:59:51] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2021-05-14 19:59:51] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 0 ms to minimize.
[2021-05-14 19:59:51] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 0 ms to minimize.
[2021-05-14 19:59:51] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2021-05-14 19:59:51] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 0 ms to minimize.
[2021-05-14 19:59:51] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 0 ms to minimize.
[2021-05-14 19:59:52] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2021-05-14 19:59:52] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2021-05-14 19:59:52] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2021-05-14 19:59:52] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 0 ms to minimize.
[2021-05-14 19:59:52] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 0 ms to minimize.
[2021-05-14 19:59:52] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2021-05-14 19:59:52] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2021-05-14 19:59:52] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 0 ms to minimize.
[2021-05-14 19:59:52] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2021-05-14 19:59:52] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2021-05-14 19:59:53] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 0 ms to minimize.
[2021-05-14 19:59:53] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 0 ms to minimize.
[2021-05-14 19:59:53] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2021-05-14 19:59:53] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2021-05-14 19:59:53] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 0 ms to minimize.
[2021-05-14 19:59:53] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 0 ms to minimize.
[2021-05-14 19:59:53] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 0 ms to minimize.
[2021-05-14 19:59:53] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 0 ms to minimize.
[2021-05-14 19:59:53] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 0 ms to minimize.
[2021-05-14 19:59:53] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2021-05-14 19:59:53] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 0 ms to minimize.
[2021-05-14 19:59:53] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2021-05-14 19:59:54] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2021-05-14 19:59:54] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 0 ms to minimize.
[2021-05-14 19:59:54] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2021-05-14 19:59:54] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 0 ms to minimize.
[2021-05-14 19:59:54] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2021-05-14 19:59:54] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2021-05-14 19:59:54] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2021-05-14 19:59:54] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2021-05-14 19:59:54] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2021-05-14 19:59:54] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 0 ms to minimize.
[2021-05-14 19:59:54] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2021-05-14 19:59:55] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2021-05-14 19:59:55] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 1 ms to minimize.
[2021-05-14 19:59:55] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 1 ms to minimize.
[2021-05-14 19:59:55] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2021-05-14 19:59:55] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 1 ms to minimize.
[2021-05-14 19:59:55] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 0 ms to minimize.
[2021-05-14 19:59:55] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2021-05-14 19:59:55] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 0 ms to minimize.
[2021-05-14 19:59:55] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 0 ms to minimize.
[2021-05-14 19:59:55] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 0 ms to minimize.
[2021-05-14 19:59:55] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2021-05-14 19:59:56] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 0 ms to minimize.
[2021-05-14 19:59:56] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 0 ms to minimize.
[2021-05-14 19:59:56] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2021-05-14 19:59:56] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2021-05-14 19:59:56] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 0 ms to minimize.
[2021-05-14 19:59:56] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 0 ms to minimize.
[2021-05-14 19:59:56] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2021-05-14 19:59:56] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2021-05-14 19:59:56] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2021-05-14 19:59:56] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2021-05-14 19:59:57] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2021-05-14 19:59:57] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2021-05-14 19:59:57] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 0 ms to minimize.
[2021-05-14 19:59:57] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 0 ms to minimize.
[2021-05-14 19:59:57] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 0 ms to minimize.
[2021-05-14 19:59:57] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2021-05-14 19:59:57] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2021-05-14 19:59:57] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2021-05-14 19:59:57] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2021-05-14 19:59:57] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 0 ms to minimize.
[2021-05-14 19:59:57] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2021-05-14 19:59:58] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 0 ms to minimize.
[2021-05-14 19:59:58] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 0 ms to minimize.
[2021-05-14 19:59:58] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2021-05-14 19:59:58] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2021-05-14 19:59:58] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2021-05-14 19:59:58] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2021-05-14 19:59:58] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 0 ms to minimize.
[2021-05-14 19:59:58] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 0 ms to minimize.
[2021-05-14 19:59:58] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 0 ms to minimize.
[2021-05-14 19:59:58] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 0 ms to minimize.
[2021-05-14 19:59:59] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2021-05-14 19:59:59] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 0 ms to minimize.
[2021-05-14 19:59:59] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 0 ms to minimize.
[2021-05-14 19:59:59] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2021-05-14 19:59:59] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 0 ms to minimize.
[2021-05-14 19:59:59] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 0 ms to minimize.
[2021-05-14 19:59:59] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 0 ms to minimize.
[2021-05-14 20:00:00] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 0 ms to minimize.
[2021-05-14 20:00:00] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 0 ms to minimize.
[2021-05-14 20:00:00] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2021-05-14 20:00:00] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 0 ms to minimize.
[2021-05-14 20:00:00] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2021-05-14 20:00:00] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2021-05-14 20:00:00] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2021-05-14 20:00:00] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2021-05-14 20:00:00] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2021-05-14 20:00:00] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2021-05-14 20:00:01] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2021-05-14 20:00:01] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2021-05-14 20:00:02] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 0 ms to minimize.
[2021-05-14 20:00:03] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2021-05-14 20:00:03] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2021-05-14 20:00:03] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2021-05-14 20:00:03] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2021-05-14 20:00:05] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
[2021-05-14 20:00:05] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 0 ms to minimize.
[2021-05-14 20:00:05] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 0 ms to minimize.
[2021-05-14 20:00:05] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 0 ms to minimize.
[2021-05-14 20:00:33] [INFO ] Deduced a trap composed of 2 places in 106 ms of which 0 ms to minimize.
[2021-05-14 20:00:33] [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: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 20:00:34] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2021-05-14 20:00:34] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-14 20:00:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:00:34] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2021-05-14 20:00:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:00:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2021-05-14 20:00:34] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-14 20:00:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:00:34] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2021-05-14 20:00:34] [INFO ] [Nat]Added 230 Read/Feed constraints in 24 ms returned sat
[2021-05-14 20:00:34] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2021-05-14 20:00:34] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 0 ms to minimize.
[2021-05-14 20:00:34] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 0 ms to minimize.
[2021-05-14 20:00:34] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 0 ms to minimize.
[2021-05-14 20:00:34] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2021-05-14 20:00:34] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2021-05-14 20:00:34] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 0 ms to minimize.
[2021-05-14 20:00:35] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2021-05-14 20:00:35] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2021-05-14 20:00:35] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2021-05-14 20:00:35] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 0 ms to minimize.
[2021-05-14 20:00:35] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2021-05-14 20:00:35] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 0 ms to minimize.
[2021-05-14 20:00:35] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 1 ms to minimize.
[2021-05-14 20:00:35] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 1 ms to minimize.
[2021-05-14 20:00:35] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 1 ms to minimize.
[2021-05-14 20:00:35] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 1 ms to minimize.
[2021-05-14 20:00:36] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2021-05-14 20:00:36] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1758 ms
[2021-05-14 20:00:36] [INFO ] Computed and/alt/rep : 500/1556/500 causal constraints (skipped 60 transitions) in 36 ms.
[2021-05-14 20:00:37] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 0 ms to minimize.
[2021-05-14 20:00:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2021-05-14 20:00:37] [INFO ] Added : 224 causal constraints over 45 iterations in 1458 ms. Result :sat
Minimization took 104 ms.
[2021-05-14 20:00:37] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2021-05-14 20:00:37] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-14 20:00:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:00:37] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2021-05-14 20:00:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:00:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2021-05-14 20:00:37] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-14 20:00:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:00:37] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2021-05-14 20:00:37] [INFO ] [Nat]Added 230 Read/Feed constraints in 23 ms returned sat
[2021-05-14 20:00:38] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2021-05-14 20:00:38] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 1 ms to minimize.
[2021-05-14 20:00:38] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 0 ms to minimize.
[2021-05-14 20:00:38] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 0 ms to minimize.
[2021-05-14 20:00:38] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2021-05-14 20:00:38] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2021-05-14 20:00:38] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2021-05-14 20:00:38] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2021-05-14 20:00:38] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2021-05-14 20:00:39] [INFO ] Deduced a trap composed of 71 places in 85 ms of which 0 ms to minimize.
[2021-05-14 20:00:39] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 0 ms to minimize.
[2021-05-14 20:00:39] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2021-05-14 20:00:39] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2021-05-14 20:00:39] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 0 ms to minimize.
[2021-05-14 20:00:39] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2021-05-14 20:00:39] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 1 ms to minimize.
[2021-05-14 20:00:39] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 0 ms to minimize.
[2021-05-14 20:00:39] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
[2021-05-14 20:00:39] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 0 ms to minimize.
[2021-05-14 20:00:40] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 0 ms to minimize.
[2021-05-14 20:00:40] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 0 ms to minimize.
[2021-05-14 20:00:40] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2021-05-14 20:00:40] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2021-05-14 20:00:40] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2021-05-14 20:00:40] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2021-05-14 20:00:40] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2021-05-14 20:00:40] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 2646 ms
[2021-05-14 20:00:40] [INFO ] Computed and/alt/rep : 500/1556/500 causal constraints (skipped 60 transitions) in 37 ms.
[2021-05-14 20:00:43] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 0 ms to minimize.
[2021-05-14 20:00:43] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 0 ms to minimize.
[2021-05-14 20:00:43] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2021-05-14 20:00:43] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 0 ms to minimize.
[2021-05-14 20:00:43] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2021-05-14 20:00:43] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 0 ms to minimize.
[2021-05-14 20:00:44] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 0 ms to minimize.
[2021-05-14 20:00:44] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 0 ms to minimize.
[2021-05-14 20:00:44] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 0 ms to minimize.
[2021-05-14 20:00:44] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2021-05-14 20:00:44] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2021-05-14 20:00:44] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2021-05-14 20:00:44] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2021-05-14 20:00:44] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2021-05-14 20:00:44] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2021-05-14 20:00:44] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 0 ms to minimize.
[2021-05-14 20:00:45] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2021-05-14 20:00:45] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 0 ms to minimize.
[2021-05-14 20:00:45] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 0 ms to minimize.
[2021-05-14 20:00:45] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2021-05-14 20:00:45] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 0 ms to minimize.
[2021-05-14 20:00:45] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 0 ms to minimize.
[2021-05-14 20:00:45] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2506 ms
[2021-05-14 20:00:45] [INFO ] Added : 450 causal constraints over 91 iterations in 5245 ms. Result :sat
Minimization took 192 ms.
[2021-05-14 20:00:46] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2021-05-14 20:00:46] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-14 20:00:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:00:46] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2021-05-14 20:00:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:00:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2021-05-14 20:00:46] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-14 20:00:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:00:46] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2021-05-14 20:00:46] [INFO ] [Nat]Added 230 Read/Feed constraints in 24 ms returned sat
[2021-05-14 20:00:46] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 1 ms to minimize.
[2021-05-14 20:00:46] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2021-05-14 20:00:46] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 0 ms to minimize.
[2021-05-14 20:00:46] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 1 ms to minimize.
[2021-05-14 20:00:46] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2021-05-14 20:00:47] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 0 ms to minimize.
[2021-05-14 20:00:47] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2021-05-14 20:00:47] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2021-05-14 20:00:47] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 0 ms to minimize.
[2021-05-14 20:00:47] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 0 ms to minimize.
[2021-05-14 20:00:47] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 0 ms to minimize.
[2021-05-14 20:00:47] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2021-05-14 20:00:47] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2021-05-14 20:00:47] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2021-05-14 20:00:48] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2021-05-14 20:00:48] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 0 ms to minimize.
[2021-05-14 20:00:48] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 0 ms to minimize.
[2021-05-14 20:00:48] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 0 ms to minimize.
[2021-05-14 20:00:48] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2021-05-14 20:00:48] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 0 ms to minimize.
[2021-05-14 20:00:48] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2065 ms
[2021-05-14 20:00:48] [INFO ] Computed and/alt/rep : 500/1556/500 causal constraints (skipped 60 transitions) in 51 ms.
[2021-05-14 20:00:50] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 0 ms to minimize.
[2021-05-14 20:00:51] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2021-05-14 20:00:51] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 0 ms to minimize.
[2021-05-14 20:00:51] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 0 ms to minimize.
[2021-05-14 20:00:51] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 0 ms to minimize.
[2021-05-14 20:00:51] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2021-05-14 20:00:51] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2021-05-14 20:00:51] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2021-05-14 20:00:51] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 0 ms to minimize.
[2021-05-14 20:00:51] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 0 ms to minimize.
[2021-05-14 20:00:52] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 0 ms to minimize.
[2021-05-14 20:00:52] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2021-05-14 20:00:52] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2021-05-14 20:00:52] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 0 ms to minimize.
[2021-05-14 20:00:52] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 0 ms to minimize.
[2021-05-14 20:00:52] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2021-05-14 20:00:52] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 0 ms to minimize.
[2021-05-14 20:00:52] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2021-05-14 20:00:52] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2021-05-14 20:00:53] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2021-05-14 20:00:53] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 0 ms to minimize.
[2021-05-14 20:00:53] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 0 ms to minimize.
[2021-05-14 20:00:53] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 0 ms to minimize.
[2021-05-14 20:00:53] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2021-05-14 20:00:53] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 0 ms to minimize.
[2021-05-14 20:00:53] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2021-05-14 20:00:53] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 0 ms to minimize.
[2021-05-14 20:00:53] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 0 ms to minimize.
[2021-05-14 20:00:54] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2021-05-14 20:00:54] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2021-05-14 20:00:54] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 3561 ms
[2021-05-14 20:00:54] [INFO ] Added : 380 causal constraints over 78 iterations in 5968 ms. Result :sat
Minimization took 145 ms.
Current structural bounds on expressions (after SMT) : [6, 1, 1, 1] Max seen :[1, 0, 0, 0]
Incomplete Parikh walk after 21900 steps, including 837 resets, run finished after 93 ms. (steps per millisecond=235 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA Peterson-PT-5-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 59500 steps, including 994 resets, run finished after 195 ms. (steps per millisecond=305 ) properties (out of 3) seen :2 could not realise parikh vector
FORMULA Peterson-PT-5-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 96200 steps, including 1000 resets, run finished after 256 ms. (steps per millisecond=375 ) properties (out of 2) seen :1 could not realise parikh vector
Support contains 7 out of 278 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 278/278 places, 686/686 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 278 transition count 683
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 275 transition count 683
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 275 transition count 680
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 272 transition count 680
Applied a total of 12 rules in 31 ms. Remains 272 /278 variables (removed 6) and now considering 680/686 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 272/278 places, 680/686 transitions.
Normalized transition count is 560 out of 680 initially.
// Phase 1: matrix 560 rows 272 cols
[2021-05-14 20:00:55] [INFO ] Computed 23 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2584 ms. (steps per millisecond=386 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 694 ms. (steps per millisecond=1440 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 665 ms. (steps per millisecond=1503 ) properties (out of 2) seen :1
[2021-05-14 20:00:59] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 272 cols
[2021-05-14 20:00:59] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-14 20:00:59] [INFO ] [Real]Absence check using 17 positive place invariants in 19 ms returned sat
[2021-05-14 20:00:59] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-14 20:00:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:00:59] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2021-05-14 20:00:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:00:59] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2021-05-14 20:00:59] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 20:00:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:00:59] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2021-05-14 20:00:59] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 20:00:59] [INFO ] [Nat]Added 230 Read/Feed constraints in 24 ms returned sat
[2021-05-14 20:00:59] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2021-05-14 20:00:59] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2021-05-14 20:00:59] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2021-05-14 20:00:59] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2021-05-14 20:01:00] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2021-05-14 20:01:00] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 0 ms to minimize.
[2021-05-14 20:01:00] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2021-05-14 20:01:00] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2021-05-14 20:01:00] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2021-05-14 20:01:00] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2021-05-14 20:01:00] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2021-05-14 20:01:00] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2021-05-14 20:01:00] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 0 ms to minimize.
[2021-05-14 20:01:00] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 0 ms to minimize.
[2021-05-14 20:01:00] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 0 ms to minimize.
[2021-05-14 20:01:01] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2021-05-14 20:01:01] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2021-05-14 20:01:01] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 0 ms to minimize.
[2021-05-14 20:01:01] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 0 ms to minimize.
[2021-05-14 20:01:01] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 0 ms to minimize.
[2021-05-14 20:01:01] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2021-05-14 20:01:01] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 0 ms to minimize.
[2021-05-14 20:01:01] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2021-05-14 20:01:01] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2021-05-14 20:01:01] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 17 ms to minimize.
[2021-05-14 20:01:01] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2021-05-14 20:01:01] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2021-05-14 20:01:02] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2021-05-14 20:01:02] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2021-05-14 20:01:02] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2021-05-14 20:01:02] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 0 ms to minimize.
[2021-05-14 20:01:02] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2021-05-14 20:01:02] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2021-05-14 20:01:02] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2021-05-14 20:01:02] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 0 ms to minimize.
[2021-05-14 20:01:02] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 0 ms to minimize.
[2021-05-14 20:01:02] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 0 ms to minimize.
[2021-05-14 20:01:02] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 0 ms to minimize.
[2021-05-14 20:01:02] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2021-05-14 20:01:03] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2021-05-14 20:01:03] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2021-05-14 20:01:03] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2021-05-14 20:01:03] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 0 ms to minimize.
[2021-05-14 20:01:03] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 0 ms to minimize.
[2021-05-14 20:01:03] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2021-05-14 20:01:03] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 0 ms to minimize.
[2021-05-14 20:01:03] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 0 ms to minimize.
[2021-05-14 20:01:03] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 0 ms to minimize.
[2021-05-14 20:01:03] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 0 ms to minimize.
[2021-05-14 20:01:03] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2021-05-14 20:01:03] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2021-05-14 20:01:03] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2021-05-14 20:01:04] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2021-05-14 20:01:04] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 0 ms to minimize.
[2021-05-14 20:01:04] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2021-05-14 20:01:04] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2021-05-14 20:01:04] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2021-05-14 20:01:04] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 0 ms to minimize.
[2021-05-14 20:01:04] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 0 ms to minimize.
[2021-05-14 20:01:04] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2021-05-14 20:01:04] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2021-05-14 20:01:04] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2021-05-14 20:01:04] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2021-05-14 20:01:04] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 0 ms to minimize.
[2021-05-14 20:01:04] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 0 ms to minimize.
[2021-05-14 20:01:05] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 0 ms to minimize.
[2021-05-14 20:01:05] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 0 ms to minimize.
[2021-05-14 20:01:05] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2021-05-14 20:01:05] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 0 ms to minimize.
[2021-05-14 20:01:05] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2021-05-14 20:01:05] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 0 ms to minimize.
[2021-05-14 20:01:05] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 0 ms to minimize.
[2021-05-14 20:01:05] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 0 ms to minimize.
[2021-05-14 20:01:05] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 0 ms to minimize.
[2021-05-14 20:01:05] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2021-05-14 20:01:05] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2021-05-14 20:01:05] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2021-05-14 20:01:05] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 0 ms to minimize.
[2021-05-14 20:01:06] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 0 ms to minimize.
[2021-05-14 20:01:06] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 0 ms to minimize.
[2021-05-14 20:01:06] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 0 ms to minimize.
[2021-05-14 20:01:06] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 0 ms to minimize.
[2021-05-14 20:01:06] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 0 ms to minimize.
[2021-05-14 20:01:06] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2021-05-14 20:01:06] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2021-05-14 20:01:06] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2021-05-14 20:01:06] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
[2021-05-14 20:01:06] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
[2021-05-14 20:01:06] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2021-05-14 20:01:06] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 0 ms to minimize.
[2021-05-14 20:01:07] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 0 ms to minimize.
[2021-05-14 20:01:07] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 0 ms to minimize.
[2021-05-14 20:01:07] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 0 ms to minimize.
[2021-05-14 20:01:07] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 0 ms to minimize.
[2021-05-14 20:01:07] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 0 ms to minimize.
[2021-05-14 20:01:07] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2021-05-14 20:01:07] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 0 ms to minimize.
[2021-05-14 20:01:07] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2021-05-14 20:01:07] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2021-05-14 20:01:07] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2021-05-14 20:01:08] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 0 ms to minimize.
[2021-05-14 20:01:08] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2021-05-14 20:01:08] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2021-05-14 20:01:08] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
[2021-05-14 20:01:08] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 0 ms to minimize.
[2021-05-14 20:01:44] [INFO ] Deduced a trap composed of 2 places in 113 ms of which 0 ms to minimize.
[2021-05-14 20:01:44] [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: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 20:01:44] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2021-05-14 20:01:44] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-14 20:01:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:01:44] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2021-05-14 20:01:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:01:44] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2021-05-14 20:01:44] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-14 20:01:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:01:44] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2021-05-14 20:01:44] [INFO ] [Nat]Added 230 Read/Feed constraints in 25 ms returned sat
[2021-05-14 20:01:44] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 0 ms to minimize.
[2021-05-14 20:01:45] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2021-05-14 20:01:45] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2021-05-14 20:01:45] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 0 ms to minimize.
[2021-05-14 20:01:45] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 0 ms to minimize.
[2021-05-14 20:01:45] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 0 ms to minimize.
[2021-05-14 20:01:45] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2021-05-14 20:01:45] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 0 ms to minimize.
[2021-05-14 20:01:45] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 0 ms to minimize.
[2021-05-14 20:01:45] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 0 ms to minimize.
[2021-05-14 20:01:45] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2021-05-14 20:01:45] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2021-05-14 20:01:46] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 0 ms to minimize.
[2021-05-14 20:01:46] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 0 ms to minimize.
[2021-05-14 20:01:46] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2021-05-14 20:01:46] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 0 ms to minimize.
[2021-05-14 20:01:46] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 0 ms to minimize.
[2021-05-14 20:01:46] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2021-05-14 20:01:46] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2021-05-14 20:01:46] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2021-05-14 20:01:46] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2021-05-14 20:01:46] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2021-05-14 20:01:46] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2021-05-14 20:01:46] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 0 ms to minimize.
[2021-05-14 20:01:46] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2021-05-14 20:01:47] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2021-05-14 20:01:47] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2021-05-14 20:01:47] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 2301 ms
[2021-05-14 20:01:47] [INFO ] Computed and/alt/rep : 494/1550/494 causal constraints (skipped 60 transitions) in 37 ms.
[2021-05-14 20:01:48] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2021-05-14 20:01:48] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2021-05-14 20:01:48] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 0 ms to minimize.
[2021-05-14 20:01:49] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2021-05-14 20:01:49] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 0 ms to minimize.
[2021-05-14 20:01:49] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 0 ms to minimize.
[2021-05-14 20:01:49] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2021-05-14 20:01:49] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2021-05-14 20:01:49] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
[2021-05-14 20:01:49] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 901 ms
[2021-05-14 20:01:49] [INFO ] Added : 277 causal constraints over 56 iterations in 2495 ms. Result :sat
Minimization took 174 ms.
Current structural bounds on expressions (after SMT) : [6, 1] Max seen :[1, 0]
Incomplete Parikh walk after 75000 steps, including 999 resets, run finished after 218 ms. (steps per millisecond=344 ) properties (out of 2) seen :1 could not realise parikh vector
Support contains 7 out of 272 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 272/272 places, 680/680 transitions.
Applied a total of 0 rules in 26 ms. Remains 272 /272 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 272/272 places, 680/680 transitions.
Starting structural reductions, iteration 0 : 272/272 places, 680/680 transitions.
Applied a total of 0 rules in 14 ms. Remains 272 /272 variables (removed 0) and now considering 680/680 (removed 0) transitions.
[2021-05-14 20:01:50] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 272 cols
[2021-05-14 20:01:50] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-14 20:01:50] [INFO ] Implicit Places using invariants in 214 ms returned [231, 243, 244, 245, 246, 247]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 216 ms to find 6 implicit places.
[2021-05-14 20:01:50] [INFO ] Redundant transitions in 39 ms returned []
[2021-05-14 20:01:50] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 266 cols
[2021-05-14 20:01:50] [INFO ] Computed 17 place invariants in 3 ms
[2021-05-14 20:01:50] [INFO ] Dead Transitions using invariants and state equation in 268 ms returned []
Starting structural reductions, iteration 1 : 266/272 places, 680/680 transitions.
Applied a total of 0 rules in 13 ms. Remains 266 /266 variables (removed 0) and now considering 680/680 (removed 0) transitions.
[2021-05-14 20:01:50] [INFO ] Redundant transitions in 17 ms returned []
[2021-05-14 20:01:50] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 266 cols
[2021-05-14 20:01:50] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 20:01:50] [INFO ] Dead Transitions using invariants and state equation in 284 ms returned []
Finished structural reductions, in 2 iterations. Remains : 266/272 places, 680/680 transitions.
Normalized transition count is 560 out of 680 initially.
// Phase 1: matrix 560 rows 266 cols
[2021-05-14 20:01:50] [INFO ] Computed 17 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2576 ms. (steps per millisecond=388 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 686 ms. (steps per millisecond=1457 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 655 ms. (steps per millisecond=1526 ) properties (out of 2) seen :1
[2021-05-14 20:01:54] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 266 cols
[2021-05-14 20:01:54] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 20:01:54] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2021-05-14 20:01:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:01:54] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2021-05-14 20:01:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:01:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2021-05-14 20:01:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:01:55] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2021-05-14 20:01:55] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 20:01:55] [INFO ] [Nat]Added 230 Read/Feed constraints in 32 ms returned sat
[2021-05-14 20:01:55] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2021-05-14 20:01:55] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 0 ms to minimize.
[2021-05-14 20:01:55] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2021-05-14 20:01:55] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2021-05-14 20:01:55] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 0 ms to minimize.
[2021-05-14 20:01:55] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 0 ms to minimize.
[2021-05-14 20:01:55] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2021-05-14 20:01:56] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2021-05-14 20:01:56] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2021-05-14 20:01:56] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2021-05-14 20:01:56] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 0 ms to minimize.
[2021-05-14 20:01:56] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 0 ms to minimize.
[2021-05-14 20:01:56] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 0 ms to minimize.
[2021-05-14 20:01:56] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2021-05-14 20:01:56] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 0 ms to minimize.
[2021-05-14 20:01:56] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2021-05-14 20:01:56] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2021-05-14 20:01:56] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2021-05-14 20:01:56] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 0 ms to minimize.
[2021-05-14 20:01:57] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 0 ms to minimize.
[2021-05-14 20:01:57] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 0 ms to minimize.
[2021-05-14 20:01:57] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 0 ms to minimize.
[2021-05-14 20:01:57] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 0 ms to minimize.
[2021-05-14 20:01:57] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2021-05-14 20:01:57] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2021-05-14 20:01:57] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2021-05-14 20:01:57] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 0 ms to minimize.
[2021-05-14 20:01:57] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 0 ms to minimize.
[2021-05-14 20:01:57] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2021-05-14 20:01:57] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2021-05-14 20:01:58] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2021-05-14 20:01:58] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 10 ms to minimize.
[2021-05-14 20:01:58] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2021-05-14 20:01:58] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2021-05-14 20:01:58] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
[2021-05-14 20:01:58] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2021-05-14 20:01:58] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2021-05-14 20:01:58] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 0 ms to minimize.
[2021-05-14 20:01:58] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2021-05-14 20:01:58] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 0 ms to minimize.
[2021-05-14 20:01:58] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
[2021-05-14 20:01:58] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 0 ms to minimize.
[2021-05-14 20:01:58] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 0 ms to minimize.
[2021-05-14 20:01:58] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2021-05-14 20:01:59] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 0 ms to minimize.
[2021-05-14 20:01:59] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2021-05-14 20:01:59] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 0 ms to minimize.
[2021-05-14 20:01:59] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2021-05-14 20:01:59] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2021-05-14 20:01:59] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
[2021-05-14 20:01:59] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2021-05-14 20:01:59] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 0 ms to minimize.
[2021-05-14 20:01:59] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 0 ms to minimize.
[2021-05-14 20:02:00] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 0 ms to minimize.
[2021-05-14 20:02:00] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2021-05-14 20:02:00] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2021-05-14 20:02:00] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2021-05-14 20:02:00] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
[2021-05-14 20:02:00] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 0 ms to minimize.
[2021-05-14 20:02:00] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2021-05-14 20:02:00] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 0 ms to minimize.
[2021-05-14 20:02:00] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 0 ms to minimize.
[2021-05-14 20:02:00] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2021-05-14 20:02:00] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 0 ms to minimize.
[2021-05-14 20:02:01] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2021-05-14 20:02:01] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2021-05-14 20:02:01] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2021-05-14 20:02:01] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 0 ms to minimize.
[2021-05-14 20:02:01] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2021-05-14 20:02:01] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 0 ms to minimize.
[2021-05-14 20:02:01] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2021-05-14 20:02:01] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2021-05-14 20:02:01] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 0 ms to minimize.
[2021-05-14 20:02:02] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 0 ms to minimize.
[2021-05-14 20:02:02] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 0 ms to minimize.
[2021-05-14 20:02:02] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2021-05-14 20:02:02] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2021-05-14 20:02:02] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2021-05-14 20:02:02] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2021-05-14 20:02:02] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2021-05-14 20:02:02] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2021-05-14 20:02:02] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 0 ms to minimize.
[2021-05-14 20:02:02] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 0 ms to minimize.
[2021-05-14 20:02:02] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 0 ms to minimize.
[2021-05-14 20:02:03] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 0 ms to minimize.
[2021-05-14 20:02:03] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2021-05-14 20:02:03] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2021-05-14 20:02:03] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 0 ms to minimize.
[2021-05-14 20:02:03] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 0 ms to minimize.
[2021-05-14 20:02:03] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 0 ms to minimize.
[2021-05-14 20:02:03] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2021-05-14 20:02:03] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 0 ms to minimize.
[2021-05-14 20:02:03] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2021-05-14 20:02:03] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2021-05-14 20:02:04] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2021-05-14 20:02:04] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 0 ms to minimize.
[2021-05-14 20:02:04] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 0 ms to minimize.
[2021-05-14 20:02:04] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 0 ms to minimize.
[2021-05-14 20:02:04] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2021-05-14 20:02:04] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2021-05-14 20:02:04] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2021-05-14 20:02:04] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 0 ms to minimize.
[2021-05-14 20:02:04] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 0 ms to minimize.
[2021-05-14 20:02:04] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 0 ms to minimize.
[2021-05-14 20:02:05] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 0 ms to minimize.
[2021-05-14 20:02:05] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2021-05-14 20:02:05] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 0 ms to minimize.
[2021-05-14 20:02:05] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2021-05-14 20:02:05] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2021-05-14 20:02:05] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2021-05-14 20:02:40] [INFO ] Deduced a trap composed of 2 places in 103 ms of which 1 ms to minimize.
[2021-05-14 20:02:40] [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: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 20:02:40] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2021-05-14 20:02:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:02:40] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2021-05-14 20:02:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:02:40] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2021-05-14 20:02:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:02:40] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2021-05-14 20:02:40] [INFO ] [Nat]Added 230 Read/Feed constraints in 22 ms returned sat
[2021-05-14 20:02:40] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2021-05-14 20:02:40] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2021-05-14 20:02:40] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 0 ms to minimize.
[2021-05-14 20:02:40] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 1 ms to minimize.
[2021-05-14 20:02:40] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2021-05-14 20:02:41] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2021-05-14 20:02:41] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 0 ms to minimize.
[2021-05-14 20:02:41] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2021-05-14 20:02:41] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2021-05-14 20:02:41] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 0 ms to minimize.
[2021-05-14 20:02:41] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 0 ms to minimize.
[2021-05-14 20:02:41] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2021-05-14 20:02:41] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 0 ms to minimize.
[2021-05-14 20:02:41] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1177 ms
[2021-05-14 20:02:41] [INFO ] Computed and/alt/rep : 494/1550/494 causal constraints (skipped 60 transitions) in 33 ms.
[2021-05-14 20:02:43] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 0 ms to minimize.
[2021-05-14 20:02:43] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2021-05-14 20:02:44] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2021-05-14 20:02:44] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 0 ms to minimize.
[2021-05-14 20:02:44] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
[2021-05-14 20:02:44] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2021-05-14 20:02:44] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 0 ms to minimize.
[2021-05-14 20:02:44] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2021-05-14 20:02:44] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2021-05-14 20:02:44] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 0 ms to minimize.
[2021-05-14 20:02:44] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 0 ms to minimize.
[2021-05-14 20:02:45] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2021-05-14 20:02:45] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1448 ms
[2021-05-14 20:02:45] [INFO ] Added : 336 causal constraints over 68 iterations in 3516 ms. Result :sat
Minimization took 132 ms.
Current structural bounds on expressions (after SMT) : [6, 1] Max seen :[1, 0]
Incomplete Parikh walk after 64600 steps, including 998 resets, run finished after 173 ms. (steps per millisecond=373 ) properties (out of 2) seen :1 could not realise parikh vector
Support contains 7 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 680/680 transitions.
Applied a total of 0 rules in 12 ms. Remains 266 /266 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 266/266 places, 680/680 transitions.
Starting structural reductions, iteration 0 : 266/266 places, 680/680 transitions.
Applied a total of 0 rules in 12 ms. Remains 266 /266 variables (removed 0) and now considering 680/680 (removed 0) transitions.
[2021-05-14 20:02:45] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 266 cols
[2021-05-14 20:02:45] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-14 20:02:45] [INFO ] Implicit Places using invariants in 418 ms returned []
[2021-05-14 20:02:45] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 266 cols
[2021-05-14 20:02:45] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 20:02:46] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 20:02:46] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 1152 ms to find 0 implicit places.
[2021-05-14 20:02:46] [INFO ] Redundant transitions in 6 ms returned []
[2021-05-14 20:02:46] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 266 cols
[2021-05-14 20:02:46] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 20:02:46] [INFO ] Dead Transitions using invariants and state equation in 275 ms returned []
Finished structural reductions, in 1 iterations. Remains : 266/266 places, 680/680 transitions.
Starting property specific reduction for Peterson-PT-5-UpperBounds-00
Normalized transition count is 560 out of 680 initially.
// Phase 1: matrix 560 rows 266 cols
[2021-05-14 20:02:46] [INFO ] Computed 17 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :1
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 :1
[2021-05-14 20:02:46] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 266 cols
[2021-05-14 20:02:46] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 20:02:47] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2021-05-14 20:02:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:02:47] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2021-05-14 20:02:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:02:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2021-05-14 20:02:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:02:47] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2021-05-14 20:02:47] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 20:02:47] [INFO ] [Nat]Added 230 Read/Feed constraints in 24 ms returned sat
[2021-05-14 20:02:47] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2021-05-14 20:02:47] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2021-05-14 20:02:47] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2021-05-14 20:02:47] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
[2021-05-14 20:02:47] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2021-05-14 20:02:47] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 0 ms to minimize.
[2021-05-14 20:02:47] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2021-05-14 20:02:48] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2021-05-14 20:02:48] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2021-05-14 20:02:48] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 0 ms to minimize.
[2021-05-14 20:02:48] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2021-05-14 20:02:48] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 0 ms to minimize.
[2021-05-14 20:02:48] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2021-05-14 20:02:48] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2021-05-14 20:02:48] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2021-05-14 20:02:48] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2021-05-14 20:02:48] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2021-05-14 20:02:48] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2021-05-14 20:02:48] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2021-05-14 20:02:48] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 0 ms to minimize.
[2021-05-14 20:02:49] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 0 ms to minimize.
[2021-05-14 20:02:49] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 0 ms to minimize.
[2021-05-14 20:02:49] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 0 ms to minimize.
[2021-05-14 20:02:49] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2021-05-14 20:02:49] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2021-05-14 20:02:49] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2021-05-14 20:02:49] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2021-05-14 20:02:49] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2021-05-14 20:02:49] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2021-05-14 20:02:49] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2021-05-14 20:02:49] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2021-05-14 20:02:50] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 0 ms to minimize.
[2021-05-14 20:02:50] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2021-05-14 20:02:50] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2021-05-14 20:02:50] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2021-05-14 20:02:50] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
[2021-05-14 20:02:50] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2021-05-14 20:02:50] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2021-05-14 20:02:50] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 0 ms to minimize.
[2021-05-14 20:02:50] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2021-05-14 20:02:50] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
[2021-05-14 20:02:50] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 0 ms to minimize.
[2021-05-14 20:02:50] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 0 ms to minimize.
[2021-05-14 20:02:50] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2021-05-14 20:02:50] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 0 ms to minimize.
[2021-05-14 20:02:51] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2021-05-14 20:02:51] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 0 ms to minimize.
[2021-05-14 20:02:51] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 0 ms to minimize.
[2021-05-14 20:02:51] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 0 ms to minimize.
[2021-05-14 20:02:51] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 0 ms to minimize.
[2021-05-14 20:02:51] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2021-05-14 20:02:51] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 0 ms to minimize.
[2021-05-14 20:02:51] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 0 ms to minimize.
[2021-05-14 20:02:51] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2021-05-14 20:02:51] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2021-05-14 20:02:52] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2021-05-14 20:02:52] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2021-05-14 20:02: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) : [6] Max seen :[1]
Support contains 6 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 680/680 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 1 rules applied. Total rules applied 1 place count 266 transition count 679
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 265 transition count 679
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 265 transition count 678
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 264 transition count 678
Applied a total of 4 rules in 24 ms. Remains 264 /266 variables (removed 2) and now considering 678/680 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 264/266 places, 678/680 transitions.
Normalized transition count is 558 out of 678 initially.
// Phase 1: matrix 558 rows 264 cols
[2021-05-14 20:02:52] [INFO ] Computed 17 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2524 ms. (steps per millisecond=396 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 684 ms. (steps per millisecond=1461 ) properties (out of 1) seen :1
[2021-05-14 20:02:55] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2021-05-14 20:02:55] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-14 20:02:55] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2021-05-14 20:02:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:02:55] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2021-05-14 20:02:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:02:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2021-05-14 20:02:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:02:55] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2021-05-14 20:02:55] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 20:02:55] [INFO ] [Nat]Added 230 Read/Feed constraints in 22 ms returned sat
[2021-05-14 20:02:55] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 0 ms to minimize.
[2021-05-14 20:02:56] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 0 ms to minimize.
[2021-05-14 20:02:56] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 0 ms to minimize.
[2021-05-14 20:02:56] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 0 ms to minimize.
[2021-05-14 20:02:56] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2021-05-14 20:02:56] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2021-05-14 20:02:56] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 0 ms to minimize.
[2021-05-14 20:02:56] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2021-05-14 20:02:56] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 0 ms to minimize.
[2021-05-14 20:02:56] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 0 ms to minimize.
[2021-05-14 20:02:56] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 1 ms to minimize.
[2021-05-14 20:02:57] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 1 ms to minimize.
[2021-05-14 20:02:57] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 0 ms to minimize.
[2021-05-14 20:02:57] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2021-05-14 20:02:57] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 1 ms to minimize.
[2021-05-14 20:02:57] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2021-05-14 20:02:57] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 0 ms to minimize.
[2021-05-14 20:02:57] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 0 ms to minimize.
[2021-05-14 20:02:57] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 0 ms to minimize.
[2021-05-14 20:02:57] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 0 ms to minimize.
[2021-05-14 20:02:58] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 1 ms to minimize.
[2021-05-14 20:02:58] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2021-05-14 20:02:58] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 0 ms to minimize.
[2021-05-14 20:02:58] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2021-05-14 20:02:58] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 11 ms to minimize.
[2021-05-14 20:02:58] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 0 ms to minimize.
[2021-05-14 20:02:58] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2021-05-14 20:02:58] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 0 ms to minimize.
[2021-05-14 20:02:58] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2021-05-14 20:02:59] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 0 ms to minimize.
[2021-05-14 20:02:59] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2021-05-14 20:02:59] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 0 ms to minimize.
[2021-05-14 20:02:59] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 0 ms to minimize.
[2021-05-14 20:02:59] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2021-05-14 20:02:59] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2021-05-14 20:02:59] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 0 ms to minimize.
[2021-05-14 20:02:59] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2021-05-14 20:02:59] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 0 ms to minimize.
[2021-05-14 20:02:59] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2021-05-14 20:02:59] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 0 ms to minimize.
[2021-05-14 20:02:59] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
[2021-05-14 20:03:00] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2021-05-14 20:03:00] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2021-05-14 20:03:00] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2021-05-14 20:03:00] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 0 ms to minimize.
[2021-05-14 20:03:00] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 0 ms to minimize.
[2021-05-14 20:03:00] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 0 ms to minimize.
[2021-05-14 20:03:00] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 0 ms to minimize.
[2021-05-14 20:03:00] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 0 ms to minimize.
[2021-05-14 20:03:00] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 0 ms to minimize.
[2021-05-14 20:03:00] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 0 ms to minimize.
[2021-05-14 20:03:00] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
[2021-05-14 20:03:00] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2021-05-14 20:03:01] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
[2021-05-14 20:03:01] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 0 ms to minimize.
[2021-05-14 20:03:01] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2021-05-14 20:03:01] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2021-05-14 20:03:01] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 0 ms to minimize.
[2021-05-14 20:03:01] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2021-05-14 20:03:01] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2021-05-14 20:03:01] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 0 ms to minimize.
[2021-05-14 20:03:01] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 0 ms to minimize.
[2021-05-14 20:03:01] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 0 ms to minimize.
[2021-05-14 20:03:01] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2021-05-14 20:03:02] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 0 ms to minimize.
[2021-05-14 20:03:02] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 0 ms to minimize.
[2021-05-14 20:03:02] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 0 ms to minimize.
[2021-05-14 20:03:02] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 0 ms to minimize.
[2021-05-14 20:03:02] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2021-05-14 20:03:02] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 0 ms to minimize.
[2021-05-14 20:03:02] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2021-05-14 20:03:02] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2021-05-14 20:03:02] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 0 ms to minimize.
[2021-05-14 20:03:03] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 0 ms to minimize.
[2021-05-14 20:03:03] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2021-05-14 20:03:03] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2021-05-14 20:03:03] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 0 ms to minimize.
[2021-05-14 20:03:03] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2021-05-14 20:03:03] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 0 ms to minimize.
[2021-05-14 20:03:03] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2021-05-14 20:03:03] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2021-05-14 20:03:03] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2021-05-14 20:03:03] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 0 ms to minimize.
[2021-05-14 20:03:03] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 0 ms to minimize.
[2021-05-14 20:03:03] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2021-05-14 20:03:04] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 0 ms to minimize.
[2021-05-14 20:03:04] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 0 ms to minimize.
[2021-05-14 20:03:04] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2021-05-14 20:03:04] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 0 ms to minimize.
[2021-05-14 20:03:04] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 0 ms to minimize.
[2021-05-14 20:03:04] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 0 ms to minimize.
[2021-05-14 20:03:04] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 0 ms to minimize.
[2021-05-14 20:03:04] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 0 ms to minimize.
[2021-05-14 20:03:04] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2021-05-14 20:03:04] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 0 ms to minimize.
[2021-05-14 20:03:04] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2021-05-14 20:03:05] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2021-05-14 20:03:05] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2021-05-14 20:03:05] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2021-05-14 20:03:05] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2021-05-14 20:03:05] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 0 ms to minimize.
[2021-05-14 20:03:05] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2021-05-14 20:03:05] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2021-05-14 20:03:05] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2021-05-14 20:03:05] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 0 ms to minimize.
[2021-05-14 20:03:05] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 0 ms to minimize.
[2021-05-14 20:03:05] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 0 ms to minimize.
[2021-05-14 20:03:06] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2021-05-14 20:03:06] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2021-05-14 20:03:06] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 0 ms to minimize.
[2021-05-14 20:03:06] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2021-05-14 20:03:06] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2021-05-14 20:03:06] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 0 ms to minimize.
[2021-05-14 20:03:06] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2021-05-14 20:03:06] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 0 ms to minimize.
[2021-05-14 20:03:06] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 0 ms to minimize.
[2021-05-14 20:03:07] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 0 ms to minimize.
[2021-05-14 20:03:07] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 0 ms to minimize.
[2021-05-14 20:03:07] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 0 ms to minimize.
[2021-05-14 20:03:07] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 0 ms to minimize.
[2021-05-14 20:03:07] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2021-05-14 20:03:07] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2021-05-14 20:03:07] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2021-05-14 20:03:08] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 0 ms to minimize.
[2021-05-14 20:03:08] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2021-05-14 20:03:08] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 0 ms to minimize.
[2021-05-14 20:03:08] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2021-05-14 20:03:08] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2021-05-14 20:03:08] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 0 ms to minimize.
[2021-05-14 20:03:08] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 0 ms to minimize.
[2021-05-14 20:03:08] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 0 ms to minimize.
[2021-05-14 20:03:09] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2021-05-14 20:03:09] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2021-05-14 20:03:40] [INFO ] Deduced a trap composed of 2 places in 120 ms of which 0 ms to minimize.
[2021-05-14 20:03:40] [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) : [6] Max seen :[1]
Support contains 6 out of 264 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 264/264 places, 678/678 transitions.
Applied a total of 0 rules in 29 ms. Remains 264 /264 variables (removed 0) and now considering 678/678 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 264/264 places, 678/678 transitions.
Starting structural reductions, iteration 0 : 264/264 places, 678/678 transitions.
Applied a total of 0 rules in 13 ms. Remains 264 /264 variables (removed 0) and now considering 678/678 (removed 0) transitions.
[2021-05-14 20:03:40] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2021-05-14 20:03:40] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-14 20:03:40] [INFO ] Implicit Places using invariants in 185 ms returned []
[2021-05-14 20:03:40] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2021-05-14 20:03:40] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-14 20:03:41] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 20:03:41] [INFO ] Implicit Places using invariants and state equation in 787 ms returned []
Implicit Place search using SMT with State Equation took 999 ms to find 0 implicit places.
[2021-05-14 20:03:41] [INFO ] Redundant transitions in 4 ms returned []
[2021-05-14 20:03:41] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2021-05-14 20:03:41] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 20:03:42] [INFO ] Dead Transitions using invariants and state equation in 318 ms returned []
Finished structural reductions, in 1 iterations. Remains : 264/264 places, 678/678 transitions.
Ending property specific reduction for Peterson-PT-5-UpperBounds-00 in 55198 ms.
Starting property specific reduction for Peterson-PT-5-UpperBounds-13
Normalized transition count is 560 out of 680 initially.
// Phase 1: matrix 560 rows 266 cols
[2021-05-14 20:03:42] [INFO ] Computed 17 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2021-05-14 20:03:42] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 266 cols
[2021-05-14 20:03:42] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 20:03:42] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2021-05-14 20:03:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:03:42] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2021-05-14 20:03:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:03:42] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2021-05-14 20:03:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:03:42] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2021-05-14 20:03:42] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 20:03:42] [INFO ] [Nat]Added 230 Read/Feed constraints in 24 ms returned sat
[2021-05-14 20:03:42] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2021-05-14 20:03:42] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2021-05-14 20:03:42] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 0 ms to minimize.
[2021-05-14 20:03:42] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 0 ms to minimize.
[2021-05-14 20:03:43] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2021-05-14 20:03:43] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2021-05-14 20:03:43] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 0 ms to minimize.
[2021-05-14 20:03:43] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 0 ms to minimize.
[2021-05-14 20:03:43] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2021-05-14 20:03:43] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 0 ms to minimize.
[2021-05-14 20:03:43] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 0 ms to minimize.
[2021-05-14 20:03:43] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 0 ms to minimize.
[2021-05-14 20:03:43] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 0 ms to minimize.
[2021-05-14 20:03:43] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1134 ms
[2021-05-14 20:03:43] [INFO ] Computed and/alt/rep : 494/1550/494 causal constraints (skipped 60 transitions) in 28 ms.
[2021-05-14 20:03:45] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2021-05-14 20:03:45] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2021-05-14 20:03:45] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2021-05-14 20:03:45] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2021-05-14 20:03:46] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2021-05-14 20:03:46] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 0 ms to minimize.
[2021-05-14 20:03:46] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 0 ms to minimize.
[2021-05-14 20:03:46] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
[2021-05-14 20:03:46] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 0 ms to minimize.
[2021-05-14 20:03:46] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 0 ms to minimize.
[2021-05-14 20:03:46] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 0 ms to minimize.
[2021-05-14 20:03:46] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2021-05-14 20:03:47] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1459 ms
[2021-05-14 20:03:47] [INFO ] Added : 336 causal constraints over 68 iterations in 3396 ms. Result :sat
Minimization took 130 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 64600 steps, including 998 resets, run finished after 163 ms. (steps per millisecond=396 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 266 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 266/266 places, 679/679 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 265 transition count 677
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 264 transition count 675
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 263 transition count 673
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 3 place count 263 transition count 667
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 15 place count 257 transition count 667
Applied a total of 15 rules in 19 ms. Remains 257 /266 variables (removed 9) and now considering 667/679 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 257/266 places, 667/679 transitions.
Normalized transition count is 547 out of 667 initially.
// Phase 1: matrix 547 rows 257 cols
[2021-05-14 20:03:47] [INFO ] Computed 17 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2436 ms. (steps per millisecond=410 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 645 ms. (steps per millisecond=1550 ) properties (out of 1) seen :0
[2021-05-14 20:03:50] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
// Phase 1: matrix 547 rows 257 cols
[2021-05-14 20:03:50] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 20:03:50] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2021-05-14 20:03:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:03:50] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2021-05-14 20:03:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:03:50] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2021-05-14 20:03:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:03:50] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2021-05-14 20:03:50] [INFO ] State equation strengthened by 227 read => feed constraints.
[2021-05-14 20:03:50] [INFO ] [Nat]Added 227 Read/Feed constraints in 23 ms returned sat
[2021-05-14 20:03:50] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 0 ms to minimize.
[2021-05-14 20:03:51] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 0 ms to minimize.
[2021-05-14 20:03:51] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 0 ms to minimize.
[2021-05-14 20:03:51] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 0 ms to minimize.
[2021-05-14 20:03:51] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 0 ms to minimize.
[2021-05-14 20:03:51] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2021-05-14 20:03:51] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 0 ms to minimize.
[2021-05-14 20:03:51] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2021-05-14 20:03:51] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 0 ms to minimize.
[2021-05-14 20:03:51] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2021-05-14 20:03:51] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 0 ms to minimize.
[2021-05-14 20:03:51] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2021-05-14 20:03:52] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 0 ms to minimize.
[2021-05-14 20:03:52] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2021-05-14 20:03:52] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2021-05-14 20:03:52] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2021-05-14 20:03:52] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 0 ms to minimize.
[2021-05-14 20:03:52] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2021-05-14 20:03:52] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2021-05-14 20:03:52] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2021-05-14 20:03:52] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2021-05-14 20:03:52] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 0 ms to minimize.
[2021-05-14 20:03:52] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2021-05-14 20:03:52] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2082 ms
[2021-05-14 20:03:52] [INFO ] Computed and/alt/rep : 481/1533/481 causal constraints (skipped 60 transitions) in 29 ms.
[2021-05-14 20:03:55] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2021-05-14 20:03:55] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 0 ms to minimize.
[2021-05-14 20:03:56] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2021-05-14 20:03:56] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 0 ms to minimize.
[2021-05-14 20:03:56] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 0 ms to minimize.
[2021-05-14 20:03:56] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2021-05-14 20:03:56] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2021-05-14 20:03:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 800 ms
[2021-05-14 20:03:56] [INFO ] Added : 464 causal constraints over 94 iterations in 3731 ms. Result :sat
Minimization took 212 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 54500 steps, including 994 resets, run finished after 146 ms. (steps per millisecond=373 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 257/257 places, 667/667 transitions.
Applied a total of 0 rules in 10 ms. Remains 257 /257 variables (removed 0) and now considering 667/667 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 257/257 places, 667/667 transitions.
Starting structural reductions, iteration 0 : 257/257 places, 667/667 transitions.
Applied a total of 0 rules in 11 ms. Remains 257 /257 variables (removed 0) and now considering 667/667 (removed 0) transitions.
[2021-05-14 20:03:57] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
// Phase 1: matrix 547 rows 257 cols
[2021-05-14 20:03:57] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-14 20:03:57] [INFO ] Implicit Places using invariants in 394 ms returned []
[2021-05-14 20:03:57] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
// Phase 1: matrix 547 rows 257 cols
[2021-05-14 20:03:57] [INFO ] Computed 17 place invariants in 9 ms
[2021-05-14 20:03:57] [INFO ] State equation strengthened by 227 read => feed constraints.
[2021-05-14 20:03:58] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 1109 ms to find 0 implicit places.
[2021-05-14 20:03:58] [INFO ] Redundant transitions in 4 ms returned []
[2021-05-14 20:03:58] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
// Phase 1: matrix 547 rows 257 cols
[2021-05-14 20:03:58] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-14 20:03:58] [INFO ] Dead Transitions using invariants and state equation in 265 ms returned []
Finished structural reductions, in 1 iterations. Remains : 257/257 places, 667/667 transitions.
Ending property specific reduction for Peterson-PT-5-UpperBounds-13 in 16320 ms.
[2021-05-14 20:03:58] [INFO ] Flatten gal took : 91 ms
[2021-05-14 20:03:58] [INFO ] Applying decomposition
[2021-05-14 20:03:58] [INFO ] Flatten gal took : 38 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/graph15178772199095384539.txt, -o, /tmp/graph15178772199095384539.bin, -w, /tmp/graph15178772199095384539.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/graph15178772199095384539.bin, -l, -1, -v, -w, /tmp/graph15178772199095384539.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 20:03:58] [INFO ] Decomposing Gal with order
[2021-05-14 20:03:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 20:03:59] [INFO ] Removed a total of 914 redundant transitions.
[2021-05-14 20:03:59] [INFO ] Flatten gal took : 126 ms
[2021-05-14 20:03:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 260 labels/synchronizations in 23 ms.
[2021-05-14 20:04:00] [INFO ] Time to serialize gal into /tmp/UpperBounds2330136312001815325.gal : 14 ms
[2021-05-14 20:04:00] [INFO ] Time to serialize properties into /tmp/UpperBounds409113550862334441.prop : 1 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/UpperBounds2330136312001815325.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds409113550862334441.prop, --nowitness, --gen-order, FOLLOW], 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/UpperBounds2330136312001815325.gal -t CGAL -reachable-file /tmp/UpperBounds409113550862334441.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds409113550862334441.prop.
Detected timeout of ITS tools.
[2021-05-14 20:25:40] [INFO ] Applying decomposition
[2021-05-14 20:25:40] [INFO ] Flatten gal took : 189 ms
[2021-05-14 20:25:40] [INFO ] Decomposing Gal with order
[2021-05-14 20:25:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 20:25:40] [INFO ] Removed a total of 783 redundant transitions.
[2021-05-14 20:25:41] [INFO ] Flatten gal took : 298 ms
[2021-05-14 20:25:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 375 labels/synchronizations in 40 ms.
[2021-05-14 20:25:41] [INFO ] Time to serialize gal into /tmp/UpperBounds15217985885299869346.gal : 13 ms
[2021-05-14 20:25:41] [INFO ] Time to serialize properties into /tmp/UpperBounds6789934197996203382.prop : 1 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/UpperBounds15217985885299869346.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds6789934197996203382.prop, --nowitness, --gen-order, FOLLOW], 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/UpperBounds15217985885299869346.gal -t CGAL -reachable-file /tmp/UpperBounds6789934197996203382.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds6789934197996203382.prop.
Detected timeout of ITS tools.
[2021-05-14 20:47:20] [INFO ] Flatten gal took : 207 ms
[2021-05-14 20:47:21] [INFO ] Input system was already deterministic with 680 transitions.
[2021-05-14 20:47:21] [INFO ] Transformed 266 places.
[2021-05-14 20:47:21] [INFO ] Transformed 680 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-14 20:47:21] [INFO ] Time to serialize gal into /tmp/UpperBounds2567890091745821368.gal : 45 ms
[2021-05-14 20:47:21] [INFO ] Time to serialize properties into /tmp/UpperBounds9835308521836363606.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/UpperBounds2567890091745821368.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds9835308521836363606.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], 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/UpperBounds2567890091745821368.gal -t CGAL -reachable-file /tmp/UpperBounds9835308521836363606.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds9835308521836363606.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-5"
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-5, 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-162089128200627"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-5.tgz
mv Peterson-PT-5 execution
cd execution
if [ "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 ;