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 |
| 13105.907 | 3179526.00 | 3476342.00 | 9420.60 | 6 6 6 6 5 6 6 1 1 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/mcc2024-input.r268-smll-171654407300277.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Peterson-PT-5, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654407300277
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 110K Apr 12 02:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 458K Apr 12 02:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 107K Apr 12 02:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 475K Apr 12 02:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 47K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 135K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 173K Apr 12 03:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 733K Apr 12 03:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 289K Apr 12 03:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 12 03:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 535K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of 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 1716774592355
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-5
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-27 01:49:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 01:49:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 01:49:54] [INFO ] Load time of PNML (sax parser for PT used): 312 ms
[2024-05-27 01:49:54] [INFO ] Transformed 834 places.
[2024-05-27 01:49:54] [INFO ] Transformed 1242 transitions.
[2024-05-27 01:49:54] [INFO ] Found NUPN structural information;
[2024-05-27 01:49:54] [INFO ] Parsed PT model containing 834 places and 1242 transitions and 3828 arcs in 496 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 154 ms.
Reduction of identical properties reduced properties to check from 16 to 14
FORMULA Peterson-PT-5-UpperBounds-01 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 6, 0, 0, 0, 1, 0, 0, 0, 0, 0] Max Struct:[30, 30, 150, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA Peterson-PT-5-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[30, 30, 150, 6, 1, 1, 1, 1, 1, 1, 1]
[2024-05-27 01:49:54] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-05-27 01:49:54] [INFO ] Computed 23 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[30, 30, 150, 6, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 117 ms. (84 steps per ms)
FORMULA Peterson-PT-5-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-5-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-5-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-5-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-5-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (12 resets) in 134 ms. (444 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 5, 6, 1, 0, 0] Max Struct:[30, 30, 150, 6, 1, 1]
[2024-05-27 01:49:55] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-27 01:49:55] [INFO ] Invariant cache hit.
[2024-05-27 01:49:55] [INFO ] [Real]Absence check using 17 positive place invariants in 30 ms returned unsat
[2024-05-27 01:49:56] [INFO ] [Real]Absence check using 17 positive place invariants in 31 ms returned sat
[2024-05-27 01:49:56] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 12 ms returned sat
[2024-05-27 01:49:56] [INFO ] [Real]Absence check using state equation in 644 ms returned sat
[2024-05-27 01:49:57] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-27 01:49:57] [INFO ] [Real]Added 205 Read/Feed constraints in 92 ms returned sat
[2024-05-27 01:49:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:49:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 33 ms returned sat
[2024-05-27 01:49:57] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-27 01:49:58] [INFO ] [Nat]Absence check using state equation in 657 ms returned sat
[2024-05-27 01:49:58] [INFO ] [Nat]Added 205 Read/Feed constraints in 211 ms returned sat
[2024-05-27 01:49:59] [INFO ] Deduced a trap composed of 32 places in 567 ms of which 81 ms to minimize.
[2024-05-27 01:49:59] [INFO ] Deduced a trap composed of 26 places in 504 ms of which 8 ms to minimize.
[2024-05-27 01:50:00] [INFO ] Deduced a trap composed of 11 places in 490 ms of which 8 ms to minimize.
[2024-05-27 01:50:00] [INFO ] Deduced a trap composed of 15 places in 619 ms of which 7 ms to minimize.
[2024-05-27 01:50:01] [INFO ] Deduced a trap composed of 13 places in 597 ms of which 7 ms to minimize.
[2024-05-27 01:50:02] [INFO ] Deduced a trap composed of 15 places in 592 ms of which 6 ms to minimize.
[2024-05-27 01:50:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 3726 ms
[2024-05-27 01:50:02] [INFO ] [Real]Absence check using 17 positive place invariants in 28 ms returned unsat
[2024-05-27 01:50:02] [INFO ] [Real]Absence check using 17 positive place invariants in 27 ms returned sat
[2024-05-27 01:50:02] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-27 01:50:03] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2024-05-27 01:50:03] [INFO ] [Real]Added 205 Read/Feed constraints in 57 ms returned sat
[2024-05-27 01:50:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:50:03] [INFO ] [Nat]Absence check using 17 positive place invariants in 27 ms returned sat
[2024-05-27 01:50:03] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-27 01:50:03] [INFO ] [Nat]Absence check using state equation in 469 ms returned sat
[2024-05-27 01:50:04] [INFO ] [Nat]Added 205 Read/Feed constraints in 223 ms returned sat
[2024-05-27 01:50:04] [INFO ] Deduced a trap composed of 11 places in 538 ms of which 7 ms to minimize.
[2024-05-27 01:50:05] [INFO ] Deduced a trap composed of 37 places in 646 ms of which 7 ms to minimize.
[2024-05-27 01:50:06] [INFO ] Deduced a trap composed of 69 places in 534 ms of which 7 ms to minimize.
[2024-05-27 01:50:06] [INFO ] Deduced a trap composed of 22 places in 550 ms of which 7 ms to minimize.
[2024-05-27 01:50:07] [INFO ] Deduced a trap composed of 11 places in 555 ms of which 7 ms to minimize.
[2024-05-27 01:50:07] [INFO ] Deduced a trap composed of 47 places in 600 ms of which 6 ms to minimize.
[2024-05-27 01:50:08] [INFO ] Deduced a trap composed of 20 places in 459 ms of which 6 ms to minimize.
[2024-05-27 01:50:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-27 01:50:08] [INFO ] [Real]Absence check using 17 positive place invariants in 27 ms returned sat
[2024-05-27 01:50:08] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-27 01:50:09] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2024-05-27 01:50:09] [INFO ] [Real]Added 205 Read/Feed constraints in 31 ms returned sat
[2024-05-27 01:50:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:50:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 26 ms returned sat
[2024-05-27 01:50:09] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-27 01:50:10] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2024-05-27 01:50:10] [INFO ] [Nat]Added 205 Read/Feed constraints in 34 ms returned sat
[2024-05-27 01:50:10] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 110 ms.
[2024-05-27 01:50:14] [INFO ] Deduced a trap composed of 116 places in 528 ms of which 6 ms to minimize.
[2024-05-27 01:50:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-27 01:50:14] [INFO ] [Real]Absence check using 17 positive place invariants in 27 ms returned sat
[2024-05-27 01:50:14] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-27 01:50:15] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2024-05-27 01:50:15] [INFO ] [Real]Added 205 Read/Feed constraints in 25 ms returned sat
[2024-05-27 01:50:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:50:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 27 ms returned sat
[2024-05-27 01:50:15] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-27 01:50:15] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2024-05-27 01:50:16] [INFO ] [Nat]Added 205 Read/Feed constraints in 26 ms returned sat
[2024-05-27 01:50:16] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 97 ms.
[2024-05-27 01:50:16] [INFO ] Added : 18 causal constraints over 4 iterations in 455 ms. Result :sat
Minimization took 582 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 5, 6, 1, 0, 0] Max Struct:[6, 5, 6, 6, 1, 1]
FORMULA Peterson-PT-5-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[6, 1, 1]
Support contains 8 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 357 transitions
Trivial Post-agglo rules discarded 357 transitions
Performed 357 trivial Post agglomeration. Transition count delta: 357
Iterating post reduction 0 with 357 rules applied. Total rules applied 357 place count 834 transition count 885
Reduce places removed 357 places and 0 transitions.
Iterating post reduction 1 with 357 rules applied. Total rules applied 714 place count 477 transition count 885
Performed 174 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 174 Pre rules applied. Total rules applied 714 place count 477 transition count 711
Deduced a syphon composed of 174 places in 2 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 2 with 348 rules applied. Total rules applied 1062 place count 303 transition count 711
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 2 with 60 rules applied. Total rules applied 1122 place count 273 transition count 681
Applied a total of 1122 rules in 177 ms. Remains 273 /834 variables (removed 561) and now considering 681/1242 (removed 561) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 273/834 places, 681/1242 transitions.
[2024-05-27 01:50:17] [INFO ] Flow matrix only has 561 transitions (discarded 120 similar events)
// Phase 1: matrix 561 rows 273 cols
[2024-05-27 01:50:17] [INFO ] Computed 23 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[6, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1917 ms. (521 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 1903 ms. (1575 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0] Max Struct:[6, 1, 1]
[2024-05-27 01:50:21] [INFO ] Flow matrix only has 561 transitions (discarded 120 similar events)
[2024-05-27 01:50:21] [INFO ] Invariant cache hit.
[2024-05-27 01:50:21] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-27 01:50:21] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-27 01:50:21] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2024-05-27 01:50:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-27 01:50:21] [INFO ] [Real]Added 205 Read/Feed constraints in 30 ms returned sat
[2024-05-27 01:50:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:50:21] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-27 01:50:21] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-27 01:50:21] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2024-05-27 01:50:21] [INFO ] [Nat]Added 205 Read/Feed constraints in 55 ms returned sat
[2024-05-27 01:50:21] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 3 ms to minimize.
[2024-05-27 01:50:22] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 3 ms to minimize.
[2024-05-27 01:50:22] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 3 ms to minimize.
[2024-05-27 01:50:22] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 3 ms to minimize.
[2024-05-27 01:50:22] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 3 ms to minimize.
[2024-05-27 01:50:22] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 6 ms to minimize.
[2024-05-27 01:50:23] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 3 ms to minimize.
[2024-05-27 01:50:23] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 3 ms to minimize.
[2024-05-27 01:50:23] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 3 ms to minimize.
[2024-05-27 01:50:23] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 2 ms to minimize.
[2024-05-27 01:50:23] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 5 ms to minimize.
[2024-05-27 01:50:24] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 2 ms to minimize.
[2024-05-27 01:50:24] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 3 ms to minimize.
[2024-05-27 01:50:24] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 2 ms to minimize.
[2024-05-27 01:50:24] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 2 ms to minimize.
[2024-05-27 01:50:24] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 3 ms to minimize.
[2024-05-27 01:50:25] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 2 ms to minimize.
[2024-05-27 01:50:25] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 2 ms to minimize.
[2024-05-27 01:50:25] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 2 ms to minimize.
[2024-05-27 01:50:25] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-27 01:50:25] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 6 ms to minimize.
[2024-05-27 01:50:25] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-27 01:50:26] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 3 ms to minimize.
[2024-05-27 01:50:26] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 2 ms to minimize.
[2024-05-27 01:50:26] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 2 ms to minimize.
[2024-05-27 01:50:26] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2024-05-27 01:50:26] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 3 ms to minimize.
[2024-05-27 01:50:26] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 3 ms to minimize.
[2024-05-27 01:50:27] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 2 ms to minimize.
[2024-05-27 01:50:27] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 2 ms to minimize.
[2024-05-27 01:50:27] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 2 ms to minimize.
[2024-05-27 01:50:27] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 3 ms to minimize.
[2024-05-27 01:50:27] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 3 ms to minimize.
[2024-05-27 01:50:27] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 2 ms to minimize.
[2024-05-27 01:50:27] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 2 ms to minimize.
[2024-05-27 01:50:28] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 2 ms to minimize.
[2024-05-27 01:50:28] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 2 ms to minimize.
[2024-05-27 01:50:28] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 2 ms to minimize.
[2024-05-27 01:50:28] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 3 ms to minimize.
[2024-05-27 01:50:28] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 3 ms to minimize.
[2024-05-27 01:50:29] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 2 ms to minimize.
[2024-05-27 01:50:29] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 2 ms to minimize.
[2024-05-27 01:50:29] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 2 ms to minimize.
[2024-05-27 01:50:29] [INFO ] Deduced a trap composed of 60 places in 121 ms of which 2 ms to minimize.
[2024-05-27 01:50:29] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 2 ms to minimize.
[2024-05-27 01:50:29] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-05-27 01:50:31] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 2 ms to minimize.
[2024-05-27 01:50:31] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
[2024-05-27 01:50:33] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 2 ms to minimize.
[2024-05-27 01:50:34] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 3 ms to minimize.
[2024-05-27 01:50:34] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 3 ms to minimize.
[2024-05-27 01:50:34] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
[2024-05-27 01:50:34] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 2 ms to minimize.
[2024-05-27 01:50:34] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-05-27 01:50:35] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 2 ms to minimize.
[2024-05-27 01:50:35] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 3 ms to minimize.
[2024-05-27 01:50:35] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 2 ms to minimize.
[2024-05-27 01:50:35] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 2 ms to minimize.
[2024-05-27 01:50:36] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 2 ms to minimize.
[2024-05-27 01:50:36] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 2 ms to minimize.
[2024-05-27 01:50:36] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 2 ms to minimize.
[2024-05-27 01:50:36] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 2 ms to minimize.
[2024-05-27 01:50:36] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-05-27 01:50:36] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-05-27 01:50:37] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 3 ms to minimize.
[2024-05-27 01:50:37] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-05-27 01:50:37] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 3 ms to minimize.
[2024-05-27 01:50:37] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 2 ms to minimize.
[2024-05-27 01:50:37] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
[2024-05-27 01:50:38] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-05-27 01:50:39] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-05-27 01:50:39] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-05-27 01:50:39] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2024-05-27 01:50:40] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-05-27 01:50:40] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-05-27 01:50:42] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 3 ms to minimize.
[2024-05-27 01:50:42] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 2 ms to minimize.
[2024-05-27 01:50:42] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 2 ms to minimize.
[2024-05-27 01:50:42] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 3 ms to minimize.
[2024-05-27 01:50:43] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-05-27 01:50:43] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 1 ms to minimize.
[2024-05-27 01:50:43] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 3 ms to minimize.
[2024-05-27 01:50:43] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 3 ms to minimize.
[2024-05-27 01:50:43] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 3 ms to minimize.
[2024-05-27 01:50:44] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 3 ms to minimize.
[2024-05-27 01:50:44] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
[2024-05-27 01:50:44] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 2 ms to minimize.
[2024-05-27 01:50:44] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 2 ms to minimize.
[2024-05-27 01:50:45] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-27 01:50:45] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 2 ms to minimize.
[2024-05-27 01:50:46] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 2 ms to minimize.
[2024-05-27 01:50:46] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 2 ms to minimize.
[2024-05-27 01:50:49] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 2 ms to minimize.
[2024-05-27 01:50:49] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 2 ms to minimize.
[2024-05-27 01:50:50] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 3 ms to minimize.
[2024-05-27 01:50:50] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2024-05-27 01:50:50] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:50:50] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 2 ms to minimize.
[2024-05-27 01:50:50] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 2 ms to minimize.
[2024-05-27 01:50:50] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-05-27 01:50:50] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 2 ms to minimize.
[2024-05-27 01:50:51] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:50:52] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 3 ms to minimize.
[2024-05-27 01:50:52] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-05-27 01:50:52] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2024-05-27 01:50:52] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2024-05-27 01:50:53] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 2 ms to minimize.
[2024-05-27 01:50:53] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 2 ms to minimize.
[2024-05-27 01:50:53] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 2 ms to minimize.
[2024-05-27 01:50:53] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 3 ms to minimize.
[2024-05-27 01:50:53] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 2 ms to minimize.
[2024-05-27 01:50:54] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-05-27 01:50:55] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-27 01:50:55] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2024-05-27 01:50:58] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 3 ms to minimize.
[2024-05-27 01:50:58] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 2 ms to minimize.
[2024-05-27 01:50:59] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-27 01:50:59] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:50:59] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-05-27 01:50:59] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 2 ms to minimize.
[2024-05-27 01:51:00] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-27 01:51:00] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 1 ms to minimize.
[2024-05-27 01:51:00] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 2 ms to minimize.
[2024-05-27 01:51:02] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-05-27 01:51:04] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 2 ms to minimize.
[2024-05-27 01:51:04] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2024-05-27 01:51:05] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 2 ms to minimize.
[2024-05-27 01:51:05] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
[2024-05-27 01:51:05] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 3 ms to minimize.
[2024-05-27 01:51:05] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
[2024-05-27 01:51:06] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 2 ms to minimize.
[2024-05-27 01:51:06] [INFO ] Trap strengthening (SAT) tested/added 131/131 trap constraints in 44679 ms
[2024-05-27 01:51:06] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-27 01:51:06] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-27 01:51:06] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-05-27 01:51:06] [INFO ] [Real]Added 205 Read/Feed constraints in 24 ms returned sat
[2024-05-27 01:51:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:51:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-27 01:51:06] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-27 01:51:07] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2024-05-27 01:51:07] [INFO ] [Nat]Added 205 Read/Feed constraints in 26 ms returned sat
[2024-05-27 01:51:07] [INFO ] Computed and/alt/rep : 495/1551/495 causal constraints (skipped 60 transitions) in 52 ms.
[2024-05-27 01:51:07] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 3 ms to minimize.
[2024-05-27 01:51:08] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 3 ms to minimize.
[2024-05-27 01:51:08] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 3 ms to minimize.
[2024-05-27 01:51:08] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 2 ms to minimize.
[2024-05-27 01:51:08] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 2 ms to minimize.
[2024-05-27 01:51:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 936 ms
[2024-05-27 01:51:08] [INFO ] Added : 80 causal constraints over 17 iterations in 1619 ms. Result :sat
Minimization took 155 ms.
[2024-05-27 01:51:09] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-27 01:51:09] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-27 01:51:09] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2024-05-27 01:51:09] [INFO ] [Real]Added 205 Read/Feed constraints in 23 ms returned sat
[2024-05-27 01:51:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:51:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-27 01:51:09] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-27 01:51:09] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2024-05-27 01:51:09] [INFO ] [Nat]Added 205 Read/Feed constraints in 25 ms returned sat
[2024-05-27 01:51:09] [INFO ] Computed and/alt/rep : 495/1551/495 causal constraints (skipped 60 transitions) in 50 ms.
[2024-05-27 01:51:09] [INFO ] Added : 5 causal constraints over 1 iterations in 129 ms. Result :sat
Minimization took 125 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0] Max Struct:[6, 1, 1]
FORMULA Peterson-PT-5-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0] Max Struct:[6, 1]
Support contains 7 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 681/681 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 273 transition count 680
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 272 transition count 680
Applied a total of 2 rules in 33 ms. Remains 272 /273 variables (removed 1) and now considering 680/681 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 272/273 places, 680/681 transitions.
[2024-05-27 01:51:10] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 272 cols
[2024-05-27 01:51:10] [INFO ] Computed 23 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0] Max Struct:[6, 1]
RANDOM walk for 1000000 steps (2 resets) in 1785 ms. (559 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 1255 ms. (1592 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0] Max Struct:[6, 1]
[2024-05-27 01:51:13] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2024-05-27 01:51:13] [INFO ] Invariant cache hit.
[2024-05-27 01:51:13] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-27 01:51:13] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-27 01:51:13] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2024-05-27 01:51:13] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-27 01:51:13] [INFO ] [Real]Added 205 Read/Feed constraints in 24 ms returned sat
[2024-05-27 01:51:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:51:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-27 01:51:13] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-27 01:51:13] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2024-05-27 01:51:13] [INFO ] [Nat]Added 205 Read/Feed constraints in 43 ms returned sat
[2024-05-27 01:51:14] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 2 ms to minimize.
[2024-05-27 01:51:14] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 3 ms to minimize.
[2024-05-27 01:51:14] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 3 ms to minimize.
[2024-05-27 01:51:14] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 3 ms to minimize.
[2024-05-27 01:51:14] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 2 ms to minimize.
[2024-05-27 01:51:14] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 2 ms to minimize.
[2024-05-27 01:51:15] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 2 ms to minimize.
[2024-05-27 01:51:15] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 3 ms to minimize.
[2024-05-27 01:51:15] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 2 ms to minimize.
[2024-05-27 01:51:15] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 2 ms to minimize.
[2024-05-27 01:51:15] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 3 ms to minimize.
[2024-05-27 01:51:15] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 2 ms to minimize.
[2024-05-27 01:51:16] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 3 ms to minimize.
[2024-05-27 01:51:16] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 3 ms to minimize.
[2024-05-27 01:51:16] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 3 ms to minimize.
[2024-05-27 01:51:16] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 2 ms to minimize.
[2024-05-27 01:51:16] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 3 ms to minimize.
[2024-05-27 01:51:16] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 2 ms to minimize.
[2024-05-27 01:51:17] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 2 ms to minimize.
[2024-05-27 01:51:17] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 3 ms to minimize.
[2024-05-27 01:51:17] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 2 ms to minimize.
[2024-05-27 01:51:17] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 2 ms to minimize.
[2024-05-27 01:51:17] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 2 ms to minimize.
[2024-05-27 01:51:18] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 2 ms to minimize.
[2024-05-27 01:51:18] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2024-05-27 01:51:18] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 2 ms to minimize.
[2024-05-27 01:51:18] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 2 ms to minimize.
[2024-05-27 01:51:18] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 2 ms to minimize.
[2024-05-27 01:51:19] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 3 ms to minimize.
[2024-05-27 01:51:19] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 3 ms to minimize.
[2024-05-27 01:51:19] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 3 ms to minimize.
[2024-05-27 01:51:19] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-27 01:51:19] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2024-05-27 01:51:19] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 2 ms to minimize.
[2024-05-27 01:51:20] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 3 ms to minimize.
[2024-05-27 01:51:20] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 2 ms to minimize.
[2024-05-27 01:51:20] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2024-05-27 01:51:20] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 2 ms to minimize.
[2024-05-27 01:51:20] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
[2024-05-27 01:51:21] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 2 ms to minimize.
[2024-05-27 01:51:21] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 2 ms to minimize.
[2024-05-27 01:51:22] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 2 ms to minimize.
[2024-05-27 01:51:22] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 2 ms to minimize.
[2024-05-27 01:51:22] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 2 ms to minimize.
[2024-05-27 01:51:22] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 2 ms to minimize.
[2024-05-27 01:51:23] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
[2024-05-27 01:51:23] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 2 ms to minimize.
[2024-05-27 01:51:23] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 2 ms to minimize.
[2024-05-27 01:51:23] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 3 ms to minimize.
[2024-05-27 01:51:23] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 3 ms to minimize.
[2024-05-27 01:51:24] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 3 ms to minimize.
[2024-05-27 01:51:24] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 2 ms to minimize.
[2024-05-27 01:51:24] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 2 ms to minimize.
[2024-05-27 01:51:24] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 2 ms to minimize.
[2024-05-27 01:51:24] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 3 ms to minimize.
[2024-05-27 01:51:24] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 2 ms to minimize.
[2024-05-27 01:51:24] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 2 ms to minimize.
[2024-05-27 01:51:25] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 2 ms to minimize.
[2024-05-27 01:51:25] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
[2024-05-27 01:51:25] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 2 ms to minimize.
[2024-05-27 01:51:25] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 2 ms to minimize.
[2024-05-27 01:51:26] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 2 ms to minimize.
[2024-05-27 01:51:26] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 4 ms to minimize.
[2024-05-27 01:51:26] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 2 ms to minimize.
[2024-05-27 01:51:27] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 2 ms to minimize.
[2024-05-27 01:51:28] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-27 01:51:28] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 2 ms to minimize.
[2024-05-27 01:51:28] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 2 ms to minimize.
[2024-05-27 01:51:28] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 2 ms to minimize.
[2024-05-27 01:51:28] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 2 ms to minimize.
[2024-05-27 01:51:29] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
[2024-05-27 01:51:29] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:51:29] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 2 ms to minimize.
[2024-05-27 01:51:29] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-05-27 01:51:31] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 2 ms to minimize.
[2024-05-27 01:51:31] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-05-27 01:51:31] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-05-27 01:51:31] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-27 01:51:32] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-27 01:51:33] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2024-05-27 01:51:35] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2024-05-27 01:51:35] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 2 ms to minimize.
[2024-05-27 01:51:35] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-05-27 01:51:35] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-27 01:51:35] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 3 ms to minimize.
[2024-05-27 01:51:36] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 2 ms to minimize.
[2024-05-27 01:51:36] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 2 ms to minimize.
[2024-05-27 01:51:36] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-05-27 01:51:37] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2024-05-27 01:51:37] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 2 ms to minimize.
[2024-05-27 01:51:37] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 2 ms to minimize.
[2024-05-27 01:51:37] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 3 ms to minimize.
[2024-05-27 01:51:37] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 2 ms to minimize.
[2024-05-27 01:51:38] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
[2024-05-27 01:51:38] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 2 ms to minimize.
[2024-05-27 01:51:38] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
[2024-05-27 01:51:38] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 2 ms to minimize.
[2024-05-27 01:51:38] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 3 ms to minimize.
[2024-05-27 01:51:38] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 4 ms to minimize.
[2024-05-27 01:51:39] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2024-05-27 01:51:39] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 2 ms to minimize.
[2024-05-27 01:51:39] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 3 ms to minimize.
[2024-05-27 01:51:39] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 3 ms to minimize.
[2024-05-27 01:51:39] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
[2024-05-27 01:51:39] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 2 ms to minimize.
[2024-05-27 01:51:40] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 5 ms to minimize.
[2024-05-27 01:51:40] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 3 ms to minimize.
[2024-05-27 01:51:40] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-27 01:51:40] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2024-05-27 01:51:40] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 2 ms to minimize.
[2024-05-27 01:51:40] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-05-27 01:51:41] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-05-27 01:51:41] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2024-05-27 01:51:41] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-05-27 01:51:42] [INFO ] Deduced a trap composed of 60 places in 139 ms of which 2 ms to minimize.
[2024-05-27 01:51:42] [INFO ] Deduced a trap composed of 71 places in 135 ms of which 3 ms to minimize.
[2024-05-27 01:51:42] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 2 ms to minimize.
[2024-05-27 01:51:42] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
[2024-05-27 01:51:42] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-05-27 01:51:43] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 2 ms to minimize.
[2024-05-27 01:51:43] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 2 ms to minimize.
[2024-05-27 01:51:43] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 2 ms to minimize.
[2024-05-27 01:51:44] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 1 ms to minimize.
[2024-05-27 01:51:44] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
[2024-05-27 01:51:48] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 2 ms to minimize.
[2024-05-27 01:51:49] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-27 01:51:51] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 2 ms to minimize.
[2024-05-27 01:51:51] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 1 ms to minimize.
[2024-05-27 01:51:51] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 2 ms to minimize.
[2024-05-27 01:51:53] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-27 01:51:56] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2024-05-27 01:51:58] [INFO ] Trap strengthening (SAT) tested/added 131/131 trap constraints in 44678 ms
[2024-05-27 01:51:58] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-27 01:51:58] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-27 01:51:58] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2024-05-27 01:51:58] [INFO ] [Real]Added 205 Read/Feed constraints in 26 ms returned sat
[2024-05-27 01:51:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:51:59] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-27 01:51:59] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-27 01:51:59] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2024-05-27 01:51:59] [INFO ] [Nat]Added 205 Read/Feed constraints in 29 ms returned sat
[2024-05-27 01:51:59] [INFO ] Computed and/alt/rep : 494/1550/494 causal constraints (skipped 60 transitions) in 52 ms.
[2024-05-27 01:51:59] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 3 ms to minimize.
[2024-05-27 01:52:00] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 3 ms to minimize.
[2024-05-27 01:52:00] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 2 ms to minimize.
[2024-05-27 01:52:00] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 2 ms to minimize.
[2024-05-27 01:52:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 736 ms
[2024-05-27 01:52:00] [INFO ] Added : 73 causal constraints over 15 iterations in 1366 ms. Result :sat
Minimization took 147 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0] Max Struct:[6, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0] Max Struct:[6, 1]
Support contains 7 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 680/680 transitions.
Applied a total of 0 rules in 23 ms. Remains 272 /272 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 272/272 places, 680/680 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 680/680 transitions.
Applied a total of 0 rules in 22 ms. Remains 272 /272 variables (removed 0) and now considering 680/680 (removed 0) transitions.
[2024-05-27 01:52:00] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2024-05-27 01:52:00] [INFO ] Invariant cache hit.
[2024-05-27 01:52:01] [INFO ] Implicit Places using invariants in 435 ms returned [231, 243, 244, 245, 246, 247]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 438 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 266/272 places, 680/680 transitions.
Applied a total of 0 rules in 23 ms. Remains 266 /266 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 491 ms. Remains : 266/272 places, 680/680 transitions.
[2024-05-27 01:52:01] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 266 cols
[2024-05-27 01:52:01] [INFO ] Computed 17 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0] Max Struct:[6, 1]
RANDOM walk for 1000000 steps (2 resets) in 1781 ms. (561 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 1231 ms. (1623 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0] Max Struct:[6, 1]
[2024-05-27 01:52:04] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2024-05-27 01:52:04] [INFO ] Invariant cache hit.
[2024-05-27 01:52:04] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-27 01:52:04] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2024-05-27 01:52:04] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-27 01:52:04] [INFO ] [Real]Added 205 Read/Feed constraints in 25 ms returned sat
[2024-05-27 01:52:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:52:04] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-27 01:52:05] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2024-05-27 01:52:05] [INFO ] [Nat]Added 205 Read/Feed constraints in 50 ms returned sat
[2024-05-27 01:52:05] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 2 ms to minimize.
[2024-05-27 01:52:05] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 2 ms to minimize.
[2024-05-27 01:52:05] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 2 ms to minimize.
[2024-05-27 01:52:05] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 2 ms to minimize.
[2024-05-27 01:52:06] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 3 ms to minimize.
[2024-05-27 01:52:06] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 2 ms to minimize.
[2024-05-27 01:52:06] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 3 ms to minimize.
[2024-05-27 01:52:06] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 2 ms to minimize.
[2024-05-27 01:52:06] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 2 ms to minimize.
[2024-05-27 01:52:06] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 2 ms to minimize.
[2024-05-27 01:52:07] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 3 ms to minimize.
[2024-05-27 01:52:07] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 2 ms to minimize.
[2024-05-27 01:52:07] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 2 ms to minimize.
[2024-05-27 01:52:07] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 2 ms to minimize.
[2024-05-27 01:52:07] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 2 ms to minimize.
[2024-05-27 01:52:07] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 3 ms to minimize.
[2024-05-27 01:52:08] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 2 ms to minimize.
[2024-05-27 01:52:08] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 2 ms to minimize.
[2024-05-27 01:52:08] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 2 ms to minimize.
[2024-05-27 01:52:08] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 3 ms to minimize.
[2024-05-27 01:52:08] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 2 ms to minimize.
[2024-05-27 01:52:08] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 3 ms to minimize.
[2024-05-27 01:52:09] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 3 ms to minimize.
[2024-05-27 01:52:09] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 3 ms to minimize.
[2024-05-27 01:52:09] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 2 ms to minimize.
[2024-05-27 01:52:09] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 2 ms to minimize.
[2024-05-27 01:52:09] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 3 ms to minimize.
[2024-05-27 01:52:09] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 2 ms to minimize.
[2024-05-27 01:52:10] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 3 ms to minimize.
[2024-05-27 01:52:10] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 2 ms to minimize.
[2024-05-27 01:52:10] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 2 ms to minimize.
[2024-05-27 01:52:10] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 2 ms to minimize.
[2024-05-27 01:52:10] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 2 ms to minimize.
[2024-05-27 01:52:10] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 2 ms to minimize.
[2024-05-27 01:52:11] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 3 ms to minimize.
[2024-05-27 01:52:11] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 2 ms to minimize.
[2024-05-27 01:52:11] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-27 01:52:11] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 2 ms to minimize.
[2024-05-27 01:52:11] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
[2024-05-27 01:52:11] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 2 ms to minimize.
[2024-05-27 01:52:12] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-05-27 01:52:12] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 2 ms to minimize.
[2024-05-27 01:52:12] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 2 ms to minimize.
[2024-05-27 01:52:12] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 2 ms to minimize.
[2024-05-27 01:52:13] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 2 ms to minimize.
[2024-05-27 01:52:14] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 2 ms to minimize.
[2024-05-27 01:52:14] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 3 ms to minimize.
[2024-05-27 01:52:14] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 2 ms to minimize.
[2024-05-27 01:52:14] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 2 ms to minimize.
[2024-05-27 01:52:14] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 3 ms to minimize.
[2024-05-27 01:52:15] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 3 ms to minimize.
[2024-05-27 01:52:15] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2024-05-27 01:52:15] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2024-05-27 01:52:15] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 2 ms to minimize.
[2024-05-27 01:52:15] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 2 ms to minimize.
[2024-05-27 01:52:15] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
[2024-05-27 01:52:16] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 2 ms to minimize.
[2024-05-27 01:52:16] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 2 ms to minimize.
[2024-05-27 01:52:16] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-05-27 01:52:16] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-05-27 01:52:16] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 2 ms to minimize.
[2024-05-27 01:52:16] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2024-05-27 01:52:17] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 2 ms to minimize.
[2024-05-27 01:52:17] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-05-27 01:52:18] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 2 ms to minimize.
[2024-05-27 01:52:18] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 3 ms to minimize.
[2024-05-27 01:52:19] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-05-27 01:52:19] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 2 ms to minimize.
[2024-05-27 01:52:19] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-27 01:52:19] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2024-05-27 01:52:20] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2024-05-27 01:52:20] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2024-05-27 01:52:20] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
[2024-05-27 01:52:20] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 2 ms to minimize.
[2024-05-27 01:52:20] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 2 ms to minimize.
[2024-05-27 01:52:20] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 2 ms to minimize.
[2024-05-27 01:52:20] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 2 ms to minimize.
[2024-05-27 01:52:21] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
[2024-05-27 01:52:22] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 2 ms to minimize.
[2024-05-27 01:52:23] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 3 ms to minimize.
[2024-05-27 01:52:23] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-05-27 01:52:23] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-05-27 01:52:23] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 2 ms to minimize.
[2024-05-27 01:52:23] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-05-27 01:52:23] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 2 ms to minimize.
[2024-05-27 01:52:24] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 2 ms to minimize.
[2024-05-27 01:52:24] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 1 ms to minimize.
[2024-05-27 01:52:24] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 2 ms to minimize.
[2024-05-27 01:52:24] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 2 ms to minimize.
[2024-05-27 01:52:24] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 3 ms to minimize.
[2024-05-27 01:52:25] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-05-27 01:52:26] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2024-05-27 01:52:26] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 2 ms to minimize.
[2024-05-27 01:52:26] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
[2024-05-27 01:52:26] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 2 ms to minimize.
[2024-05-27 01:52:26] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-27 01:52:26] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-05-27 01:52:26] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2024-05-27 01:52:26] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 2 ms to minimize.
[2024-05-27 01:52:27] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-05-27 01:52:27] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2024-05-27 01:52:27] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-05-27 01:52:27] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-27 01:52:28] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 2 ms to minimize.
[2024-05-27 01:52:29] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 2 ms to minimize.
[2024-05-27 01:52:29] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
[2024-05-27 01:52:29] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-05-27 01:52:29] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:52:29] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2024-05-27 01:52:29] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 2 ms to minimize.
[2024-05-27 01:52:29] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 3 ms to minimize.
[2024-05-27 01:52:30] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 2 ms to minimize.
[2024-05-27 01:52:30] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 2 ms to minimize.
[2024-05-27 01:52:30] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 2 ms to minimize.
[2024-05-27 01:52:30] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 3 ms to minimize.
[2024-05-27 01:52:30] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 3 ms to minimize.
[2024-05-27 01:52:30] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 2 ms to minimize.
[2024-05-27 01:52:31] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 2 ms to minimize.
[2024-05-27 01:52:31] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 2 ms to minimize.
[2024-05-27 01:52:31] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-05-27 01:52:31] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
[2024-05-27 01:52:32] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-05-27 01:52:32] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2024-05-27 01:52:32] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 2 ms to minimize.
[2024-05-27 01:52:33] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 3 ms to minimize.
[2024-05-27 01:52:33] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-27 01:52:33] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
[2024-05-27 01:52:33] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2024-05-27 01:52:33] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-27 01:52:34] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 2 ms to minimize.
[2024-05-27 01:52:34] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-05-27 01:52:39] [INFO ] Trap strengthening (SAT) tested/added 131/131 trap constraints in 33992 ms
[2024-05-27 01:52:39] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-27 01:52:39] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2024-05-27 01:52:39] [INFO ] [Real]Added 205 Read/Feed constraints in 24 ms returned sat
[2024-05-27 01:52:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:52:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-27 01:52:39] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-05-27 01:52:39] [INFO ] [Nat]Added 205 Read/Feed constraints in 26 ms returned sat
[2024-05-27 01:52:39] [INFO ] Computed and/alt/rep : 494/1550/494 causal constraints (skipped 60 transitions) in 45 ms.
[2024-05-27 01:52:40] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 2 ms to minimize.
[2024-05-27 01:52:40] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 3 ms to minimize.
[2024-05-27 01:52:40] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 3 ms to minimize.
[2024-05-27 01:52:40] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 3 ms to minimize.
[2024-05-27 01:52:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 752 ms
[2024-05-27 01:52:41] [INFO ] Added : 67 causal constraints over 15 iterations in 1348 ms. Result :sat
Minimization took 191 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0] Max Struct:[6, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0] Max Struct:[6, 1]
Support contains 7 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 680/680 transitions.
Applied a total of 0 rules in 16 ms. Remains 266 /266 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 266/266 places, 680/680 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 680/680 transitions.
Applied a total of 0 rules in 15 ms. Remains 266 /266 variables (removed 0) and now considering 680/680 (removed 0) transitions.
[2024-05-27 01:52:41] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2024-05-27 01:52:41] [INFO ] Invariant cache hit.
[2024-05-27 01:52:41] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-05-27 01:52:41] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2024-05-27 01:52:41] [INFO ] Invariant cache hit.
[2024-05-27 01:52:42] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-27 01:52:42] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1353 ms to find 0 implicit places.
[2024-05-27 01:52:42] [INFO ] Redundant transitions in 44 ms returned []
Running 674 sub problems to find dead transitions.
[2024-05-27 01:52:42] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2024-05-27 01:52:42] [INFO ] Invariant cache hit.
[2024-05-27 01:52:42] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 266/266 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 17/283 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-05-27 01:52:48] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 3 ms to minimize.
[2024-05-27 01:52:48] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 3 ms to minimize.
[2024-05-27 01:52:48] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 3 ms to minimize.
[2024-05-27 01:52:48] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 3 ms to minimize.
[2024-05-27 01:52:48] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 3 ms to minimize.
[2024-05-27 01:52:49] [INFO ] Deduced a trap composed of 26 places in 188 ms of which 3 ms to minimize.
[2024-05-27 01:52:49] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 3 ms to minimize.
[2024-05-27 01:52:49] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 3 ms to minimize.
[2024-05-27 01:52:49] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 3 ms to minimize.
[2024-05-27 01:52:49] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 3 ms to minimize.
[2024-05-27 01:52:50] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 2 ms to minimize.
[2024-05-27 01:52:50] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 2 ms to minimize.
[2024-05-27 01:52:50] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 2 ms to minimize.
[2024-05-27 01:52:50] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 3 ms to minimize.
[2024-05-27 01:52:50] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 2 ms to minimize.
[2024-05-27 01:52:50] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-05-27 01:52:50] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 2 ms to minimize.
[2024-05-27 01:52:51] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 3 ms to minimize.
[2024-05-27 01:52:51] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 2 ms to minimize.
[2024-05-27 01:52:51] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 20/303 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-05-27 01:52:51] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 2 ms to minimize.
[2024-05-27 01:52:52] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 3 ms to minimize.
[2024-05-27 01:52:52] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 3 ms to minimize.
[2024-05-27 01:52:52] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 3 ms to minimize.
[2024-05-27 01:52:52] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 2 ms to minimize.
[2024-05-27 01:52:52] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 3 ms to minimize.
[2024-05-27 01:52:52] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 3 ms to minimize.
[2024-05-27 01:52:53] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 3 ms to minimize.
[2024-05-27 01:52:53] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 2 ms to minimize.
[2024-05-27 01:52:53] [INFO ] Deduced a trap composed of 22 places in 177 ms of which 2 ms to minimize.
[2024-05-27 01:52:53] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 3 ms to minimize.
[2024-05-27 01:52:53] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 2 ms to minimize.
[2024-05-27 01:52:54] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 3 ms to minimize.
[2024-05-27 01:52:54] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 3 ms to minimize.
[2024-05-27 01:52:54] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 2 ms to minimize.
[2024-05-27 01:52:54] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 3 ms to minimize.
[2024-05-27 01:52:54] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 2 ms to minimize.
[2024-05-27 01:52:54] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 3 ms to minimize.
[2024-05-27 01:52:55] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 3 ms to minimize.
[2024-05-27 01:52:55] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/323 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-05-27 01:52:59] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 3 ms to minimize.
[2024-05-27 01:52:59] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 2 ms to minimize.
[2024-05-27 01:52:59] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-27 01:52:59] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-27 01:52:59] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 2 ms to minimize.
[2024-05-27 01:53:00] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 3 ms to minimize.
[2024-05-27 01:53:00] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 3 ms to minimize.
[2024-05-27 01:53:00] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 2 ms to minimize.
[2024-05-27 01:53:00] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 2 ms to minimize.
[2024-05-27 01:53:00] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-05-27 01:53:00] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-05-27 01:53:00] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-05-27 01:53:00] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-05-27 01:53:01] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 3 ms to minimize.
[2024-05-27 01:53:01] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2024-05-27 01:53:01] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2024-05-27 01:53:01] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-05-27 01:53:01] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 1 ms to minimize.
[2024-05-27 01:53:01] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 1 ms to minimize.
[2024-05-27 01:53:01] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 20/343 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-05-27 01:53:02] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 2 ms to minimize.
[2024-05-27 01:53:02] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 2 ms to minimize.
[2024-05-27 01:53:02] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-05-27 01:53:02] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:53:03] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2024-05-27 01:53:03] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 1 ms to minimize.
[2024-05-27 01:53:03] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 1 ms to minimize.
[2024-05-27 01:53:03] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 2 ms to minimize.
[2024-05-27 01:53:03] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-27 01:53:03] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-27 01:53:03] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-05-27 01:53:03] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-05-27 01:53:03] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-27 01:53:04] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2024-05-27 01:53:04] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-05-27 01:53:04] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-27 01:53:04] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-27 01:53:04] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 2 ms to minimize.
[2024-05-27 01:53:04] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 2 ms to minimize.
[2024-05-27 01:53:04] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 20/363 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-05-27 01:53:06] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-05-27 01:53:06] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-27 01:53:06] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
[2024-05-27 01:53:06] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-05-27 01:53:06] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-05-27 01:53:06] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2024-05-27 01:53:06] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-27 01:53:07] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
[2024-05-27 01:53:07] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-27 01:53:07] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 2 ms to minimize.
[2024-05-27 01:53:07] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 2 ms to minimize.
[2024-05-27 01:53:07] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 3 ms to minimize.
[2024-05-27 01:53:07] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-05-27 01:53:07] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 2 ms to minimize.
[2024-05-27 01:53:07] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 2 ms to minimize.
[2024-05-27 01:53:08] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2024-05-27 01:53:08] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2024-05-27 01:53:08] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 3 ms to minimize.
[2024-05-27 01:53:08] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 2 ms to minimize.
[2024-05-27 01:53:08] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 20/383 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 266/826 variables, and 383 constraints, problems are : Problem set: 0 solved, 674 unsolved in 30041 ms.
Refiners :[Domain max(s): 266/266 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/266 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 674/674 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 674 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 266/266 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 17/283 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 100/383 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-05-27 01:53:16] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-05-27 01:53:16] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-05-27 01:53:16] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-05-27 01:53:16] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 2 ms to minimize.
[2024-05-27 01:53:17] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 2 ms to minimize.
[2024-05-27 01:53:17] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:53:17] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-27 01:53:17] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2024-05-27 01:53:17] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-27 01:53:17] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2024-05-27 01:53:17] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-05-27 01:53:17] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-27 01:53:18] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-27 01:53:18] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-27 01:53:18] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-27 01:53:18] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 2 ms to minimize.
[2024-05-27 01:53:18] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 3 ms to minimize.
[2024-05-27 01:53:18] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 2 ms to minimize.
[2024-05-27 01:53:18] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 2 ms to minimize.
[2024-05-27 01:53:18] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/403 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-05-27 01:53:23] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 2 ms to minimize.
[2024-05-27 01:53:23] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 3 ms to minimize.
[2024-05-27 01:53:24] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-27 01:53:24] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 2 ms to minimize.
[2024-05-27 01:53:24] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 2 ms to minimize.
[2024-05-27 01:53:24] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 2 ms to minimize.
[2024-05-27 01:53:24] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 2 ms to minimize.
[2024-05-27 01:53:24] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
[2024-05-27 01:53:25] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-05-27 01:53:25] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-27 01:53:25] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
[2024-05-27 01:53:25] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-05-27 01:53:25] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2024-05-27 01:53:25] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 3 ms to minimize.
[2024-05-27 01:53:26] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-27 01:53:26] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 2 ms to minimize.
[2024-05-27 01:53:26] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 2 ms to minimize.
[2024-05-27 01:53:26] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 2 ms to minimize.
[2024-05-27 01:53:27] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-27 01:53:27] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 20/423 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-05-27 01:53:31] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 1 ms to minimize.
[2024-05-27 01:53:31] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2024-05-27 01:53:31] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-27 01:53:32] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-27 01:53:32] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 2 ms to minimize.
[2024-05-27 01:53:32] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
[2024-05-27 01:53:32] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-27 01:53:32] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2024-05-27 01:53:32] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 2 ms to minimize.
[2024-05-27 01:53:33] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 1 ms to minimize.
[2024-05-27 01:53:33] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-05-27 01:53:33] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-05-27 01:53:33] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 2 ms to minimize.
[2024-05-27 01:53:34] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-27 01:53:34] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-05-27 01:53:34] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 2 ms to minimize.
[2024-05-27 01:53:34] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 2 ms to minimize.
[2024-05-27 01:53:35] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 2 ms to minimize.
[2024-05-27 01:53:35] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 2 ms to minimize.
[2024-05-27 01:53:35] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 20/443 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-05-27 01:53:41] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 3 ms to minimize.
[2024-05-27 01:53:41] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 3 ms to minimize.
[2024-05-27 01:53:41] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 2 ms to minimize.
[2024-05-27 01:53:41] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 2 ms to minimize.
[2024-05-27 01:53:41] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 3 ms to minimize.
[2024-05-27 01:53:42] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-05-27 01:53:42] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 1 ms to minimize.
[2024-05-27 01:53:42] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 2 ms to minimize.
[2024-05-27 01:53:42] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 2 ms to minimize.
[2024-05-27 01:53:42] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 2 ms to minimize.
[2024-05-27 01:53:42] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2024-05-27 01:53:43] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-05-27 01:53:43] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 2 ms to minimize.
SMT process timed out in 60447ms, After SMT, problems are : Problem set: 0 solved, 674 unsolved
Search for dead transitions found 0 dead transitions in 60477ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61913 ms. Remains : 266/266 places, 680/680 transitions.
RANDOM walk for 40000 steps (8 resets) in 1205 ms. (33 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
[2024-05-27 01:53:44] [INFO ] Flatten gal took : 207 ms
[2024-05-27 01:53:44] [INFO ] Flatten gal took : 111 ms
[2024-05-27 01:53:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18068554130662275044.gal : 90 ms
[2024-05-27 01:53:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15370471281343477078.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18068554130662275044.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15370471281343477078.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality15370471281343477078.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :5 after 12
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :12 after 18
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :18 after 31
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :31 after 83
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :83 after 203
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :203 after 415
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :415 after 1499
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1499 after 3816
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :3816 after 8305
Interrupted probabilistic random walk after 436625 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :0 out of 4
Probabilistic random walk after 436625 steps, saw 63539 distinct states, run finished after 3010 ms. (steps per millisecond=145 ) properties seen :0
[2024-05-27 01:53:46] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2024-05-27 01:53:46] [INFO ] Invariant cache hit.
[2024-05-27 01:53:46] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 223/230 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 223/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 6/236 variables, 6/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 560/796 variables, 236/484 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/796 variables, 205/689 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/796 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 30/826 variables, 30/719 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/826 variables, 30/749 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/826 variables, 5/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/826 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/826 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 826/826 variables, and 754 constraints, problems are : Problem set: 0 solved, 4 unsolved in 840 ms.
Refiners :[Domain max(s): 266/266 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 266/266 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 223/230 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 223/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 6/236 variables, 6/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 560/796 variables, 236/484 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/796 variables, 205/689 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/796 variables, 4/693 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/796 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 30/826 variables, 30/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/826 variables, 30/753 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/826 variables, 5/758 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :8305 after 17558
[2024-05-27 01:53:48] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 2 ms to minimize.
[2024-05-27 01:53:48] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 2 ms to minimize.
[2024-05-27 01:53:48] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 3 ms to minimize.
[2024-05-27 01:53:49] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 3 ms to minimize.
[2024-05-27 01:53:49] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 3 ms to minimize.
[2024-05-27 01:53:49] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 3 ms to minimize.
[2024-05-27 01:53:49] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 2 ms to minimize.
[2024-05-27 01:53:49] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 2 ms to minimize.
[2024-05-27 01:53:50] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
[2024-05-27 01:53:50] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 3 ms to minimize.
[2024-05-27 01:53:50] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 2 ms to minimize.
[2024-05-27 01:53:50] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 3 ms to minimize.
[2024-05-27 01:53:50] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
[2024-05-27 01:53:50] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 2 ms to minimize.
[2024-05-27 01:53:51] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
[2024-05-27 01:53:51] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 3 ms to minimize.
[2024-05-27 01:53:51] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 2 ms to minimize.
[2024-05-27 01:53:51] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 2 ms to minimize.
[2024-05-27 01:53:51] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
[2024-05-27 01:53:51] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/826 variables, 20/778 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-27 01:53:51] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 2 ms to minimize.
[2024-05-27 01:53:52] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 2 ms to minimize.
[2024-05-27 01:53:52] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 2 ms to minimize.
[2024-05-27 01:53:52] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 2 ms to minimize.
[2024-05-27 01:53:52] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :17558 after 91597
[2024-05-27 01:53:52] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 2 ms to minimize.
[2024-05-27 01:53:52] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 826/826 variables, and 785 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5007 ms.
Refiners :[Domain max(s): 266/266 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 266/266 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 27/27 constraints]
After SMT, in 5882ms problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 680/680 transitions.
Applied a total of 0 rules in 14 ms. Remains 266 /266 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 266/266 places, 680/680 transitions.
RANDOM walk for 40000 steps (8 resets) in 261 ms. (152 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 599662 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :0 out of 3
Probabilistic random walk after 599662 steps, saw 87024 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
[2024-05-27 01:53:56] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2024-05-27 01:53:56] [INFO ] Invariant cache hit.
[2024-05-27 01:53:56] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 223/230 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 223/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/236 variables, 6/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 560/796 variables, 236/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/796 variables, 205/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/796 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 30/826 variables, 30/719 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/826 variables, 30/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/826 variables, 5/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/826 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/826 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 826/826 variables, and 754 constraints, problems are : Problem set: 0 solved, 3 unsolved in 473 ms.
Refiners :[Domain max(s): 266/266 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 266/266 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 223/230 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 223/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 01:53:56] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 6/236 variables, 6/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 6/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 560/796 variables, 236/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/796 variables, 205/690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/796 variables, 3/693 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/796 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 30/826 variables, 30/723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/826 variables, 30/753 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/826 variables, 5/758 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 01:53:57] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 3 ms to minimize.
[2024-05-27 01:53:57] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 3 ms to minimize.
[2024-05-27 01:53:57] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 2 ms to minimize.
[2024-05-27 01:53:57] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 2 ms to minimize.
[2024-05-27 01:53:58] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 3 ms to minimize.
[2024-05-27 01:53:58] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 2 ms to minimize.
[2024-05-27 01:53:58] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 2 ms to minimize.
[2024-05-27 01:53:58] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 3 ms to minimize.
[2024-05-27 01:53:58] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 2 ms to minimize.
[2024-05-27 01:53:58] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 2 ms to minimize.
[2024-05-27 01:53:58] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 3 ms to minimize.
[2024-05-27 01:53:59] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 2 ms to minimize.
[2024-05-27 01:53:59] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 2 ms to minimize.
[2024-05-27 01:53:59] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 3 ms to minimize.
[2024-05-27 01:53:59] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 2 ms to minimize.
[2024-05-27 01:53:59] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 3 ms to minimize.
[2024-05-27 01:53:59] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 2 ms to minimize.
[2024-05-27 01:54:00] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 2 ms to minimize.
[2024-05-27 01:54:00] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 2 ms to minimize.
[2024-05-27 01:54:00] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/826 variables, 20/778 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 01:54:00] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 2 ms to minimize.
[2024-05-27 01:54:00] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 2 ms to minimize.
[2024-05-27 01:54:01] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 3 ms to minimize.
[2024-05-27 01:54:01] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 3 ms to minimize.
[2024-05-27 01:54:01] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 2 ms to minimize.
[2024-05-27 01:54:01] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 2 ms to minimize.
[2024-05-27 01:54:01] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 2 ms to minimize.
[2024-05-27 01:54:01] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 2 ms to minimize.
[2024-05-27 01:54:02] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 2 ms to minimize.
[2024-05-27 01:54:02] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 2 ms to minimize.
[2024-05-27 01:54:02] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 3 ms to minimize.
[2024-05-27 01:54:02] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 2 ms to minimize.
[2024-05-27 01:54:02] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-05-27 01:54:02] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 2 ms to minimize.
[2024-05-27 01:54:03] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 3 ms to minimize.
[2024-05-27 01:54:03] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 2 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 32768
[2024-05-27 01:54:03] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 2 ms to minimize.
SDD size :91597 after 194133
[2024-05-27 01:54:03] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 2 ms to minimize.
[2024-05-27 01:54:03] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 3 ms to minimize.
[2024-05-27 01:54:03] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/826 variables, 20/798 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 01:54:04] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 2 ms to minimize.
[2024-05-27 01:54:04] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-27 01:54:04] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 3 ms to minimize.
[2024-05-27 01:54:04] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 2 ms to minimize.
[2024-05-27 01:54:04] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 2 ms to minimize.
[2024-05-27 01:54:05] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 2 ms to minimize.
[2024-05-27 01:54:05] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:54:05] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:54:05] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:54:05] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2024-05-27 01:54:05] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 2 ms to minimize.
[2024-05-27 01:54:05] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
[2024-05-27 01:54:05] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2024-05-27 01:54:06] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:54:06] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
[2024-05-27 01:54:06] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 2 ms to minimize.
[2024-05-27 01:54:06] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 2 ms to minimize.
[2024-05-27 01:54:06] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 2 ms to minimize.
[2024-05-27 01:54:06] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
[2024-05-27 01:54:07] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/826 variables, 20/818 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 01:54:08] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 2 ms to minimize.
[2024-05-27 01:54:08] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-05-27 01:54:08] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 2 ms to minimize.
[2024-05-27 01:54:08] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2024-05-27 01:54:08] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
[2024-05-27 01:54:08] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 2 ms to minimize.
[2024-05-27 01:54:09] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 2 ms to minimize.
[2024-05-27 01:54:09] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 3 ms to minimize.
[2024-05-27 01:54:09] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 2 ms to minimize.
[2024-05-27 01:54:10] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 2 ms to minimize.
[2024-05-27 01:54:10] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-05-27 01:54:10] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 2 ms to minimize.
[2024-05-27 01:54:10] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 2 ms to minimize.
[2024-05-27 01:54:11] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 2 ms to minimize.
[2024-05-27 01:54:11] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-27 01:54:11] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 2 ms to minimize.
[2024-05-27 01:54:11] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 3 ms to minimize.
[2024-05-27 01:54:11] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-27 01:54:11] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
[2024-05-27 01:54:11] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/826 variables, 20/838 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 01:54:12] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2024-05-27 01:54:12] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 2 ms to minimize.
[2024-05-27 01:54:12] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2024-05-27 01:54:12] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-05-27 01:54:12] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 2 ms to minimize.
[2024-05-27 01:54:12] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2024-05-27 01:54:12] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 1 ms to minimize.
[2024-05-27 01:54:13] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-05-27 01:54:13] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-27 01:54:13] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-27 01:54:13] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
[2024-05-27 01:54:13] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-05-27 01:54:13] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-05-27 01:54:15] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2024-05-27 01:54:15] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2024-05-27 01:54:17] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 3 ms to minimize.
[2024-05-27 01:54:17] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 3 ms to minimize.
[2024-05-27 01:54:17] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-27 01:54:17] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 2 ms to minimize.
[2024-05-27 01:54:17] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/826 variables, 20/858 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 01:54:18] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
[2024-05-27 01:54:18] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-05-27 01:54:19] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-05-27 01:54:19] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:54:19] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2024-05-27 01:54:20] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 1 ms to minimize.
[2024-05-27 01:54:20] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-05-27 01:54:20] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 2 ms to minimize.
[2024-05-27 01:54:21] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 2 ms to minimize.
[2024-05-27 01:54:21] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 1 ms to minimize.
[2024-05-27 01:54:21] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-05-27 01:54:22] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
[2024-05-27 01:54:22] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-05-27 01:54:22] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2024-05-27 01:54:22] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2024-05-27 01:54:22] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 2 ms to minimize.
Problem MIN0 is UNSAT
[2024-05-27 01:54:26] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-27 01:54:26] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
[2024-05-27 01:54:26] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/826 variables, 19/877 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/826 variables, 0/877 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/826 variables, 0/877 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 826/826 variables, and 877 constraints, problems are : Problem set: 1 solved, 2 unsolved in 30739 ms.
Refiners :[Domain max(s): 266/266 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 266/266 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 120/120 constraints]
After SMT, in 31258ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 274 ms.
Support contains 1 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 680/680 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 266 transition count 674
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 260 transition count 674
Applied a total of 12 rules in 25 ms. Remains 260 /266 variables (removed 6) and now considering 674/680 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 260/266 places, 674/680 transitions.
RANDOM walk for 40000 steps (8 resets) in 304 ms. (131 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :194133 after 419227
Interrupted probabilistic random walk after 514738 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :0 out of 2
Probabilistic random walk after 514738 steps, saw 75955 distinct states, run finished after 3001 ms. (steps per millisecond=171 ) properties seen :0
[2024-05-27 01:54:30] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2024-05-27 01:54:30] [INFO ] Computed 17 invariants in 4 ms
[2024-05-27 01:54:30] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 38/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 94/134 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 10/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 155/289 variables, 30/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 30/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 5/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 275/564 variables, 50/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/564 variables, 50/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/564 variables, 195/452 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/564 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 135/699 variables, 5/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/699 variables, 135/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/699 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 5/704 variables, 5/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/704 variables, 5/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/704 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 110/814 variables, 140/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/814 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/814 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 814/814 variables, and 742 constraints, problems are : Problem set: 0 solved, 2 unsolved in 497 ms.
Refiners :[Domain max(s): 260/260 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 260/260 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 38/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 94/134 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 10/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 155/289 variables, 30/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 30/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/289 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 275/564 variables, 50/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/564 variables, 50/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/564 variables, 195/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/564 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 135/699 variables, 5/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/699 variables, 135/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 01:54:31] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 3 ms to minimize.
[2024-05-27 01:54:32] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 3 ms to minimize.
[2024-05-27 01:54:32] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 2 ms to minimize.
[2024-05-27 01:54:32] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 3 ms to minimize.
[2024-05-27 01:54:32] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 2 ms to minimize.
[2024-05-27 01:54:32] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/699 variables, 6/600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/699 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 5/704 variables, 5/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/704 variables, 5/610 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/704 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 110/814 variables, 140/750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/814 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/814 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 814/814 variables, and 750 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1531 ms.
Refiners :[Domain max(s): 260/260 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 260/260 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 2049ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 674/674 transitions.
Applied a total of 0 rules in 29 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 260/260 places, 674/674 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 674/674 transitions.
Applied a total of 0 rules in 19 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
[2024-05-27 01:54:33] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
[2024-05-27 01:54:33] [INFO ] Invariant cache hit.
[2024-05-27 01:54:33] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-27 01:54:33] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
[2024-05-27 01:54:33] [INFO ] Invariant cache hit.
[2024-05-27 01:54:33] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-27 01:54:34] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1169 ms to find 0 implicit places.
[2024-05-27 01:54:34] [INFO ] Redundant transitions in 8 ms returned []
Running 668 sub problems to find dead transitions.
[2024-05-27 01:54:34] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
[2024-05-27 01:54:34] [INFO ] Invariant cache hit.
[2024-05-27 01:54:34] [INFO ] State equation strengthened by 205 read => feed constraints.
Detected timeout of ITS tools.
[2024-05-27 01:54:34] [INFO ] Flatten gal took : 68 ms
[2024-05-27 01:54:34] [INFO ] Applying decomposition
[2024-05-27 01:54:34] [INFO ] Flatten gal took : 77 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17499451682500142593.txt' '-o' '/tmp/graph17499451682500142593.bin' '-w' '/tmp/graph17499451682500142593.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17499451682500142593.bin' '-l' '-1' '-v' '-w' '/tmp/graph17499451682500142593.weights' '-q' '0' '-e' '0.001'
[2024-05-27 01:54:35] [INFO ] Decomposing Gal with order
[2024-05-27 01:54:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 01:54:35] [INFO ] Removed a total of 914 redundant transitions.
[2024-05-27 01:54:35] [INFO ] Flatten gal took : 309 ms
[2024-05-27 01:54:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 238 labels/synchronizations in 42 ms.
[2024-05-27 01:54:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16317530783128826944.gal : 27 ms
[2024-05-27 01:54:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13463286554771134279.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16317530783128826944.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13463286554771134279.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality13463286554771134279.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :11 after 362384
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 260/260 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 17/277 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-05-27 01:54:39] [INFO ] Deduced a trap composed of 18 places in 260 ms of which 3 ms to minimize.
[2024-05-27 01:54:39] [INFO ] Deduced a trap composed of 58 places in 194 ms of which 30 ms to minimize.
[2024-05-27 01:54:39] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 2 ms to minimize.
[2024-05-27 01:54:39] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 2 ms to minimize.
[2024-05-27 01:54:39] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 3 ms to minimize.
[2024-05-27 01:54:40] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 3 ms to minimize.
[2024-05-27 01:54:40] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 5 ms to minimize.
[2024-05-27 01:54:40] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 3 ms to minimize.
[2024-05-27 01:54:40] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 2 ms to minimize.
[2024-05-27 01:54:40] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 3 ms to minimize.
[2024-05-27 01:54:41] [INFO ] Deduced a trap composed of 28 places in 184 ms of which 2 ms to minimize.
[2024-05-27 01:54:41] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 3 ms to minimize.
[2024-05-27 01:54:41] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 2 ms to minimize.
[2024-05-27 01:54:41] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2024-05-27 01:54:41] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 2 ms to minimize.
[2024-05-27 01:54:41] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2024-05-27 01:54:41] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 2 ms to minimize.
[2024-05-27 01:54:42] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 2 ms to minimize.
[2024-05-27 01:54:42] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
[2024-05-27 01:54:42] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 20/297 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-05-27 01:54:42] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 2 ms to minimize.
[2024-05-27 01:54:42] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 3 ms to minimize.
[2024-05-27 01:54:43] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 2 ms to minimize.
[2024-05-27 01:54:43] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 3 ms to minimize.
[2024-05-27 01:54:43] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 3 ms to minimize.
[2024-05-27 01:54:43] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 3 ms to minimize.
[2024-05-27 01:54:43] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 2 ms to minimize.
[2024-05-27 01:54:43] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 2 ms to minimize.
[2024-05-27 01:54:44] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 2 ms to minimize.
[2024-05-27 01:54:44] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 2 ms to minimize.
[2024-05-27 01:54:44] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 2 ms to minimize.
[2024-05-27 01:54:44] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 2 ms to minimize.
[2024-05-27 01:54:44] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 2 ms to minimize.
[2024-05-27 01:54:44] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 2 ms to minimize.
[2024-05-27 01:54:44] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 2 ms to minimize.
[2024-05-27 01:54:45] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 2 ms to minimize.
[2024-05-27 01:54:45] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 2 ms to minimize.
[2024-05-27 01:54:45] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 2 ms to minimize.
[2024-05-27 01:54:45] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 2 ms to minimize.
[2024-05-27 01:54:45] [INFO ] Deduced a trap composed of 51 places in 158 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 20/317 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-05-27 01:54:50] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 2 ms to minimize.
[2024-05-27 01:54:50] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 3 ms to minimize.
[2024-05-27 01:54:50] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 3 ms to minimize.
[2024-05-27 01:54:50] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 3 ms to minimize.
[2024-05-27 01:54:50] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 3 ms to minimize.
[2024-05-27 01:54:50] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 2 ms to minimize.
[2024-05-27 01:54:51] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 3 ms to minimize.
[2024-05-27 01:54:51] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 3 ms to minimize.
[2024-05-27 01:54:51] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 3 ms to minimize.
[2024-05-27 01:54:51] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-05-27 01:54:51] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-05-27 01:54:51] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 3 ms to minimize.
[2024-05-27 01:54:51] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 3 ms to minimize.
[2024-05-27 01:54:52] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 3 ms to minimize.
[2024-05-27 01:54:52] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 2 ms to minimize.
[2024-05-27 01:54:52] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 2 ms to minimize.
[2024-05-27 01:54:52] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 1 ms to minimize.
[2024-05-27 01:54:52] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2024-05-27 01:54:52] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2024-05-27 01:54:52] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 20/337 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-05-27 01:54:53] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 3 ms to minimize.
[2024-05-27 01:54:53] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 2 ms to minimize.
[2024-05-27 01:54:54] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 2 ms to minimize.
[2024-05-27 01:54:54] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 3 ms to minimize.
[2024-05-27 01:54:54] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
[2024-05-27 01:54:54] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
[2024-05-27 01:54:54] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2024-05-27 01:54:54] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
[2024-05-27 01:54:54] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 2 ms to minimize.
[2024-05-27 01:54:55] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 2 ms to minimize.
[2024-05-27 01:54:55] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 2 ms to minimize.
[2024-05-27 01:54:55] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 2 ms to minimize.
[2024-05-27 01:54:55] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2024-05-27 01:54:55] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-05-27 01:54:55] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2024-05-27 01:54:55] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-27 01:54:55] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-05-27 01:54:56] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 2 ms to minimize.
[2024-05-27 01:54:56] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-05-27 01:54:56] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 20/357 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-05-27 01:54:57] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-27 01:54:57] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
[2024-05-27 01:54:57] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2024-05-27 01:54:57] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 2 ms to minimize.
[2024-05-27 01:54:57] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 2 ms to minimize.
[2024-05-27 01:54:58] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 2 ms to minimize.
[2024-05-27 01:54:58] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 2 ms to minimize.
[2024-05-27 01:54:58] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2024-05-27 01:54:58] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2024-05-27 01:54:58] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:54:58] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:54:58] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2024-05-27 01:54:58] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 2 ms to minimize.
[2024-05-27 01:54:58] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 2 ms to minimize.
[2024-05-27 01:54:59] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:54:59] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-27 01:54:59] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 1 ms to minimize.
[2024-05-27 01:54:59] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 1 ms to minimize.
[2024-05-27 01:54:59] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-27 01:54:59] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 20/377 constraints. Problems are: Problem set: 0 solved, 668 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 260/814 variables, and 377 constraints, problems are : Problem set: 0 solved, 668 unsolved in 30047 ms.
Refiners :[Domain max(s): 260/260 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/260 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 668/668 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 668 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 260/260 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 17/277 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 100/377 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-05-27 01:55:07] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
[2024-05-27 01:55:07] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 2 ms to minimize.
[2024-05-27 01:55:07] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 3 ms to minimize.
[2024-05-27 01:55:07] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-27 01:55:08] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 2 ms to minimize.
[2024-05-27 01:55:08] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 2 ms to minimize.
[2024-05-27 01:55:08] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-05-27 01:55:08] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-05-27 01:55:08] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 2 ms to minimize.
[2024-05-27 01:55:08] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-05-27 01:55:09] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 2 ms to minimize.
[2024-05-27 01:55:09] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-05-27 01:55:09] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-27 01:55:09] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 2 ms to minimize.
[2024-05-27 01:55:09] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 2 ms to minimize.
[2024-05-27 01:55:09] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 2 ms to minimize.
[2024-05-27 01:55:09] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 3 ms to minimize.
[2024-05-27 01:55:09] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 2 ms to minimize.
[2024-05-27 01:55:10] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 2 ms to minimize.
[2024-05-27 01:55:10] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 20/397 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-05-27 01:55:13] [INFO ] Deduced a trap composed of 24 places in 230 ms of which 3 ms to minimize.
[2024-05-27 01:55:13] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 12 ms to minimize.
[2024-05-27 01:55:14] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 1 ms to minimize.
[2024-05-27 01:55:14] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 2 ms to minimize.
[2024-05-27 01:55:19] [INFO ] Deduced a trap composed of 23 places in 5100 ms of which 29 ms to minimize.
[2024-05-27 01:55:20] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2024-05-27 01:55:20] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 1 ms to minimize.
[2024-05-27 01:55:20] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 2 ms to minimize.
[2024-05-27 01:55:20] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 2 ms to minimize.
[2024-05-27 01:55:20] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 2 ms to minimize.
[2024-05-27 01:55:20] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 2 ms to minimize.
[2024-05-27 01:55:21] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 2 ms to minimize.
[2024-05-27 01:55:21] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 1 ms to minimize.
[2024-05-27 01:55:21] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2024-05-27 01:55:21] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 1 ms to minimize.
[2024-05-27 01:55:21] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 3 ms to minimize.
[2024-05-27 01:55:21] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-27 01:55:21] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
[2024-05-27 01:55:22] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 1 ms to minimize.
[2024-05-27 01:55:22] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 20/417 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-05-27 01:55:26] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 5 ms to minimize.
[2024-05-27 01:55:27] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2024-05-27 01:55:28] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-05-27 01:55:28] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2024-05-27 01:55:28] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 2 ms to minimize.
[2024-05-27 01:55:28] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
[2024-05-27 01:55:28] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-05-27 01:55:29] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2024-05-27 01:55:29] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 2 ms to minimize.
[2024-05-27 01:55:29] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-05-27 01:55:29] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-05-27 01:55:29] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2024-05-27 01:55:30] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-05-27 01:55:30] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-05-27 01:55:30] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2024-05-27 01:55:30] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
[2024-05-27 01:55:31] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 2 ms to minimize.
[2024-05-27 01:55:31] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 2 ms to minimize.
[2024-05-27 01:55:31] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 2 ms to minimize.
[2024-05-27 01:55:31] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 668 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 260/814 variables, and 437 constraints, problems are : Problem set: 0 solved, 668 unsolved in 30019 ms.
Refiners :[Domain max(s): 260/260 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/260 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/668 constraints, Known Traps: 160/160 constraints]
After SMT, in 60390ms problems are : Problem set: 0 solved, 668 unsolved
Search for dead transitions found 0 dead transitions in 60401ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61609 ms. Remains : 260/260 places, 674/674 transitions.
FORMULA Peterson-PT-5-UpperBounds-07 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0] Max Struct:[1]
Starting property specific reduction for Peterson-PT-5-UpperBounds-08
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-05-27 01:55:34] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 266 cols
[2024-05-27 01:55:34] [INFO ] Computed 17 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2 resets) in 18 ms. (526 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-27 01:55:34] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2024-05-27 01:55:34] [INFO ] Invariant cache hit.
[2024-05-27 01:55:34] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-27 01:55:34] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2024-05-27 01:55:34] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-27 01:55:34] [INFO ] [Real]Added 205 Read/Feed constraints in 26 ms returned sat
[2024-05-27 01:55:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:55:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-27 01:55:35] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2024-05-27 01:55:35] [INFO ] [Nat]Added 205 Read/Feed constraints in 25 ms returned sat
[2024-05-27 01:55:35] [INFO ] Computed and/alt/rep : 494/1550/494 causal constraints (skipped 60 transitions) in 44 ms.
[2024-05-27 01:55:36] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 2 ms to minimize.
[2024-05-27 01:55:36] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 2 ms to minimize.
[2024-05-27 01:55:36] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 2 ms to minimize.
[2024-05-27 01:55:36] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 3 ms to minimize.
[2024-05-27 01:55:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 772 ms
[2024-05-27 01:55:36] [INFO ] Added : 67 causal constraints over 15 iterations in 1381 ms. Result :sat
Minimization took 193 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 266 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place TestIdentity_1_4_3) removed 1 transitions
Starting structural reductions in REACHABILITY mode, 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 0 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 26 ms. Remains 257 /266 variables (removed 9) and now considering 667/679 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 257/266 places, 667/679 transitions.
[2024-05-27 01:55:36] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
// Phase 1: matrix 547 rows 257 cols
[2024-05-27 01:55:37] [INFO ] Computed 17 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1692 ms. (590 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 581 ms. (1718 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-27 01:55:39] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
[2024-05-27 01:55:39] [INFO ] Invariant cache hit.
[2024-05-27 01:55:39] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-05-27 01:55:39] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-05-27 01:55:39] [INFO ] State equation strengthened by 202 read => feed constraints.
[2024-05-27 01:55:39] [INFO ] [Real]Added 202 Read/Feed constraints in 25 ms returned sat
[2024-05-27 01:55:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:55:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-27 01:55:39] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-05-27 01:55:39] [INFO ] [Nat]Added 202 Read/Feed constraints in 26 ms returned sat
[2024-05-27 01:55:39] [INFO ] Computed and/alt/rep : 481/1533/481 causal constraints (skipped 60 transitions) in 46 ms.
[2024-05-27 01:55:40] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 2 ms to minimize.
[2024-05-27 01:55:40] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 2 ms to minimize.
[2024-05-27 01:55:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 400 ms
[2024-05-27 01:55:40] [INFO ] Added : 60 causal constraints over 13 iterations in 896 ms. Result :sat
Minimization took 175 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 667/667 transitions.
Applied a total of 0 rules in 12 ms. Remains 257 /257 variables (removed 0) and now considering 667/667 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 257/257 places, 667/667 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 667/667 transitions.
Applied a total of 0 rules in 12 ms. Remains 257 /257 variables (removed 0) and now considering 667/667 (removed 0) transitions.
[2024-05-27 01:55:41] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
[2024-05-27 01:55:41] [INFO ] Invariant cache hit.
[2024-05-27 01:55:41] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-05-27 01:55:41] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
[2024-05-27 01:55:41] [INFO ] Invariant cache hit.
[2024-05-27 01:55:41] [INFO ] State equation strengthened by 202 read => feed constraints.
[2024-05-27 01:55:42] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1414 ms to find 0 implicit places.
[2024-05-27 01:55:42] [INFO ] Redundant transitions in 5 ms returned []
Running 661 sub problems to find dead transitions.
[2024-05-27 01:55:42] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
[2024-05-27 01:55:42] [INFO ] Invariant cache hit.
[2024-05-27 01:55:42] [INFO ] State equation strengthened by 202 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-27 01:55:47] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 2 ms to minimize.
[2024-05-27 01:55:47] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 2 ms to minimize.
[2024-05-27 01:55:47] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 2 ms to minimize.
[2024-05-27 01:55:47] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 2 ms to minimize.
[2024-05-27 01:55:47] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 2 ms to minimize.
[2024-05-27 01:55:48] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
[2024-05-27 01:55:48] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 2 ms to minimize.
[2024-05-27 01:55:48] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-05-27 01:55:48] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 3 ms to minimize.
[2024-05-27 01:55:48] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 1 ms to minimize.
[2024-05-27 01:55:48] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 2 ms to minimize.
[2024-05-27 01:55:48] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 2 ms to minimize.
[2024-05-27 01:55:49] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 2 ms to minimize.
[2024-05-27 01:55:49] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 2 ms to minimize.
[2024-05-27 01:55:49] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
[2024-05-27 01:55:49] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
[2024-05-27 01:55:49] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2024-05-27 01:55:49] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-05-27 01:55:49] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 2 ms to minimize.
[2024-05-27 01:55:49] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 20/292 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-27 01:55:50] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 1 ms to minimize.
[2024-05-27 01:55:50] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 3 ms to minimize.
[2024-05-27 01:55:50] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 1 ms to minimize.
[2024-05-27 01:55:50] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:55:50] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 2 ms to minimize.
[2024-05-27 01:55:50] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 2 ms to minimize.
[2024-05-27 01:55:51] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 3 ms to minimize.
[2024-05-27 01:55:51] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
[2024-05-27 01:55:51] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
[2024-05-27 01:55:51] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-27 01:55:51] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:55:51] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-27 01:55:51] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-27 01:55:51] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-27 01:55:52] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-27 01:55:52] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-05-27 01:55:52] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:55:52] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-05-27 01:55:52] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 1 ms to minimize.
[2024-05-27 01:55:52] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 20/312 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-27 01:55:56] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 1 ms to minimize.
[2024-05-27 01:55:56] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:55:56] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2024-05-27 01:55:56] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
[2024-05-27 01:55:56] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-05-27 01:55:56] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
[2024-05-27 01:55:57] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-27 01:55:57] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-27 01:55:57] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-27 01:55:57] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 1 ms to minimize.
[2024-05-27 01:55:57] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-27 01:55:57] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 2 ms to minimize.
[2024-05-27 01:55:57] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-05-27 01:55:57] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2024-05-27 01:55:57] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2024-05-27 01:55:58] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 2 ms to minimize.
[2024-05-27 01:55:58] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2024-05-27 01:55:58] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-27 01:55:58] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 2 ms to minimize.
[2024-05-27 01:55:58] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 20/332 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-27 01:55:59] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-27 01:55:59] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 2 ms to minimize.
[2024-05-27 01:55:59] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-05-27 01:55:59] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
[2024-05-27 01:55:59] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
[2024-05-27 01:56:00] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2024-05-27 01:56:00] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-27 01:56:00] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-05-27 01:56:00] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-27 01:56:00] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 2 ms to minimize.
[2024-05-27 01:56:00] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-27 01:56:01] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 2 ms to minimize.
[2024-05-27 01:56:01] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-27 01:56:01] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-05-27 01:56:01] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-05-27 01:56:01] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-05-27 01:56:01] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-27 01:56:01] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2024-05-27 01:56:02] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-27 01:56:02] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 20/352 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-27 01:56:03] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-27 01:56:03] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-27 01:56:04] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
[2024-05-27 01:56:04] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-27 01:56:04] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-05-27 01:56:05] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
[2024-05-27 01:56:05] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2024-05-27 01:56:05] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 2 ms to minimize.
[2024-05-27 01:56:06] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 2 ms to minimize.
[2024-05-27 01:56:06] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-27 01:56:06] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 2 ms to minimize.
[2024-05-27 01:56:07] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-27 01:56:07] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-27 01:56:07] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-27 01:56:07] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-27 01:56:07] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 2 ms to minimize.
[2024-05-27 01:56:07] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 2 ms to minimize.
[2024-05-27 01:56:07] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-27 01:56:07] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-05-27 01:56:08] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 20/372 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 256/804 variables, and 372 constraints, problems are : Problem set: 0 solved, 661 unsolved in 30023 ms.
Refiners :[Domain max(s): 256/257 constraints, Positive P Invariants (semi-flows): 16/17 constraints, State Equation: 0/257 constraints, ReadFeed: 0/202 constraints, PredecessorRefiner: 661/661 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 661 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 100/372 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-27 01:56:14] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2024-05-27 01:56:15] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-27 01:56:15] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-27 01:56:15] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-05-27 01:56:18] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-27 01:56:18] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-27 01:56:18] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-05-27 01:56:18] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
[2024-05-27 01:56:19] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-27 01:56:19] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2024-05-27 01:56:19] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2024-05-27 01:56:19] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-05-27 01:56:19] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-05-27 01:56:19] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-27 01:56:19] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2024-05-27 01:56:19] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-05-27 01:56:20] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-05-27 01:56:20] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 1 ms to minimize.
[2024-05-27 01:56:20] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
[2024-05-27 01:56:20] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-27 01:56:25] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-27 01:56:25] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2024-05-27 01:56:25] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-05-27 01:56:26] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 4/396 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-27 01:56:31] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 2 ms to minimize.
[2024-05-27 01:56:31] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-05-27 01:56:31] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 3/399 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-27 01:56:38] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2024-05-27 01:56:38] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 2/401 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-27 01:56:42] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
SMT process timed out in 60257ms, After SMT, problems are : Problem set: 0 solved, 661 unsolved
Search for dead transitions found 0 dead transitions in 60267ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61705 ms. Remains : 257/257 places, 667/667 transitions.
[2024-05-27 01:56:42] [INFO ] Flatten gal took : 49 ms
[2024-05-27 01:56:42] [INFO ] Flatten gal took : 51 ms
RANDOM walk for 40000 steps (8 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
[2024-05-27 01:56:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5765006402470578590.gal : 9 ms
[2024-05-27 01:56:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11296272317965301787.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5765006402470578590.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11296272317965301787.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality11296272317965301787.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 25
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :25 after 40
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :40 after 146
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :146 after 304
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :304 after 560
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :560 after 2762
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2762 after 7993
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :7993 after 13174
Interrupted probabilistic random walk after 641669 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :0 out of 2
Probabilistic random walk after 641669 steps, saw 95082 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
[2024-05-27 01:56:45] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
[2024-05-27 01:56:45] [INFO ] Invariant cache hit.
[2024-05-27 01:56:45] [INFO ] State equation strengthened by 202 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 35/36 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/37 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 87/124 variables, 37/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 10/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 155/279 variables, 30/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/279 variables, 30/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 5/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/279 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 275/554 variables, 50/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/554 variables, 50/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/554 variables, 192/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/554 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 135/689 variables, 5/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/689 variables, 135/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/689 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 5/694 variables, 5/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/694 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/694 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 110/804 variables, 140/733 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/804 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/804 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 804/804 variables, and 733 constraints, problems are : Problem set: 0 solved, 2 unsolved in 455 ms.
Refiners :[Domain max(s): 257/257 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 257/257 constraints, ReadFeed: 202/202 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 35/36 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/37 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 87/124 variables, 37/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 10/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 155/279 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/279 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/279 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 275/554 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/554 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/554 variables, 192/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/554 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 135/689 variables, 5/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/689 variables, 135/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 01:56:46] [INFO ] Deduced a trap composed of 47 places in 200 ms of which 3 ms to minimize.
[2024-05-27 01:56:47] [INFO ] Deduced a trap composed of 38 places in 198 ms of which 3 ms to minimize.
[2024-05-27 01:56:47] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 3 ms to minimize.
[2024-05-27 01:56:47] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :13174 after 100803
[2024-05-27 01:56:47] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 3 ms to minimize.
[2024-05-27 01:56:47] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 2 ms to minimize.
[2024-05-27 01:56:48] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/689 variables, 7/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/689 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 5/694 variables, 5/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/694 variables, 5/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/694 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 110/804 variables, 140/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/804 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/804 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 804/804 variables, and 742 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1875 ms.
Refiners :[Domain max(s): 257/257 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 257/257 constraints, ReadFeed: 202/202 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 2359ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 667/667 transitions.
Applied a total of 0 rules in 13 ms. Remains 257 /257 variables (removed 0) and now considering 667/667 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 257/257 places, 667/667 transitions.
RANDOM walk for 40000 steps (8 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 644840 steps, run timeout after 3012 ms. (steps per millisecond=214 ) properties seen :0 out of 2
Probabilistic random walk after 644840 steps, saw 95549 distinct states, run finished after 3012 ms. (steps per millisecond=214 ) properties seen :0
[2024-05-27 01:56:51] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
[2024-05-27 01:56:51] [INFO ] Invariant cache hit.
[2024-05-27 01:56:51] [INFO ] State equation strengthened by 202 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 35/36 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/37 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 87/124 variables, 37/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 10/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 155/279 variables, 30/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/279 variables, 30/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 5/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/279 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 275/554 variables, 50/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/554 variables, 50/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/554 variables, 192/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/554 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 135/689 variables, 5/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/689 variables, 135/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/689 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 5/694 variables, 5/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/694 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/694 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 110/804 variables, 140/733 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/804 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/804 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 804/804 variables, and 733 constraints, problems are : Problem set: 0 solved, 2 unsolved in 490 ms.
Refiners :[Domain max(s): 257/257 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 257/257 constraints, ReadFeed: 202/202 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 35/36 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/37 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 87/124 variables, 37/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 10/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 155/279 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/279 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/279 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 275/554 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/554 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/554 variables, 192/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/554 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 135/689 variables, 5/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/689 variables, 135/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 01:56:52] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 3 ms to minimize.
[2024-05-27 01:56:52] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 3 ms to minimize.
[2024-05-27 01:56:52] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 3 ms to minimize.
[2024-05-27 01:56:52] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 3 ms to minimize.
[2024-05-27 01:56:53] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
[2024-05-27 01:56:53] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 2 ms to minimize.
SDD size :100803 after 233630
[2024-05-27 01:56:53] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/689 variables, 7/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/689 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 5/694 variables, 5/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/694 variables, 5/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/694 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 110/804 variables, 140/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/804 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/804 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 804/804 variables, and 742 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1741 ms.
Refiners :[Domain max(s): 257/257 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 257/257 constraints, ReadFeed: 202/202 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 2251ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 667/667 transitions.
Applied a total of 0 rules in 19 ms. Remains 257 /257 variables (removed 0) and now considering 667/667 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 257/257 places, 667/667 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 667/667 transitions.
Applied a total of 0 rules in 14 ms. Remains 257 /257 variables (removed 0) and now considering 667/667 (removed 0) transitions.
[2024-05-27 01:56:53] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
[2024-05-27 01:56:53] [INFO ] Invariant cache hit.
[2024-05-27 01:56:54] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-27 01:56:54] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
[2024-05-27 01:56:54] [INFO ] Invariant cache hit.
[2024-05-27 01:56:54] [INFO ] State equation strengthened by 202 read => feed constraints.
[2024-05-27 01:56:54] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1205 ms to find 0 implicit places.
[2024-05-27 01:56:54] [INFO ] Redundant transitions in 5 ms returned []
Running 661 sub problems to find dead transitions.
[2024-05-27 01:56:54] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
[2024-05-27 01:56:54] [INFO ] Invariant cache hit.
[2024-05-27 01:56:54] [INFO ] State equation strengthened by 202 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-27 01:56:59] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 2 ms to minimize.
[2024-05-27 01:56:59] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 2 ms to minimize.
[2024-05-27 01:57:00] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 2 ms to minimize.
[2024-05-27 01:57:00] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 2 ms to minimize.
[2024-05-27 01:57:00] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 3 ms to minimize.
[2024-05-27 01:57:00] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 1 ms to minimize.
[2024-05-27 01:57:00] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 1 ms to minimize.
[2024-05-27 01:57:00] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2024-05-27 01:57:01] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 2 ms to minimize.
[2024-05-27 01:57:01] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
[2024-05-27 01:57:01] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 2 ms to minimize.
[2024-05-27 01:57:01] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-05-27 01:57:01] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 2 ms to minimize.
[2024-05-27 01:57:01] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 2 ms to minimize.
[2024-05-27 01:57:01] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 2 ms to minimize.
[2024-05-27 01:57:02] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2024-05-27 01:57:02] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-05-27 01:57:02] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 1 ms to minimize.
[2024-05-27 01:57:02] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 1 ms to minimize.
[2024-05-27 01:57:02] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :233630 after 443448
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 20/292 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-27 01:57:03] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-27 01:57:03] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-05-27 01:57:03] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-05-27 01:57:03] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-05-27 01:57:03] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 2 ms to minimize.
[2024-05-27 01:57:03] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-27 01:57:04] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
[2024-05-27 01:57:04] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-27 01:57:04] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-05-27 01:57:04] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-27 01:57:04] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-05-27 01:57:04] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-27 01:57:04] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-27 01:57:04] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 2 ms to minimize.
[2024-05-27 01:57:05] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-05-27 01:57:05] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
[2024-05-27 01:57:05] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-05-27 01:57:05] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 2 ms to minimize.
[2024-05-27 01:57:05] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-05-27 01:57:05] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 20/312 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-27 01:57:09] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 2 ms to minimize.
[2024-05-27 01:57:09] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 2 ms to minimize.
[2024-05-27 01:57:09] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 2 ms to minimize.
[2024-05-27 01:57:10] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-05-27 01:57:10] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
[2024-05-27 01:57:10] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-27 01:57:10] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-27 01:57:10] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-27 01:57:10] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-27 01:57:10] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-05-27 01:57:10] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-27 01:57:10] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-05-27 01:57:11] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 2 ms to minimize.
[2024-05-27 01:57:11] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-05-27 01:57:11] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-05-27 01:57:11] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-27 01:57:11] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-05-27 01:57:11] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 2 ms to minimize.
[2024-05-27 01:57:11] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2024-05-27 01:57:11] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 20/332 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-27 01:57:12] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-27 01:57:12] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2024-05-27 01:57:12] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-27 01:57:12] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
[2024-05-27 01:57:12] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-27 01:57:13] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-05-27 01:57:13] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-27 01:57:13] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 2 ms to minimize.
[2024-05-27 01:57:13] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-27 01:57:14] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 2 ms to minimize.
[2024-05-27 01:57:14] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-27 01:57:14] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-05-27 01:57:14] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-27 01:57:14] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-27 01:57:14] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-27 01:57:14] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 2 ms to minimize.
[2024-05-27 01:57:14] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-27 01:57:14] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2024-05-27 01:57:15] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-27 01:57:15] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 20/352 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-27 01:57:16] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-05-27 01:57:17] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 2 ms to minimize.
[2024-05-27 01:57:17] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-05-27 01:57:17] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-27 01:57:17] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
[2024-05-27 01:57:18] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2024-05-27 01:57:19] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2024-05-27 01:57:19] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-05-27 01:57:19] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 2 ms to minimize.
[2024-05-27 01:57:19] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-27 01:57:20] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 2 ms to minimize.
[2024-05-27 01:57:20] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-27 01:57:20] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 2 ms to minimize.
[2024-05-27 01:57:20] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-27 01:57:20] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-27 01:57:21] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-05-27 01:57:21] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-27 01:57:21] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-27 01:57:21] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-05-27 01:57:21] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 20/372 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 256/804 variables, and 372 constraints, problems are : Problem set: 0 solved, 661 unsolved in 30018 ms.
Refiners :[Domain max(s): 256/257 constraints, Positive P Invariants (semi-flows): 16/17 constraints, State Equation: 0/257 constraints, ReadFeed: 0/202 constraints, PredecessorRefiner: 661/661 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 661 unsolved
SDD size :443448 after 4.29799e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 100/372 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-27 01:57:27] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-05-27 01:57:28] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-27 01:57:28] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-27 01:57:28] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-27 01:57:30] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-05-27 01:57:30] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
[2024-05-27 01:57:31] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-05-27 01:57:31] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-05-27 01:57:31] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-27 01:57:31] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-05-27 01:57:31] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-27 01:57:32] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-27 01:57:32] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 2 ms to minimize.
[2024-05-27 01:57:32] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 2 ms to minimize.
[2024-05-27 01:57:32] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2024-05-27 01:57:32] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2024-05-27 01:57:32] [INFO ] Flatten gal took : 33 ms
[2024-05-27 01:57:32] [INFO ] Applying decomposition
[2024-05-27 01:57:33] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5245966389215779508.txt' '-o' '/tmp/graph5245966389215779508.bin' '-w' '/tmp/graph5245966389215779508.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5245966389215779508.bin' '-l' '-1' '-v' '-w' '/tmp/graph5245966389215779508.weights' '-q' '0' '-e' '0.001'
[2024-05-27 01:57:33] [INFO ] Decomposing Gal with order
[2024-05-27 01:57:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 01:57:33] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 2 ms to minimize.
[2024-05-27 01:57:33] [INFO ] Removed a total of 906 redundant transitions.
[2024-05-27 01:57:33] [INFO ] Flatten gal took : 80 ms
[2024-05-27 01:57:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 210 labels/synchronizations in 24 ms.
[2024-05-27 01:57:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality964767206394225529.gal : 10 ms
[2024-05-27 01:57:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8851605739719097245.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality964767206394225529.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8851605739719097245.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
[2024-05-27 01:57:33] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 2 ms to minimize.
Loading property file /tmp/ReachabilityCardinality8851605739719097245.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 12
[2024-05-27 01:57:33] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2024-05-27 01:57:33] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-27 01:57:37] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-27 01:57:37] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2024-05-27 01:57:38] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-05-27 01:57:39] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 4/396 constraints. Problems are: Problem set: 0 solved, 661 unsolved
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1.0843e+06 after 1.31288e+06
[2024-05-27 01:57:43] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
[2024-05-27 01:57:43] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-27 01:57:44] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 3/399 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-27 01:57:50] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2024-05-27 01:57:50] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 2/401 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 256/804 variables, and 401 constraints, problems are : Problem set: 0 solved, 661 unsolved in 30016 ms.
Refiners :[Domain max(s): 256/257 constraints, Positive P Invariants (semi-flows): 16/17 constraints, State Equation: 0/257 constraints, ReadFeed: 0/202 constraints, PredecessorRefiner: 0/661 constraints, Known Traps: 129/129 constraints]
After SMT, in 60267ms problems are : Problem set: 0 solved, 661 unsolved
Search for dead transitions found 0 dead transitions in 60277ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61509 ms. Remains : 257/257 places, 667/667 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 504 edges and 257 vertex of which 177 / 257 are part of one of the 30 SCC in 4 ms
Free SCC test removed 147 places
Drop transitions (Empty/Sink Transition effects.) removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 195
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 195
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 79 place count 68 transition count 193
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 91 place count 62 transition count 187
Graph (trivial) has 31 edges and 62 vertex of which 30 / 62 are part of one of the 6 SCC in 1 ms
Free SCC test removed 24 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 97 place count 33 transition count 187
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Graph (complete) has 162 edges and 33 vertex of which 9 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 100 output transitions
Drop transitions (Output transitions of discarded places.) removed 100 transitions
Graph (trivial) has 46 edges and 9 vertex of which 5 / 9 are part of one of the 1 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 0 with 32 rules applied. Total rules applied 129 place count 5 transition count 57
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 181 place count 5 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 184 place count 3 transition count 4
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 186 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 186 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 188 place count 2 transition count 1
Applied a total of 188 rules in 42 ms. Remains 2 /257 variables (removed 255) and now considering 1/667 (removed 666) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1 rows 2 cols
[2024-05-27 01:57:55] [INFO ] Computed 1 invariants in 0 ms
[2024-05-27 01:57:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-27 01:57:55] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-27 01:57:55] [INFO ] After 15ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2024-05-27 01:57:55] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
[2024-05-27 01:57:55] [INFO ] Flatten gal took : 1 ms
[2024-05-27 01:57:55] [INFO ] Flatten gal took : 1 ms
[2024-05-27 01:57:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14505641421801434955.gal : 0 ms
[2024-05-27 01:57:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7247385973938807201.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14505641421801434955.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7247385973938807201.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7247385973938807201.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.003068,3820,2,4,5,11,8,0,9,6,0
Total reachable state count : 2
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.00333,3820,2,3,6,11,8,0,11,6,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.003767,3820,2,3,6,11,8,0,11,6,0
Over-approximation ignoring read arcs solved 0 properties in 98 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for Peterson-PT-5-UpperBounds-08 in 140711 ms.
[2024-05-27 01:57:55] [INFO ] Flatten gal took : 26 ms
[2024-05-27 01:57:55] [INFO ] Applying decomposition
[2024-05-27 01:57:55] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13139596792248555419.txt' '-o' '/tmp/graph13139596792248555419.bin' '-w' '/tmp/graph13139596792248555419.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13139596792248555419.bin' '-l' '-1' '-v' '-w' '/tmp/graph13139596792248555419.weights' '-q' '0' '-e' '0.001'
[2024-05-27 01:57:55] [INFO ] Decomposing Gal with order
[2024-05-27 01:57:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 01:57:55] [INFO ] Removed a total of 914 redundant transitions.
[2024-05-27 01:57:55] [INFO ] Flatten gal took : 62 ms
[2024-05-27 01:57:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 256 labels/synchronizations in 21 ms.
[2024-05-27 01:57:55] [INFO ] Time to serialize gal into /tmp/UpperBounds6187283596056157041.gal : 8 ms
[2024-05-27 01:57:55] [INFO ] Time to serialize properties into /tmp/UpperBounds17801095445037457289.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6187283596056157041.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17801095445037457289.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds17801095445037457289.prop.
Detected timeout of ITS tools.
[2024-05-27 02:20:36] [INFO ] Applying decomposition
[2024-05-27 02:20:36] [INFO ] Flatten gal took : 27 ms
[2024-05-27 02:20:36] [INFO ] Decomposing Gal with order
[2024-05-27 02:20:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 02:20:36] [INFO ] Removed a total of 783 redundant transitions.
[2024-05-27 02:20:36] [INFO ] Flatten gal took : 118 ms
[2024-05-27 02:20:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 375 labels/synchronizations in 25 ms.
[2024-05-27 02:20:36] [INFO ] Time to serialize gal into /tmp/UpperBounds9423561907280923703.gal : 10 ms
[2024-05-27 02:20:36] [INFO ] Time to serialize properties into /tmp/UpperBounds9134926498096740426.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9423561907280923703.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9134926498096740426.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds9134926498096740426.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.99834e+08,1320.85,7739744,117863,31594,1.11049e+07,1.43555e+06,912,1.84503e+07,400,1.67392e+07,0
Total reachable state count : 299834224
Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Peterson-PT-5-UpperBounds-08 :0 <= u1.TestIdentity_1_4_3 <= 1
FORMULA Peterson-PT-5-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-5-UpperBounds-08,0,1333.81,7739744,1,0,1.11049e+07,1.43555e+06,1031,1.84503e+07,460,1.67392e+07,322
Total runtime 3177722 ms.
BK_STOP 1716777771881
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-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-5568"
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 r268-smll-171654407300277"
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 ;