About the Execution of GreatSPN+red for Peterson-COL-6
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9898.600 | 3600000.00 | 11470200.00 | 2903.70 | 7 7 7 7 7 6 ? 7 7 7 7 6 ? 7 7 7 | 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.r267-smll-171654406000237.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 greatspnxred
Input is Peterson-COL-6, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654406000237
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.9K Apr 12 02:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 12 02:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 12 02:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 02:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 03:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 12 03:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 46K 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-COL-6-UpperBounds-00
FORMULA_NAME Peterson-COL-6-UpperBounds-01
FORMULA_NAME Peterson-COL-6-UpperBounds-02
FORMULA_NAME Peterson-COL-6-UpperBounds-03
FORMULA_NAME Peterson-COL-6-UpperBounds-04
FORMULA_NAME Peterson-COL-6-UpperBounds-05
FORMULA_NAME Peterson-COL-6-UpperBounds-06
FORMULA_NAME Peterson-COL-6-UpperBounds-07
FORMULA_NAME Peterson-COL-6-UpperBounds-08
FORMULA_NAME Peterson-COL-6-UpperBounds-09
FORMULA_NAME Peterson-COL-6-UpperBounds-10
FORMULA_NAME Peterson-COL-6-UpperBounds-11
FORMULA_NAME Peterson-COL-6-UpperBounds-12
FORMULA_NAME Peterson-COL-6-UpperBounds-13
FORMULA_NAME Peterson-COL-6-UpperBounds-14
FORMULA_NAME Peterson-COL-6-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716749371916
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-6
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 18:49:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-26 18:49:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 18:49:34] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-26 18:49:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 18:49:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1312 ms
[2024-05-26 18:49:36] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 1372 PT places and 2247.0 transition bindings in 42 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Reduction of identical properties reduced properties to check from 16 to 9
[2024-05-26 18:49:36] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 7 ms.
[2024-05-26 18:49:36] [INFO ] Skeletonized 9 HLPN properties in 0 ms.
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2024-05-26 18:49:36] [INFO ] Computed 1 invariants in 8 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 7, 6] Max Struct:[7, 7, 7, 7, 7, 7, 7, 7, 6]
FORMULA Peterson-COL-6-UpperBounds-11 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-6-UpperBounds-14 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-6-UpperBounds-09 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-26 18:49:36] [INFO ] Invariant cache hit.
[2024-05-26 18:49:36] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2024-05-26 18:49:36] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-26 18:49:36] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-26 18:49:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 18:49:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 18:49:36] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-26 18:49:36] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-26 18:49:36] [INFO ] Added : 11 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 15 ms.
[2024-05-26 18:49:36] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 18:49:36] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-26 18:49:36] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-26 18:49:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 18:49:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 18:49:36] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-26 18:49:36] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-26 18:49:36] [INFO ] Added : 11 causal constraints over 5 iterations in 46 ms. Result :sat
Minimization took 9 ms.
[2024-05-26 18:49:36] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 18:49:36] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-26 18:49:36] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-26 18:49:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 18:49:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 18:49:37] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-26 18:49:37] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 18:49:37] [INFO ] Added : 11 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 8 ms.
[2024-05-26 18:49:37] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-26 18:49:37] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-26 18:49:37] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 18:49:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 18:49:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 18:49:37] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-26 18:49:37] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 18:49:37] [INFO ] Added : 11 causal constraints over 4 iterations in 25 ms. Result :sat
Minimization took 8 ms.
[2024-05-26 18:49:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 18:49:37] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-26 18:49:37] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 18:49:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 18:49:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 18:49:37] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-26 18:49:37] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-26 18:49:37] [INFO ] Added : 12 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 10 ms.
[2024-05-26 18:49:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 18:49:37] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-26 18:49:37] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 18:49:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 18:49:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 18:49:37] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-26 18:49:37] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 18:49:37] [INFO ] Added : 11 causal constraints over 5 iterations in 30 ms. Result :sat
Minimization took 25 ms.
[2024-05-26 18:49:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 18:49:37] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-26 18:49:37] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-26 18:49:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 18:49:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 18:49:37] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-26 18:49:37] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 18:49:37] [INFO ] Added : 11 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[7, 7, 7, 7, 7, 7, 7]
Domain [Process(7), Tour(6), Process(7)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 6)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-26 18:49:37] [INFO ] Unfolded HLPN to a Petri net with 1372 places and 2114 transitions 6608 arcs in 147 ms.
[2024-05-26 18:49:37] [INFO ] Unfolded 7 HLPN properties in 1 ms.
Deduced a syphon composed of 42 places in 37 ms
Reduce places removed 42 places and 84 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[7, 7, 7, 7, 7, 7, 7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[7, 7, 7, 7, 7, 7, 7]
[2024-05-26 18:49:37] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-05-26 18:49:38] [INFO ] Computed 27 invariants in 56 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[7, 7, 7, 7, 7, 7, 7]
RANDOM walk for 10000 steps (2 resets) in 425 ms. (23 steps per ms)
FORMULA Peterson-COL-6-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-6-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-6-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-6-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-6-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-6-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (10 resets) in 331 ms. (150 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 6, 1, 4] Max Struct:[7, 7, 7, 7]
[2024-05-26 18:49:38] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-26 18:49:38] [INFO ] Invariant cache hit.
[2024-05-26 18:49:39] [INFO ] [Real]Absence check using 20 positive place invariants in 57 ms returned sat
[2024-05-26 18:49:39] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 24 ms returned sat
[2024-05-26 18:49:40] [INFO ] [Real]Absence check using state equation in 1112 ms returned sat
[2024-05-26 18:49:40] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 18:49:40] [INFO ] [Real]Added 330 Read/Feed constraints in 431 ms returned sat
[2024-05-26 18:49:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 18:49:41] [INFO ] [Nat]Absence check using 20 positive place invariants in 53 ms returned sat
[2024-05-26 18:49:41] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 20 ms returned sat
[2024-05-26 18:49:42] [INFO ] [Nat]Absence check using state equation in 1153 ms returned sat
[2024-05-26 18:49:43] [INFO ] [Nat]Added 330 Read/Feed constraints in 506 ms returned sat
[2024-05-26 18:49:43] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 248 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-26 18:49:46] [INFO ] [Real]Absence check using 20 positive place invariants in 57 ms returned sat
[2024-05-26 18:49:46] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 31 ms returned sat
[2024-05-26 18:49:47] [INFO ] [Real]Absence check using state equation in 1166 ms returned sat
[2024-05-26 18:49:48] [INFO ] [Real]Added 330 Read/Feed constraints in 388 ms returned sat
[2024-05-26 18:49:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 18:49:48] [INFO ] [Nat]Absence check using 20 positive place invariants in 36 ms returned sat
[2024-05-26 18:49:48] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-26 18:49:49] [INFO ] [Nat]Absence check using state equation in 1305 ms returned sat
[2024-05-26 18:49:50] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-26 18:49:50] [INFO ] [Nat]Added 330 Read/Feed constraints in 881 ms returned sat
[2024-05-26 18:49:52] [INFO ] Deduced a trap composed of 17 places in 1369 ms of which 123 ms to minimize.
[2024-05-26 18:49:53] [INFO ] Deduced a trap composed of 31 places in 1302 ms of which 19 ms to minimize.
[2024-05-26 18:49:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-26 18:49:54] [INFO ] [Real]Absence check using 20 positive place invariants in 52 ms returned sat
[2024-05-26 18:49:54] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 22 ms returned sat
[2024-05-26 18:49:55] [INFO ] [Real]Absence check using state equation in 1184 ms returned sat
[2024-05-26 18:49:55] [INFO ] [Real]Added 330 Read/Feed constraints in 89 ms returned sat
[2024-05-26 18:49:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 18:49:55] [INFO ] [Nat]Absence check using 20 positive place invariants in 53 ms returned sat
[2024-05-26 18:49:55] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 20 ms returned sat
[2024-05-26 18:49:57] [INFO ] [Nat]Absence check using state equation in 1239 ms returned sat
[2024-05-26 18:49:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-26 18:49:58] [INFO ] [Nat]Added 330 Read/Feed constraints in 925 ms returned sat
[2024-05-26 18:49:59] [INFO ] Deduced a trap composed of 16 places in 1278 ms of which 16 ms to minimize.
[2024-05-26 18:50:01] [INFO ] Deduced a trap composed of 29 places in 1454 ms of which 17 ms to minimize.
[2024-05-26 18:50:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-26 18:50:01] [INFO ] [Real]Absence check using 20 positive place invariants in 53 ms returned sat
[2024-05-26 18:50:01] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 21 ms returned sat
[2024-05-26 18:50:02] [INFO ] [Real]Absence check using state equation in 1068 ms returned sat
[2024-05-26 18:50:02] [INFO ] [Real]Added 330 Read/Feed constraints in 93 ms returned sat
[2024-05-26 18:50:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 18:50:03] [INFO ] [Nat]Absence check using 20 positive place invariants in 54 ms returned sat
[2024-05-26 18:50:03] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 33 ms returned sat
[2024-05-26 18:50:04] [INFO ] [Nat]Absence check using state equation in 1106 ms returned sat
[2024-05-26 18:50:04] [INFO ] [Nat]Added 330 Read/Feed constraints in 369 ms returned sat
[2024-05-26 18:50:04] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 167 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 6, 1, 4] Max Struct:[7, 7, 7, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 6, 1, 4] Max Struct:[7, 7, 7, 7]
Support contains 637 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 157 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 1330/1330 places, 2030/2030 transitions.
[2024-05-26 18:50:08] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-26 18:50:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6, 6, 1, 4] Max Struct:[7, 7, 7, 7]
RANDOM walk for 1000000 steps (2 resets) in 13815 ms. (72 steps per ms)
FORMULA Peterson-COL-6-UpperBounds-10 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-6-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2727205 steps (6 resets) in 11646 ms. (234 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 1, 6] Max Struct:[7, 7, 7]
[2024-05-26 18:50:33] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-26 18:50:33] [INFO ] Invariant cache hit.
[2024-05-26 18:50:33] [INFO ] [Real]Absence check using 20 positive place invariants in 35 ms returned sat
[2024-05-26 18:50:33] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-26 18:50:34] [INFO ] [Real]Absence check using state equation in 868 ms returned sat
[2024-05-26 18:50:34] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 18:50:35] [INFO ] [Real]Added 330 Read/Feed constraints in 445 ms returned sat
[2024-05-26 18:50:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 18:50:35] [INFO ] [Nat]Absence check using 20 positive place invariants in 37 ms returned sat
[2024-05-26 18:50:35] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-26 18:50:36] [INFO ] [Nat]Absence check using state equation in 931 ms returned sat
[2024-05-26 18:50:37] [INFO ] [Nat]Added 330 Read/Feed constraints in 628 ms returned sat
[2024-05-26 18:50:38] [INFO ] Deduced a trap composed of 17 places in 1167 ms of which 10 ms to minimize.
[2024-05-26 18:50:39] [INFO ] Deduced a trap composed of 31 places in 1354 ms of which 16 ms to minimize.
[2024-05-26 18:50:41] [INFO ] Deduced a trap composed of 31 places in 1202 ms of which 11 ms to minimize.
[2024-05-26 18:50:42] [INFO ] Deduced a trap composed of 31 places in 1370 ms of which 18 ms to minimize.
[2024-05-26 18:50:44] [INFO ] Deduced a trap composed of 32 places in 1566 ms of which 17 ms to minimize.
[2024-05-26 18:50:45] [INFO ] Deduced a trap composed of 31 places in 1225 ms of which 14 ms to minimize.
[2024-05-26 18:50:47] [INFO ] Deduced a trap composed of 35 places in 1428 ms of which 18 ms to minimize.
[2024-05-26 18:50:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 10104 ms
[2024-05-26 18:50:47] [INFO ] [Real]Absence check using 20 positive place invariants in 41 ms returned sat
[2024-05-26 18:50:47] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 17 ms returned sat
[2024-05-26 18:50:48] [INFO ] [Real]Absence check using state equation in 990 ms returned sat
[2024-05-26 18:50:48] [INFO ] [Real]Added 330 Read/Feed constraints in 90 ms returned sat
[2024-05-26 18:50:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 18:50:49] [INFO ] [Nat]Absence check using 20 positive place invariants in 49 ms returned sat
[2024-05-26 18:50:49] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 19 ms returned sat
[2024-05-26 18:50:50] [INFO ] [Nat]Absence check using state equation in 1131 ms returned sat
[2024-05-26 18:50:51] [INFO ] [Nat]Added 330 Read/Feed constraints in 779 ms returned sat
[2024-05-26 18:50:52] [INFO ] Deduced a trap composed of 16 places in 1053 ms of which 10 ms to minimize.
[2024-05-26 18:50:53] [INFO ] Deduced a trap composed of 29 places in 1303 ms of which 15 ms to minimize.
[2024-05-26 18:50:55] [INFO ] Deduced a trap composed of 108 places in 1360 ms of which 16 ms to minimize.
[2024-05-26 18:50:56] [INFO ] Deduced a trap composed of 62 places in 1366 ms of which 14 ms to minimize.
[2024-05-26 18:50:58] [INFO ] Deduced a trap composed of 106 places in 1408 ms of which 16 ms to minimize.
[2024-05-26 18:50:59] [INFO ] Deduced a trap composed of 129 places in 1246 ms of which 10 ms to minimize.
[2024-05-26 18:51:01] [INFO ] Deduced a trap composed of 145 places in 1381 ms of which 17 ms to minimize.
[2024-05-26 18:51:02] [INFO ] Deduced a trap composed of 19 places in 1437 ms of which 16 ms to minimize.
[2024-05-26 18:51:04] [INFO ] Deduced a trap composed of 15 places in 1276 ms of which 15 ms to minimize.
[2024-05-26 18:51:06] [INFO ] Deduced a trap composed of 74 places in 1504 ms of which 16 ms to minimize.
[2024-05-26 18:51:07] [INFO ] Deduced a trap composed of 16 places in 1404 ms of which 15 ms to minimize.
[2024-05-26 18:51:09] [INFO ] Deduced a trap composed of 76 places in 1377 ms of which 15 ms to minimize.
[2024-05-26 18:51:10] [INFO ] Deduced a trap composed of 27 places in 1344 ms of which 14 ms to minimize.
[2024-05-26 18:51:12] [INFO ] Deduced a trap composed of 48 places in 1343 ms of which 17 ms to minimize.
[2024-05-26 18:51:13] [INFO ] Deduced a trap composed of 74 places in 1171 ms of which 10 ms to minimize.
[2024-05-26 18:51:15] [INFO ] Deduced a trap composed of 202 places in 1183 ms of which 14 ms to minimize.
[2024-05-26 18:51:16] [INFO ] Deduced a trap composed of 94 places in 1452 ms of which 16 ms to minimize.
[2024-05-26 18:51:18] [INFO ] Deduced a trap composed of 123 places in 1390 ms of which 16 ms to minimize.
[2024-05-26 18:51:19] [INFO ] Deduced a trap composed of 57 places in 1212 ms of which 15 ms to minimize.
[2024-05-26 18:51:21] [INFO ] Deduced a trap composed of 49 places in 1314 ms of which 13 ms to minimize.
[2024-05-26 18:51:22] [INFO ] Deduced a trap composed of 67 places in 1229 ms of which 16 ms to minimize.
[2024-05-26 18:51:24] [INFO ] Deduced a trap composed of 51 places in 1359 ms of which 17 ms to minimize.
[2024-05-26 18:51:26] [INFO ] Deduced a trap composed of 189 places in 1483 ms of which 15 ms to minimize.
[2024-05-26 18:51:27] [INFO ] Deduced a trap composed of 87 places in 1252 ms of which 17 ms to minimize.
[2024-05-26 18:51:28] [INFO ] Deduced a trap composed of 20 places in 1128 ms of which 11 ms to minimize.
[2024-05-26 18:51:29] [INFO ] Deduced a trap composed of 27 places in 971 ms of which 11 ms to minimize.
[2024-05-26 18:51:31] [INFO ] Deduced a trap composed of 52 places in 1337 ms of which 17 ms to minimize.
[2024-05-26 18:51:32] [INFO ] Deduced a trap composed of 81 places in 1247 ms of which 15 ms to minimize.
[2024-05-26 18:51:34] [INFO ] Deduced a trap composed of 19 places in 1285 ms of which 17 ms to minimize.
[2024-05-26 18:51:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-26 18:51:34] [INFO ] [Real]Absence check using 20 positive place invariants in 57 ms returned sat
[2024-05-26 18:51:34] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 23 ms returned sat
[2024-05-26 18:51:35] [INFO ] [Real]Absence check using state equation in 1114 ms returned sat
[2024-05-26 18:51:35] [INFO ] [Real]Added 330 Read/Feed constraints in 239 ms returned sat
[2024-05-26 18:51:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 18:51:36] [INFO ] [Nat]Absence check using 20 positive place invariants in 57 ms returned sat
[2024-05-26 18:51:36] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 20 ms returned sat
[2024-05-26 18:51:37] [INFO ] [Nat]Absence check using state equation in 1255 ms returned sat
[2024-05-26 18:51:37] [INFO ] [Nat]Added 330 Read/Feed constraints in 380 ms returned sat
[2024-05-26 18:51:38] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 236 ms.
[2024-05-26 18:51:58] [INFO ] Added : 460 causal constraints over 92 iterations in 20201 ms.(timeout) Result :sat
Minimization took 1604 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 1, 6] Max Struct:[6, 7, 7]
FORMULA Peterson-COL-6-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 6] Max Struct:[7, 7]
Support contains 301 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1330 transition count 1778
Reduce places removed 252 places and 0 transitions.
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 252
Iterating post reduction 1 with 504 rules applied. Total rules applied 756 place count 1078 transition count 1526
Reduce places removed 252 places and 0 transitions.
Iterating post reduction 2 with 252 rules applied. Total rules applied 1008 place count 826 transition count 1526
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 1008 place count 826 transition count 1449
Deduced a syphon composed of 77 places in 5 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 1162 place count 749 transition count 1449
Applied a total of 1162 rules in 324 ms. Remains 749 /1330 variables (removed 581) and now considering 1449/2030 (removed 581) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 324 ms. Remains : 749/1330 places, 1449/2030 transitions.
[2024-05-26 18:52:03] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
// Phase 1: matrix 1239 rows 749 cols
[2024-05-26 18:52:03] [INFO ] Computed 27 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 6] Max Struct:[7, 7]
RANDOM walk for 1000000 steps (2 resets) in 7939 ms. (125 steps per ms)
BEST_FIRST walk for 1971851 steps (4 resets) in 6303 ms. (312 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 6] Max Struct:[7, 7]
[2024-05-26 18:52:17] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 18:52:17] [INFO ] Invariant cache hit.
[2024-05-26 18:52:17] [INFO ] [Real]Absence check using 20 positive place invariants in 22 ms returned sat
[2024-05-26 18:52:17] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-26 18:52:18] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2024-05-26 18:52:18] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 18:52:18] [INFO ] [Real]Added 330 Read/Feed constraints in 71 ms returned sat
[2024-05-26 18:52:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 18:52:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 22 ms returned sat
[2024-05-26 18:52:18] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-26 18:52:19] [INFO ] [Nat]Absence check using state equation in 661 ms returned sat
[2024-05-26 18:52:19] [INFO ] [Nat]Added 330 Read/Feed constraints in 239 ms returned sat
[2024-05-26 18:52:20] [INFO ] Deduced a trap composed of 27 places in 689 ms of which 6 ms to minimize.
[2024-05-26 18:52:20] [INFO ] Deduced a trap composed of 31 places in 536 ms of which 7 ms to minimize.
[2024-05-26 18:52:21] [INFO ] Deduced a trap composed of 53 places in 558 ms of which 9 ms to minimize.
[2024-05-26 18:52:22] [INFO ] Deduced a trap composed of 59 places in 697 ms of which 9 ms to minimize.
[2024-05-26 18:52:22] [INFO ] Deduced a trap composed of 40 places in 696 ms of which 6 ms to minimize.
[2024-05-26 18:52:23] [INFO ] Deduced a trap composed of 26 places in 720 ms of which 10 ms to minimize.
[2024-05-26 18:52:24] [INFO ] Deduced a trap composed of 105 places in 692 ms of which 10 ms to minimize.
[2024-05-26 18:52:25] [INFO ] Deduced a trap composed of 61 places in 752 ms of which 9 ms to minimize.
[2024-05-26 18:52:26] [INFO ] Deduced a trap composed of 51 places in 800 ms of which 10 ms to minimize.
[2024-05-26 18:52:26] [INFO ] Deduced a trap composed of 76 places in 630 ms of which 9 ms to minimize.
[2024-05-26 18:52:27] [INFO ] Deduced a trap composed of 55 places in 825 ms of which 11 ms to minimize.
[2024-05-26 18:52:28] [INFO ] Deduced a trap composed of 14 places in 833 ms of which 10 ms to minimize.
[2024-05-26 18:52:29] [INFO ] Deduced a trap composed of 51 places in 761 ms of which 10 ms to minimize.
[2024-05-26 18:52:30] [INFO ] Deduced a trap composed of 21 places in 700 ms of which 10 ms to minimize.
[2024-05-26 18:52:31] [INFO ] Deduced a trap composed of 32 places in 532 ms of which 9 ms to minimize.
[2024-05-26 18:52:31] [INFO ] Deduced a trap composed of 38 places in 458 ms of which 7 ms to minimize.
[2024-05-26 18:52:32] [INFO ] Deduced a trap composed of 32 places in 481 ms of which 7 ms to minimize.
[2024-05-26 18:52:33] [INFO ] Deduced a trap composed of 22 places in 638 ms of which 10 ms to minimize.
[2024-05-26 18:52:33] [INFO ] Deduced a trap composed of 32 places in 579 ms of which 6 ms to minimize.
[2024-05-26 18:52:34] [INFO ] Deduced a trap composed of 38 places in 569 ms of which 9 ms to minimize.
[2024-05-26 18:52:35] [INFO ] Deduced a trap composed of 24 places in 808 ms of which 9 ms to minimize.
[2024-05-26 18:52:37] [INFO ] Deduced a trap composed of 14 places in 725 ms of which 9 ms to minimize.
[2024-05-26 18:52:37] [INFO ] Deduced a trap composed of 56 places in 769 ms of which 9 ms to minimize.
[2024-05-26 18:52:38] [INFO ] Deduced a trap composed of 92 places in 623 ms of which 6 ms to minimize.
[2024-05-26 18:52:39] [INFO ] Deduced a trap composed of 76 places in 687 ms of which 10 ms to minimize.
[2024-05-26 18:52:40] [INFO ] Deduced a trap composed of 20 places in 726 ms of which 9 ms to minimize.
[2024-05-26 18:52:40] [INFO ] Deduced a trap composed of 108 places in 718 ms of which 10 ms to minimize.
[2024-05-26 18:52:41] [INFO ] Deduced a trap composed of 36 places in 787 ms of which 10 ms to minimize.
[2024-05-26 18:52:42] [INFO ] Deduced a trap composed of 30 places in 761 ms of which 9 ms to minimize.
[2024-05-26 18:52:43] [INFO ] Deduced a trap composed of 74 places in 636 ms of which 10 ms to minimize.
[2024-05-26 18:52:44] [INFO ] Deduced a trap composed of 56 places in 719 ms of which 9 ms to minimize.
[2024-05-26 18:52:45] [INFO ] Deduced a trap composed of 22 places in 786 ms of which 10 ms to minimize.
[2024-05-26 18:52:46] [INFO ] Deduced a trap composed of 47 places in 621 ms of which 9 ms to minimize.
[2024-05-26 18:52:47] [INFO ] Deduced a trap composed of 100 places in 718 ms of which 8 ms to minimize.
[2024-05-26 18:52:47] [INFO ] Deduced a trap composed of 62 places in 680 ms of which 9 ms to minimize.
[2024-05-26 18:52:48] [INFO ] Deduced a trap composed of 100 places in 743 ms of which 10 ms to minimize.
[2024-05-26 18:52:49] [INFO ] Deduced a trap composed of 81 places in 734 ms of which 9 ms to minimize.
[2024-05-26 18:52:50] [INFO ] Deduced a trap composed of 28 places in 589 ms of which 8 ms to minimize.
[2024-05-26 18:52:51] [INFO ] Deduced a trap composed of 68 places in 679 ms of which 9 ms to minimize.
[2024-05-26 18:52:52] [INFO ] Deduced a trap composed of 98 places in 718 ms of which 8 ms to minimize.
[2024-05-26 18:52:53] [INFO ] Deduced a trap composed of 42 places in 660 ms of which 8 ms to minimize.
[2024-05-26 18:52:53] [INFO ] Deduced a trap composed of 116 places in 724 ms of which 9 ms to minimize.
[2024-05-26 18:52:54] [INFO ] Deduced a trap composed of 78 places in 736 ms of which 10 ms to minimize.
[2024-05-26 18:52:55] [INFO ] Deduced a trap composed of 28 places in 694 ms of which 9 ms to minimize.
[2024-05-26 18:52:56] [INFO ] Deduced a trap composed of 100 places in 661 ms of which 9 ms to minimize.
[2024-05-26 18:53:01] [INFO ] Deduced a trap composed of 58 places in 679 ms of which 10 ms to minimize.
[2024-05-26 18:53:02] [INFO ] Deduced a trap composed of 22 places in 784 ms of which 10 ms to minimize.
[2024-05-26 18:53:03] [INFO ] Deduced a trap composed of 56 places in 712 ms of which 9 ms to minimize.
[2024-05-26 18:53:03] [INFO ] Deduced a trap composed of 16 places in 581 ms of which 9 ms to minimize.
[2024-05-26 18:53:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-26 18:53:04] [INFO ] [Real]Absence check using 20 positive place invariants in 34 ms returned sat
[2024-05-26 18:53:04] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 16 ms returned sat
[2024-05-26 18:53:04] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2024-05-26 18:53:04] [INFO ] [Real]Added 330 Read/Feed constraints in 87 ms returned sat
[2024-05-26 18:53:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 18:53:05] [INFO ] [Nat]Absence check using 20 positive place invariants in 37 ms returned sat
[2024-05-26 18:53:05] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-26 18:53:05] [INFO ] [Nat]Absence check using state equation in 743 ms returned sat
[2024-05-26 18:53:06] [INFO ] [Nat]Added 330 Read/Feed constraints in 205 ms returned sat
[2024-05-26 18:53:06] [INFO ] Computed and/alt/rep : 1148/3171/1148 causal constraints (skipped 84 transitions) in 165 ms.
[2024-05-26 18:53:12] [INFO ] Deduced a trap composed of 115 places in 860 ms of which 10 ms to minimize.
[2024-05-26 18:53:13] [INFO ] Deduced a trap composed of 73 places in 874 ms of which 12 ms to minimize.
[2024-05-26 18:53:15] [INFO ] Deduced a trap composed of 72 places in 956 ms of which 11 ms to minimize.
[2024-05-26 18:53:16] [INFO ] Deduced a trap composed of 18 places in 966 ms of which 11 ms to minimize.
[2024-05-26 18:53:17] [INFO ] Deduced a trap composed of 55 places in 974 ms of which 12 ms to minimize.
[2024-05-26 18:53:18] [INFO ] Deduced a trap composed of 68 places in 950 ms of which 11 ms to minimize.
[2024-05-26 18:53:19] [INFO ] Deduced a trap composed of 67 places in 841 ms of which 7 ms to minimize.
[2024-05-26 18:53:20] [INFO ] Deduced a trap composed of 69 places in 803 ms of which 11 ms to minimize.
[2024-05-26 18:53:21] [INFO ] Deduced a trap composed of 106 places in 808 ms of which 11 ms to minimize.
[2024-05-26 18:53:22] [INFO ] Deduced a trap composed of 186 places in 807 ms of which 11 ms to minimize.
[2024-05-26 18:53:23] [INFO ] Deduced a trap composed of 126 places in 844 ms of which 11 ms to minimize.
[2024-05-26 18:53:24] [INFO ] Deduced a trap composed of 22 places in 851 ms of which 10 ms to minimize.
[2024-05-26 18:53:25] [INFO ] Deduced a trap composed of 74 places in 727 ms of which 9 ms to minimize.
[2024-05-26 18:53:26] [INFO ] Deduced a trap composed of 30 places in 717 ms of which 9 ms to minimize.
[2024-05-26 18:53:27] [INFO ] Deduced a trap composed of 35 places in 967 ms of which 11 ms to minimize.
[2024-05-26 18:53:28] [INFO ] Deduced a trap composed of 88 places in 969 ms of which 12 ms to minimize.
[2024-05-26 18:53:30] [INFO ] Deduced a trap composed of 48 places in 995 ms of which 12 ms to minimize.
[2024-05-26 18:53:31] [INFO ] Deduced a trap composed of 83 places in 959 ms of which 11 ms to minimize.
[2024-05-26 18:53:32] [INFO ] Deduced a trap composed of 59 places in 942 ms of which 11 ms to minimize.
[2024-05-26 18:53:33] [INFO ] Deduced a trap composed of 143 places in 679 ms of which 10 ms to minimize.
[2024-05-26 18:53:34] [INFO ] Deduced a trap composed of 43 places in 955 ms of which 10 ms to minimize.
[2024-05-26 18:53:35] [INFO ] Deduced a trap composed of 47 places in 811 ms of which 11 ms to minimize.
[2024-05-26 18:53:37] [INFO ] Deduced a trap composed of 49 places in 723 ms of which 8 ms to minimize.
[2024-05-26 18:53:38] [INFO ] Deduced a trap composed of 61 places in 670 ms of which 8 ms to minimize.
[2024-05-26 18:53:38] [INFO ] Deduced a trap composed of 87 places in 719 ms of which 11 ms to minimize.
[2024-05-26 18:53:43] [INFO ] Trap strengthening (SAT) tested/added 25/25 trap constraints in 31460 ms
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 6] Max Struct:[7, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 6] Max Struct:[7, 7]
Support contains 301 out of 749 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 749/749 places, 1449/1449 transitions.
Applied a total of 0 rules in 60 ms. Remains 749 /749 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 749/749 places, 1449/1449 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 749/749 places, 1449/1449 transitions.
Applied a total of 0 rules in 57 ms. Remains 749 /749 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
[2024-05-26 18:53:50] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 18:53:50] [INFO ] Invariant cache hit.
[2024-05-26 18:53:51] [INFO ] Implicit Places using invariants in 973 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 979 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 742/749 places, 1449/1449 transitions.
Applied a total of 0 rules in 57 ms. Remains 742 /742 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1101 ms. Remains : 742/749 places, 1449/1449 transitions.
[2024-05-26 18:53:51] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
// Phase 1: matrix 1239 rows 742 cols
[2024-05-26 18:53:51] [INFO ] Computed 20 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 6] Max Struct:[7, 7]
RANDOM walk for 1000000 steps (2 resets) in 8402 ms. (119 steps per ms)
BEST_FIRST walk for 1922667 steps (4 resets) in 6590 ms. (291 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 6] Max Struct:[7, 7]
[2024-05-26 18:54:06] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 18:54:06] [INFO ] Invariant cache hit.
[2024-05-26 18:54:06] [INFO ] [Real]Absence check using 20 positive place invariants in 24 ms returned sat
[2024-05-26 18:54:07] [INFO ] [Real]Absence check using state equation in 631 ms returned sat
[2024-05-26 18:54:07] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 18:54:07] [INFO ] [Real]Added 330 Read/Feed constraints in 103 ms returned sat
[2024-05-26 18:54:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 18:54:07] [INFO ] [Nat]Absence check using 20 positive place invariants in 28 ms returned sat
[2024-05-26 18:54:08] [INFO ] [Nat]Absence check using state equation in 739 ms returned sat
[2024-05-26 18:54:08] [INFO ] [Nat]Added 330 Read/Feed constraints in 336 ms returned sat
[2024-05-26 18:54:09] [INFO ] Deduced a trap composed of 66 places in 725 ms of which 10 ms to minimize.
[2024-05-26 18:54:10] [INFO ] Deduced a trap composed of 12 places in 752 ms of which 9 ms to minimize.
[2024-05-26 18:54:11] [INFO ] Deduced a trap composed of 14 places in 746 ms of which 9 ms to minimize.
[2024-05-26 18:54:11] [INFO ] Deduced a trap composed of 28 places in 739 ms of which 8 ms to minimize.
[2024-05-26 18:54:12] [INFO ] Deduced a trap composed of 14 places in 688 ms of which 8 ms to minimize.
[2024-05-26 18:54:13] [INFO ] Deduced a trap composed of 60 places in 607 ms of which 9 ms to minimize.
[2024-05-26 18:54:14] [INFO ] Deduced a trap composed of 22 places in 717 ms of which 8 ms to minimize.
[2024-05-26 18:54:15] [INFO ] Deduced a trap composed of 44 places in 699 ms of which 9 ms to minimize.
[2024-05-26 18:54:15] [INFO ] Deduced a trap composed of 43 places in 759 ms of which 9 ms to minimize.
[2024-05-26 18:54:16] [INFO ] Deduced a trap composed of 34 places in 808 ms of which 10 ms to minimize.
[2024-05-26 18:54:17] [INFO ] Deduced a trap composed of 28 places in 815 ms of which 10 ms to minimize.
[2024-05-26 18:54:18] [INFO ] Deduced a trap composed of 28 places in 725 ms of which 9 ms to minimize.
[2024-05-26 18:54:19] [INFO ] Deduced a trap composed of 64 places in 770 ms of which 9 ms to minimize.
[2024-05-26 18:54:20] [INFO ] Deduced a trap composed of 22 places in 772 ms of which 9 ms to minimize.
[2024-05-26 18:54:21] [INFO ] Deduced a trap composed of 14 places in 763 ms of which 10 ms to minimize.
[2024-05-26 18:54:22] [INFO ] Deduced a trap composed of 44 places in 721 ms of which 9 ms to minimize.
[2024-05-26 18:54:22] [INFO ] Deduced a trap composed of 81 places in 681 ms of which 9 ms to minimize.
[2024-05-26 18:54:23] [INFO ] Deduced a trap composed of 45 places in 712 ms of which 9 ms to minimize.
[2024-05-26 18:54:24] [INFO ] Deduced a trap composed of 28 places in 639 ms of which 9 ms to minimize.
[2024-05-26 18:54:25] [INFO ] Deduced a trap composed of 100 places in 614 ms of which 8 ms to minimize.
[2024-05-26 18:54:25] [INFO ] Deduced a trap composed of 63 places in 584 ms of which 8 ms to minimize.
[2024-05-26 18:54:26] [INFO ] Deduced a trap composed of 38 places in 685 ms of which 12 ms to minimize.
[2024-05-26 18:54:27] [INFO ] Deduced a trap composed of 71 places in 651 ms of which 9 ms to minimize.
[2024-05-26 18:54:28] [INFO ] Deduced a trap composed of 74 places in 665 ms of which 10 ms to minimize.
[2024-05-26 18:54:28] [INFO ] Deduced a trap composed of 26 places in 649 ms of which 9 ms to minimize.
[2024-05-26 18:54:29] [INFO ] Deduced a trap composed of 83 places in 794 ms of which 9 ms to minimize.
[2024-05-26 18:54:30] [INFO ] Deduced a trap composed of 14 places in 801 ms of which 10 ms to minimize.
[2024-05-26 18:54:31] [INFO ] Deduced a trap composed of 48 places in 825 ms of which 10 ms to minimize.
[2024-05-26 18:54:32] [INFO ] Deduced a trap composed of 59 places in 688 ms of which 9 ms to minimize.
[2024-05-26 18:54:33] [INFO ] Deduced a trap composed of 80 places in 675 ms of which 10 ms to minimize.
[2024-05-26 18:54:34] [INFO ] Deduced a trap composed of 30 places in 711 ms of which 10 ms to minimize.
[2024-05-26 18:54:34] [INFO ] Deduced a trap composed of 85 places in 671 ms of which 8 ms to minimize.
[2024-05-26 18:54:35] [INFO ] Deduced a trap composed of 64 places in 665 ms of which 9 ms to minimize.
[2024-05-26 18:54:36] [INFO ] Deduced a trap composed of 30 places in 681 ms of which 10 ms to minimize.
[2024-05-26 18:54:37] [INFO ] Deduced a trap composed of 51 places in 679 ms of which 10 ms to minimize.
[2024-05-26 18:54:37] [INFO ] Deduced a trap composed of 16 places in 435 ms of which 6 ms to minimize.
[2024-05-26 18:54:38] [INFO ] Deduced a trap composed of 32 places in 706 ms of which 9 ms to minimize.
[2024-05-26 18:54:39] [INFO ] Deduced a trap composed of 42 places in 607 ms of which 6 ms to minimize.
[2024-05-26 18:54:39] [INFO ] Deduced a trap composed of 61 places in 638 ms of which 10 ms to minimize.
[2024-05-26 18:54:40] [INFO ] Deduced a trap composed of 112 places in 764 ms of which 10 ms to minimize.
[2024-05-26 18:54:41] [INFO ] Deduced a trap composed of 74 places in 771 ms of which 9 ms to minimize.
[2024-05-26 18:54:42] [INFO ] Deduced a trap composed of 48 places in 754 ms of which 9 ms to minimize.
[2024-05-26 18:54:43] [INFO ] Deduced a trap composed of 94 places in 800 ms of which 10 ms to minimize.
[2024-05-26 18:54:44] [INFO ] Deduced a trap composed of 16 places in 567 ms of which 8 ms to minimize.
[2024-05-26 18:54:44] [INFO ] Deduced a trap composed of 56 places in 532 ms of which 6 ms to minimize.
[2024-05-26 18:54:45] [INFO ] Deduced a trap composed of 86 places in 527 ms of which 6 ms to minimize.
[2024-05-26 18:54:45] [INFO ] Deduced a trap composed of 97 places in 423 ms of which 6 ms to minimize.
[2024-05-26 18:54:47] [INFO ] Deduced a trap composed of 102 places in 673 ms of which 10 ms to minimize.
[2024-05-26 18:54:47] [INFO ] Deduced a trap composed of 43 places in 572 ms of which 9 ms to minimize.
[2024-05-26 18:54:48] [INFO ] Deduced a trap composed of 46 places in 740 ms of which 10 ms to minimize.
[2024-05-26 18:54:50] [INFO ] Deduced a trap composed of 73 places in 699 ms of which 9 ms to minimize.
[2024-05-26 18:54:51] [INFO ] Deduced a trap composed of 105 places in 641 ms of which 6 ms to minimize.
[2024-05-26 18:54:51] [INFO ] Deduced a trap composed of 109 places in 614 ms of which 9 ms to minimize.
[2024-05-26 18:54:52] [INFO ] Trap strengthening (SAT) tested/added 53/53 trap constraints in 43702 ms
[2024-05-26 18:54:52] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned sat
[2024-05-26 18:54:53] [INFO ] [Real]Absence check using state equation in 674 ms returned sat
[2024-05-26 18:54:53] [INFO ] [Real]Added 330 Read/Feed constraints in 108 ms returned sat
[2024-05-26 18:54:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 18:54:53] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2024-05-26 18:54:54] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2024-05-26 18:54:54] [INFO ] [Nat]Added 330 Read/Feed constraints in 144 ms returned sat
[2024-05-26 18:54:55] [INFO ] Deduced a trap composed of 12 places in 673 ms of which 10 ms to minimize.
[2024-05-26 18:54:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 781 ms
[2024-05-26 18:54:55] [INFO ] Computed and/alt/rep : 1148/3171/1148 causal constraints (skipped 84 transitions) in 137 ms.
[2024-05-26 18:54:59] [INFO ] Deduced a trap composed of 48 places in 689 ms of which 7 ms to minimize.
[2024-05-26 18:55:00] [INFO ] Deduced a trap composed of 32 places in 544 ms of which 7 ms to minimize.
[2024-05-26 18:55:01] [INFO ] Deduced a trap composed of 44 places in 665 ms of which 11 ms to minimize.
[2024-05-26 18:55:02] [INFO ] Deduced a trap composed of 45 places in 859 ms of which 7 ms to minimize.
[2024-05-26 18:55:03] [INFO ] Deduced a trap composed of 30 places in 667 ms of which 9 ms to minimize.
[2024-05-26 18:55:04] [INFO ] Deduced a trap composed of 71 places in 810 ms of which 7 ms to minimize.
[2024-05-26 18:55:05] [INFO ] Deduced a trap composed of 10 places in 855 ms of which 12 ms to minimize.
[2024-05-26 18:55:06] [INFO ] Deduced a trap composed of 30 places in 828 ms of which 10 ms to minimize.
[2024-05-26 18:55:07] [INFO ] Deduced a trap composed of 22 places in 852 ms of which 11 ms to minimize.
[2024-05-26 18:55:08] [INFO ] Deduced a trap composed of 36 places in 650 ms of which 6 ms to minimize.
[2024-05-26 18:55:09] [INFO ] Deduced a trap composed of 22 places in 704 ms of which 11 ms to minimize.
[2024-05-26 18:55:10] [INFO ] Deduced a trap composed of 26 places in 808 ms of which 11 ms to minimize.
[2024-05-26 18:55:11] [INFO ] Deduced a trap composed of 14 places in 862 ms of which 11 ms to minimize.
[2024-05-26 18:55:12] [INFO ] Deduced a trap composed of 58 places in 784 ms of which 10 ms to minimize.
[2024-05-26 18:55:12] [INFO ] Deduced a trap composed of 36 places in 660 ms of which 6 ms to minimize.
[2024-05-26 18:55:12] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 13686 ms
[2024-05-26 18:55:13] [INFO ] Added : 165 causal constraints over 34 iterations in 18052 ms. Result :sat
Minimization took 618 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 6] Max Struct:[7, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 6] Max Struct:[7, 7]
Support contains 301 out of 742 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Applied a total of 0 rules in 29 ms. Remains 742 /742 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 742/742 places, 1449/1449 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Applied a total of 0 rules in 26 ms. Remains 742 /742 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
[2024-05-26 18:55:15] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 18:55:15] [INFO ] Invariant cache hit.
[2024-05-26 18:55:15] [INFO ] Implicit Places using invariants in 786 ms returned []
[2024-05-26 18:55:16] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 18:55:16] [INFO ] Invariant cache hit.
[2024-05-26 18:55:16] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 18:55:20] [INFO ] Implicit Places using invariants and state equation in 4112 ms returned []
Implicit Place search using SMT with State Equation took 4905 ms to find 0 implicit places.
[2024-05-26 18:55:20] [INFO ] Redundant transitions in 159 ms returned []
Running 1442 sub problems to find dead transitions.
[2024-05-26 18:55:20] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 18:55:20] [INFO ] Invariant cache hit.
[2024-05-26 18:55:20] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.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 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.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 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 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 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.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 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/742 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 742/1981 variables, and 20 constraints, problems are : Problem set: 0 solved, 1442 unsolved in 30118 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/742 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1442/1442 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1442 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/742 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
[2024-05-26 18:55:54] [INFO ] Deduced a trap composed of 16 places in 664 ms of which 8 ms to minimize.
[2024-05-26 18:55:55] [INFO ] Deduced a trap composed of 36 places in 692 ms of which 8 ms to minimize.
[2024-05-26 18:55:56] [INFO ] Deduced a trap composed of 33 places in 819 ms of which 11 ms to minimize.
[2024-05-26 18:55:56] [INFO ] Deduced a trap composed of 52 places in 781 ms of which 10 ms to minimize.
[2024-05-26 18:55:57] [INFO ] Deduced a trap composed of 62 places in 776 ms of which 10 ms to minimize.
[2024-05-26 18:55:58] [INFO ] Deduced a trap composed of 60 places in 754 ms of which 13 ms to minimize.
[2024-05-26 18:55:59] [INFO ] Deduced a trap composed of 82 places in 785 ms of which 10 ms to minimize.
[2024-05-26 18:56:00] [INFO ] Deduced a trap composed of 46 places in 750 ms of which 8 ms to minimize.
[2024-05-26 18:56:00] [INFO ] Deduced a trap composed of 123 places in 785 ms of which 10 ms to minimize.
[2024-05-26 18:56:01] [INFO ] Deduced a trap composed of 49 places in 756 ms of which 6 ms to minimize.
[2024-05-26 18:56:02] [INFO ] Deduced a trap composed of 61 places in 670 ms of which 6 ms to minimize.
[2024-05-26 18:56:03] [INFO ] Deduced a trap composed of 28 places in 730 ms of which 9 ms to minimize.
[2024-05-26 18:56:04] [INFO ] Deduced a trap composed of 37 places in 898 ms of which 11 ms to minimize.
[2024-05-26 18:56:04] [INFO ] Deduced a trap composed of 57 places in 909 ms of which 11 ms to minimize.
[2024-05-26 18:56:05] [INFO ] Deduced a trap composed of 39 places in 677 ms of which 9 ms to minimize.
[2024-05-26 18:56:06] [INFO ] Deduced a trap composed of 57 places in 697 ms of which 10 ms to minimize.
[2024-05-26 18:56:07] [INFO ] Deduced a trap composed of 51 places in 841 ms of which 11 ms to minimize.
[2024-05-26 18:56:08] [INFO ] Deduced a trap composed of 16 places in 781 ms of which 10 ms to minimize.
[2024-05-26 18:56:08] [INFO ] Deduced a trap composed of 16 places in 913 ms of which 11 ms to minimize.
[2024-05-26 18:56:09] [INFO ] Deduced a trap composed of 16 places in 819 ms of which 11 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/742 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
[2024-05-26 18:56:11] [INFO ] Deduced a trap composed of 26 places in 626 ms of which 7 ms to minimize.
[2024-05-26 18:56:12] [INFO ] Deduced a trap composed of 26 places in 827 ms of which 10 ms to minimize.
[2024-05-26 18:56:12] [INFO ] Deduced a trap composed of 26 places in 612 ms of which 8 ms to minimize.
[2024-05-26 18:56:13] [INFO ] Deduced a trap composed of 26 places in 422 ms of which 5 ms to minimize.
[2024-05-26 18:56:13] [INFO ] Deduced a trap composed of 26 places in 456 ms of which 5 ms to minimize.
[2024-05-26 18:56:14] [INFO ] Deduced a trap composed of 62 places in 409 ms of which 5 ms to minimize.
[2024-05-26 18:56:14] [INFO ] Deduced a trap composed of 26 places in 527 ms of which 6 ms to minimize.
[2024-05-26 18:56:15] [INFO ] Deduced a trap composed of 22 places in 548 ms of which 10 ms to minimize.
[2024-05-26 18:56:15] [INFO ] Deduced a trap composed of 44 places in 533 ms of which 10 ms to minimize.
[2024-05-26 18:56:16] [INFO ] Deduced a trap composed of 26 places in 786 ms of which 11 ms to minimize.
[2024-05-26 18:56:17] [INFO ] Deduced a trap composed of 37 places in 772 ms of which 10 ms to minimize.
[2024-05-26 18:56:18] [INFO ] Deduced a trap composed of 12 places in 863 ms of which 10 ms to minimize.
[2024-05-26 18:56:19] [INFO ] Deduced a trap composed of 26 places in 769 ms of which 10 ms to minimize.
[2024-05-26 18:56:19] [INFO ] Deduced a trap composed of 14 places in 756 ms of which 10 ms to minimize.
[2024-05-26 18:56:20] [INFO ] Deduced a trap composed of 96 places in 689 ms of which 8 ms to minimize.
[2024-05-26 18:56:20] [INFO ] Deduced a trap composed of 36 places in 373 ms of which 6 ms to minimize.
[2024-05-26 18:56:21] [INFO ] Deduced a trap composed of 22 places in 532 ms of which 8 ms to minimize.
SMT process timed out in 61176ms, After SMT, problems are : Problem set: 0 solved, 1442 unsolved
Search for dead transitions found 0 dead transitions in 61240ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66362 ms. Remains : 742/742 places, 1449/1449 transitions.
RANDOM walk for 40000 steps (8 resets) in 2079 ms. (19 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 614 ms. (65 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 603 ms. (66 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 132392 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 4
Probabilistic random walk after 132392 steps, saw 33696 distinct states, run finished after 3006 ms. (steps per millisecond=44 ) properties seen :0
[2024-05-26 18:56:25] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 18:56:25] [INFO ] Invariant cache hit.
[2024-05-26 18:56:25] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 392/693 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 18:56:26] [INFO ] Deduced a trap composed of 66 places in 449 ms of which 7 ms to minimize.
[2024-05-26 18:56:26] [INFO ] Deduced a trap composed of 177 places in 271 ms of which 4 ms to minimize.
[2024-05-26 18:56:27] [INFO ] Deduced a trap composed of 171 places in 176 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 18:56:27] [INFO ] Deduced a trap composed of 102 places in 574 ms of which 11 ms to minimize.
[2024-05-26 18:56:28] [INFO ] Deduced a trap composed of 78 places in 701 ms of which 7 ms to minimize.
[2024-05-26 18:56:29] [INFO ] Deduced a trap composed of 54 places in 705 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 7/700 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/700 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1239/1939 variables, 700/720 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1939 variables, 330/1050 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1939 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 5183ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 301 out of 742 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Applied a total of 0 rules in 26 ms. Remains 742 /742 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 742/742 places, 1449/1449 transitions.
RANDOM walk for 40000 steps (8 resets) in 1812 ms. (22 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 313 ms. (127 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 581 ms. (68 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 518 ms. (77 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 130368 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 4
Probabilistic random walk after 130368 steps, saw 33450 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
[2024-05-26 18:56:35] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 18:56:35] [INFO ] Invariant cache hit.
[2024-05-26 18:56:35] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 392/693 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 18:56:35] [INFO ] Deduced a trap composed of 66 places in 475 ms of which 6 ms to minimize.
[2024-05-26 18:56:36] [INFO ] Deduced a trap composed of 177 places in 221 ms of which 3 ms to minimize.
[2024-05-26 18:56:36] [INFO ] Deduced a trap composed of 171 places in 115 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 18:56:37] [INFO ] Deduced a trap composed of 102 places in 497 ms of which 6 ms to minimize.
[2024-05-26 18:56:37] [INFO ] Deduced a trap composed of 78 places in 610 ms of which 7 ms to minimize.
[2024-05-26 18:56:38] [INFO ] Deduced a trap composed of 54 places in 660 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 7/700 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/700 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1239/1939 variables, 700/720 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1939 variables, 330/1050 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1939 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 42/1981 variables, 42/1092 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1981 variables, 6/1098 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1981 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1981 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1981/1981 variables, and 1098 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6111 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 742/742 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 392/693 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 7/700 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/700 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1239/1939 variables, 700/720 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1939 variables, 330/1050 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1939 variables, 4/1054 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1939 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 42/1981 variables, 42/1096 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1981 variables, 6/1102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 18:56:46] [INFO ] Deduced a trap composed of 32 places in 495 ms of which 6 ms to minimize.
[2024-05-26 18:56:47] [INFO ] Deduced a trap composed of 83 places in 739 ms of which 9 ms to minimize.
[2024-05-26 18:56:48] [INFO ] Deduced a trap composed of 78 places in 755 ms of which 9 ms to minimize.
[2024-05-26 18:56:49] [INFO ] Deduced a trap composed of 78 places in 466 ms of which 6 ms to minimize.
[2024-05-26 18:56:49] [INFO ] Deduced a trap composed of 120 places in 638 ms of which 6 ms to minimize.
[2024-05-26 18:56:50] [INFO ] Deduced a trap composed of 55 places in 794 ms of which 9 ms to minimize.
[2024-05-26 18:56:51] [INFO ] Deduced a trap composed of 53 places in 733 ms of which 10 ms to minimize.
[2024-05-26 18:56:52] [INFO ] Deduced a trap composed of 64 places in 810 ms of which 9 ms to minimize.
[2024-05-26 18:56:53] [INFO ] Deduced a trap composed of 46 places in 829 ms of which 9 ms to minimize.
[2024-05-26 18:56:54] [INFO ] Deduced a trap composed of 43 places in 800 ms of which 10 ms to minimize.
[2024-05-26 18:56:54] [INFO ] Deduced a trap composed of 54 places in 809 ms of which 10 ms to minimize.
[2024-05-26 18:56:55] [INFO ] Deduced a trap composed of 86 places in 810 ms of which 10 ms to minimize.
[2024-05-26 18:56:56] [INFO ] Deduced a trap composed of 38 places in 707 ms of which 6 ms to minimize.
[2024-05-26 18:56:57] [INFO ] Deduced a trap composed of 46 places in 495 ms of which 10 ms to minimize.
[2024-05-26 18:56:58] [INFO ] Deduced a trap composed of 38 places in 732 ms of which 10 ms to minimize.
[2024-05-26 18:56:58] [INFO ] Deduced a trap composed of 138 places in 724 ms of which 10 ms to minimize.
[2024-05-26 18:56:59] [INFO ] Deduced a trap composed of 32 places in 721 ms of which 10 ms to minimize.
[2024-05-26 18:57:00] [INFO ] Deduced a trap composed of 50 places in 690 ms of which 9 ms to minimize.
[2024-05-26 18:57:01] [INFO ] Deduced a trap composed of 60 places in 723 ms of which 9 ms to minimize.
[2024-05-26 18:57:01] [INFO ] Deduced a trap composed of 38 places in 677 ms of which 9 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/1981 variables, 20/1122 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-26 18:57:03] [INFO ] Deduced a trap composed of 51 places in 580 ms of which 10 ms to minimize.
[2024-05-26 18:57:04] [INFO ] Deduced a trap composed of 48 places in 784 ms of which 20 ms to minimize.
[2024-05-26 18:57:05] [INFO ] Deduced a trap composed of 87 places in 594 ms of which 11 ms to minimize.
[2024-05-26 18:57:06] [INFO ] Deduced a trap composed of 76 places in 736 ms of which 7 ms to minimize.
[2024-05-26 18:57:07] [INFO ] Deduced a trap composed of 68 places in 922 ms of which 11 ms to minimize.
[2024-05-26 18:57:08] [INFO ] Deduced a trap composed of 14 places in 924 ms of which 11 ms to minimize.
[2024-05-26 18:57:09] [INFO ] Deduced a trap composed of 22 places in 921 ms of which 11 ms to minimize.
[2024-05-26 18:57:10] [INFO ] Deduced a trap composed of 22 places in 849 ms of which 10 ms to minimize.
[2024-05-26 18:57:10] [INFO ] Deduced a trap composed of 64 places in 846 ms of which 10 ms to minimize.
[2024-05-26 18:57:11] [INFO ] Deduced a trap composed of 37 places in 825 ms of which 9 ms to minimize.
[2024-05-26 18:57:12] [INFO ] Deduced a trap composed of 37 places in 820 ms of which 10 ms to minimize.
[2024-05-26 18:57:13] [INFO ] Deduced a trap composed of 47 places in 899 ms of which 11 ms to minimize.
[2024-05-26 18:57:14] [INFO ] Deduced a trap composed of 48 places in 913 ms of which 10 ms to minimize.
[2024-05-26 18:57:15] [INFO ] Deduced a trap composed of 45 places in 861 ms of which 10 ms to minimize.
[2024-05-26 18:57:16] [INFO ] Deduced a trap composed of 37 places in 963 ms of which 11 ms to minimize.
[2024-05-26 18:57:17] [INFO ] Deduced a trap composed of 79 places in 960 ms of which 10 ms to minimize.
[2024-05-26 18:57:18] [INFO ] Deduced a trap composed of 70 places in 941 ms of which 11 ms to minimize.
[2024-05-26 18:57:19] [INFO ] Deduced a trap composed of 86 places in 949 ms of which 10 ms to minimize.
[2024-05-26 18:57:20] [INFO ] Deduced a trap composed of 74 places in 945 ms of which 11 ms to minimize.
[2024-05-26 18:57:21] [INFO ] Deduced a trap composed of 55 places in 752 ms of which 11 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1981 variables, 20/1142 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-26 18:57:24] [INFO ] Deduced a trap composed of 28 places in 855 ms of which 10 ms to minimize.
[2024-05-26 18:57:25] [INFO ] Deduced a trap composed of 30 places in 860 ms of which 10 ms to minimize.
[2024-05-26 18:57:26] [INFO ] Deduced a trap composed of 32 places in 769 ms of which 9 ms to minimize.
SMT process timed out in 51295ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1026 ms.
Support contains 301 out of 742 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Applied a total of 0 rules in 37 ms. Remains 742 /742 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 742/742 places, 1449/1449 transitions.
RANDOM walk for 40000 steps (8 resets) in 1457 ms. (27 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 453 ms. (88 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 558 ms. (71 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 208256 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 3
Probabilistic random walk after 208256 steps, saw 43151 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
[2024-05-26 18:57:31] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 18:57:31] [INFO ] Invariant cache hit.
[2024-05-26 18:57:31] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 392/693 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 7/700 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/700 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1239/1939 variables, 700/714 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1939 variables, 330/1044 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1939 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 42/1981 variables, 42/1086 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1981 variables, 6/1092 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1981 variables, 0/1092 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1981 variables, 0/1092 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1981/1981 variables, and 1092 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1527 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 742/742 constraints, ReadFeed: 330/330 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/301 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 392/693 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 18:57:33] [INFO ] Deduced a trap composed of 54 places in 620 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 7/700 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/700 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1239/1939 variables, 700/715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1939 variables, 330/1045 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1939 variables, 3/1048 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1939 variables, 0/1048 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 42/1981 variables, 42/1090 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1981 variables, 6/1096 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 18:57:38] [INFO ] Deduced a trap composed of 54 places in 763 ms of which 10 ms to minimize.
[2024-05-26 18:57:39] [INFO ] Deduced a trap composed of 54 places in 800 ms of which 10 ms to minimize.
[2024-05-26 18:57:40] [INFO ] Deduced a trap composed of 28 places in 809 ms of which 10 ms to minimize.
[2024-05-26 18:57:41] [INFO ] Deduced a trap composed of 36 places in 886 ms of which 11 ms to minimize.
[2024-05-26 18:57:42] [INFO ] Deduced a trap composed of 34 places in 871 ms of which 10 ms to minimize.
[2024-05-26 18:57:43] [INFO ] Deduced a trap composed of 52 places in 863 ms of which 11 ms to minimize.
[2024-05-26 18:57:43] [INFO ] Deduced a trap composed of 51 places in 870 ms of which 11 ms to minimize.
[2024-05-26 18:57:45] [INFO ] Deduced a trap composed of 34 places in 952 ms of which 11 ms to minimize.
[2024-05-26 18:57:45] [INFO ] Deduced a trap composed of 35 places in 900 ms of which 11 ms to minimize.
[2024-05-26 18:57:46] [INFO ] Deduced a trap composed of 28 places in 883 ms of which 11 ms to minimize.
[2024-05-26 18:57:47] [INFO ] Deduced a trap composed of 123 places in 853 ms of which 10 ms to minimize.
[2024-05-26 18:57:48] [INFO ] Deduced a trap composed of 71 places in 859 ms of which 10 ms to minimize.
[2024-05-26 18:57:49] [INFO ] Deduced a trap composed of 40 places in 881 ms of which 11 ms to minimize.
[2024-05-26 18:57:50] [INFO ] Deduced a trap composed of 20 places in 960 ms of which 11 ms to minimize.
[2024-05-26 18:57:51] [INFO ] Deduced a trap composed of 57 places in 899 ms of which 10 ms to minimize.
[2024-05-26 18:57:52] [INFO ] Deduced a trap composed of 57 places in 906 ms of which 10 ms to minimize.
[2024-05-26 18:57:53] [INFO ] Deduced a trap composed of 124 places in 913 ms of which 10 ms to minimize.
[2024-05-26 18:57:54] [INFO ] Deduced a trap composed of 47 places in 947 ms of which 11 ms to minimize.
[2024-05-26 18:57:55] [INFO ] Deduced a trap composed of 36 places in 878 ms of which 10 ms to minimize.
[2024-05-26 18:57:56] [INFO ] Deduced a trap composed of 37 places in 900 ms of which 11 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1981 variables, 20/1116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 18:57:59] [INFO ] Deduced a trap composed of 37 places in 814 ms of which 10 ms to minimize.
[2024-05-26 18:57:59] [INFO ] Deduced a trap composed of 62 places in 845 ms of which 10 ms to minimize.
[2024-05-26 18:58:00] [INFO ] Deduced a trap composed of 52 places in 846 ms of which 10 ms to minimize.
[2024-05-26 18:58:01] [INFO ] Deduced a trap composed of 16 places in 844 ms of which 10 ms to minimize.
[2024-05-26 18:58:02] [INFO ] Deduced a trap composed of 68 places in 691 ms of which 10 ms to minimize.
[2024-05-26 18:58:03] [INFO ] Deduced a trap composed of 12 places in 789 ms of which 9 ms to minimize.
[2024-05-26 18:58:04] [INFO ] Deduced a trap composed of 27 places in 650 ms of which 9 ms to minimize.
[2024-05-26 18:58:04] [INFO ] Deduced a trap composed of 16 places in 451 ms of which 5 ms to minimize.
[2024-05-26 18:58:05] [INFO ] Deduced a trap composed of 44 places in 606 ms of which 8 ms to minimize.
[2024-05-26 18:58:06] [INFO ] Deduced a trap composed of 18 places in 711 ms of which 10 ms to minimize.
[2024-05-26 18:58:06] [INFO ] Deduced a trap composed of 40 places in 758 ms of which 10 ms to minimize.
[2024-05-26 18:58:07] [INFO ] Deduced a trap composed of 10 places in 641 ms of which 10 ms to minimize.
[2024-05-26 18:58:08] [INFO ] Deduced a trap composed of 106 places in 656 ms of which 9 ms to minimize.
[2024-05-26 18:58:09] [INFO ] Deduced a trap composed of 46 places in 701 ms of which 9 ms to minimize.
[2024-05-26 18:58:09] [INFO ] Deduced a trap composed of 52 places in 468 ms of which 6 ms to minimize.
[2024-05-26 18:58:10] [INFO ] Deduced a trap composed of 12 places in 691 ms of which 9 ms to minimize.
[2024-05-26 18:58:11] [INFO ] Deduced a trap composed of 52 places in 715 ms of which 9 ms to minimize.
[2024-05-26 18:58:12] [INFO ] Deduced a trap composed of 34 places in 836 ms of which 10 ms to minimize.
[2024-05-26 18:58:13] [INFO ] Deduced a trap composed of 27 places in 721 ms of which 9 ms to minimize.
[2024-05-26 18:58:14] [INFO ] Deduced a trap composed of 12 places in 780 ms of which 10 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1981 variables, 20/1136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 18:58:16] [INFO ] Deduced a trap composed of 106 places in 682 ms of which 10 ms to minimize.
[2024-05-26 18:58:17] [INFO ] Deduced a trap composed of 121 places in 813 ms of which 10 ms to minimize.
[2024-05-26 18:58:18] [INFO ] Deduced a trap composed of 121 places in 762 ms of which 10 ms to minimize.
[2024-05-26 18:58:19] [INFO ] Deduced a trap composed of 54 places in 836 ms of which 10 ms to minimize.
[2024-05-26 18:58:19] [INFO ] Deduced a trap composed of 100 places in 844 ms of which 10 ms to minimize.
[2024-05-26 18:58:20] [INFO ] Deduced a trap composed of 58 places in 841 ms of which 11 ms to minimize.
[2024-05-26 18:58:22] [INFO ] Deduced a trap composed of 88 places in 842 ms of which 11 ms to minimize.
[2024-05-26 18:58:23] [INFO ] Deduced a trap composed of 67 places in 752 ms of which 10 ms to minimize.
[2024-05-26 18:58:23] [INFO ] Deduced a trap composed of 82 places in 466 ms of which 6 ms to minimize.
[2024-05-26 18:58:24] [INFO ] Deduced a trap composed of 81 places in 525 ms of which 10 ms to minimize.
[2024-05-26 18:58:24] [INFO ] Deduced a trap composed of 64 places in 695 ms of which 10 ms to minimize.
[2024-05-26 18:58:25] [INFO ] Deduced a trap composed of 98 places in 819 ms of which 10 ms to minimize.
[2024-05-26 18:58:26] [INFO ] Deduced a trap composed of 70 places in 729 ms of which 9 ms to minimize.
[2024-05-26 18:58:27] [INFO ] Deduced a trap composed of 126 places in 756 ms of which 10 ms to minimize.
[2024-05-26 18:58:28] [INFO ] Deduced a trap composed of 102 places in 692 ms of which 10 ms to minimize.
[2024-05-26 18:58:29] [INFO ] Deduced a trap composed of 66 places in 783 ms of which 10 ms to minimize.
[2024-05-26 18:58:29] [INFO ] Deduced a trap composed of 67 places in 856 ms of which 9 ms to minimize.
[2024-05-26 18:58:30] [INFO ] Deduced a trap composed of 53 places in 827 ms of which 10 ms to minimize.
[2024-05-26 18:58:31] [INFO ] Deduced a trap composed of 34 places in 807 ms of which 10 ms to minimize.
[2024-05-26 18:58:32] [INFO ] Deduced a trap composed of 94 places in 797 ms of which 10 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1981 variables, 20/1156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 18:58:34] [INFO ] Deduced a trap composed of 57 places in 659 ms of which 10 ms to minimize.
[2024-05-26 18:58:35] [INFO ] Deduced a trap composed of 12 places in 686 ms of which 6 ms to minimize.
[2024-05-26 18:58:36] [INFO ] Deduced a trap composed of 34 places in 532 ms of which 7 ms to minimize.
[2024-05-26 18:58:37] [INFO ] Deduced a trap composed of 38 places in 692 ms of which 10 ms to minimize.
[2024-05-26 18:58:38] [INFO ] Deduced a trap composed of 39 places in 802 ms of which 10 ms to minimize.
[2024-05-26 18:58:39] [INFO ] Deduced a trap composed of 22 places in 808 ms of which 10 ms to minimize.
[2024-05-26 18:58:39] [INFO ] Deduced a trap composed of 22 places in 769 ms of which 10 ms to minimize.
[2024-05-26 18:58:40] [INFO ] Deduced a trap composed of 105 places in 783 ms of which 10 ms to minimize.
[2024-05-26 18:58:41] [INFO ] Deduced a trap composed of 121 places in 829 ms of which 10 ms to minimize.
[2024-05-26 18:58:42] [INFO ] Deduced a trap composed of 50 places in 780 ms of which 10 ms to minimize.
[2024-05-26 18:58:43] [INFO ] Deduced a trap composed of 39 places in 798 ms of which 10 ms to minimize.
[2024-05-26 18:58:45] [INFO ] Deduced a trap composed of 39 places in 673 ms of which 10 ms to minimize.
[2024-05-26 18:58:46] [INFO ] Deduced a trap composed of 30 places in 741 ms of which 8 ms to minimize.
[2024-05-26 18:58:47] [INFO ] Deduced a trap composed of 50 places in 648 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1981/1981 variables, and 1170 constraints, problems are : Problem set: 0 solved, 3 unsolved in 75014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 742/742 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 75/75 constraints]
After SMT, in 76739ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 301 out of 742 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Applied a total of 0 rules in 43 ms. Remains 742 /742 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 742/742 places, 1449/1449 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Applied a total of 0 rules in 38 ms. Remains 742 /742 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
[2024-05-26 18:58:48] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 18:58:48] [INFO ] Invariant cache hit.
[2024-05-26 18:58:48] [INFO ] Implicit Places using invariants in 842 ms returned []
[2024-05-26 18:58:48] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 18:58:48] [INFO ] Invariant cache hit.
[2024-05-26 18:58:49] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 18:58:53] [INFO ] Implicit Places using invariants and state equation in 4526 ms returned []
Implicit Place search using SMT with State Equation took 5375 ms to find 0 implicit places.
[2024-05-26 18:58:53] [INFO ] Redundant transitions in 154 ms returned []
Running 1442 sub problems to find dead transitions.
[2024-05-26 18:58:53] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 18:58:53] [INFO ] Invariant cache hit.
[2024-05-26 18:58:53] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/742 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 742/1981 variables, and 20 constraints, problems are : Problem set: 0 solved, 1442 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/742 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1442/1442 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1442 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/742 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
[2024-05-26 18:59:27] [INFO ] Deduced a trap composed of 16 places in 466 ms of which 7 ms to minimize.
[2024-05-26 18:59:27] [INFO ] Deduced a trap composed of 36 places in 508 ms of which 7 ms to minimize.
[2024-05-26 18:59:28] [INFO ] Deduced a trap composed of 33 places in 735 ms of which 10 ms to minimize.
[2024-05-26 18:59:29] [INFO ] Deduced a trap composed of 52 places in 691 ms of which 10 ms to minimize.
[2024-05-26 18:59:29] [INFO ] Deduced a trap composed of 62 places in 714 ms of which 9 ms to minimize.
[2024-05-26 18:59:30] [INFO ] Deduced a trap composed of 60 places in 567 ms of which 8 ms to minimize.
[2024-05-26 18:59:31] [INFO ] Deduced a trap composed of 82 places in 770 ms of which 9 ms to minimize.
[2024-05-26 18:59:31] [INFO ] Deduced a trap composed of 46 places in 755 ms of which 10 ms to minimize.
[2024-05-26 18:59:32] [INFO ] Deduced a trap composed of 123 places in 770 ms of which 10 ms to minimize.
[2024-05-26 18:59:33] [INFO ] Deduced a trap composed of 49 places in 788 ms of which 10 ms to minimize.
[2024-05-26 18:59:34] [INFO ] Deduced a trap composed of 61 places in 780 ms of which 10 ms to minimize.
[2024-05-26 18:59:35] [INFO ] Deduced a trap composed of 28 places in 807 ms of which 10 ms to minimize.
[2024-05-26 18:59:36] [INFO ] Deduced a trap composed of 37 places in 919 ms of which 10 ms to minimize.
[2024-05-26 18:59:37] [INFO ] Deduced a trap composed of 57 places in 875 ms of which 11 ms to minimize.
[2024-05-26 18:59:37] [INFO ] Deduced a trap composed of 39 places in 841 ms of which 10 ms to minimize.
[2024-05-26 18:59:38] [INFO ] Deduced a trap composed of 57 places in 759 ms of which 10 ms to minimize.
[2024-05-26 18:59:39] [INFO ] Deduced a trap composed of 51 places in 625 ms of which 9 ms to minimize.
[2024-05-26 18:59:40] [INFO ] Deduced a trap composed of 16 places in 825 ms of which 10 ms to minimize.
[2024-05-26 18:59:41] [INFO ] Deduced a trap composed of 16 places in 866 ms of which 10 ms to minimize.
[2024-05-26 18:59:41] [INFO ] Deduced a trap composed of 16 places in 696 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/742 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
[2024-05-26 18:59:43] [INFO ] Deduced a trap composed of 26 places in 474 ms of which 6 ms to minimize.
[2024-05-26 18:59:43] [INFO ] Deduced a trap composed of 26 places in 808 ms of which 9 ms to minimize.
[2024-05-26 18:59:44] [INFO ] Deduced a trap composed of 26 places in 594 ms of which 8 ms to minimize.
[2024-05-26 18:59:45] [INFO ] Deduced a trap composed of 26 places in 614 ms of which 8 ms to minimize.
[2024-05-26 18:59:45] [INFO ] Deduced a trap composed of 26 places in 656 ms of which 8 ms to minimize.
[2024-05-26 18:59:46] [INFO ] Deduced a trap composed of 62 places in 635 ms of which 9 ms to minimize.
[2024-05-26 18:59:47] [INFO ] Deduced a trap composed of 26 places in 764 ms of which 9 ms to minimize.
[2024-05-26 18:59:48] [INFO ] Deduced a trap composed of 22 places in 783 ms of which 10 ms to minimize.
[2024-05-26 18:59:48] [INFO ] Deduced a trap composed of 44 places in 752 ms of which 10 ms to minimize.
[2024-05-26 18:59:49] [INFO ] Deduced a trap composed of 26 places in 765 ms of which 9 ms to minimize.
[2024-05-26 18:59:50] [INFO ] Deduced a trap composed of 37 places in 795 ms of which 9 ms to minimize.
[2024-05-26 18:59:51] [INFO ] Deduced a trap composed of 12 places in 806 ms of which 10 ms to minimize.
[2024-05-26 18:59:52] [INFO ] Deduced a trap composed of 26 places in 716 ms of which 8 ms to minimize.
[2024-05-26 18:59:52] [INFO ] Deduced a trap composed of 14 places in 701 ms of which 9 ms to minimize.
[2024-05-26 18:59:53] [INFO ] Deduced a trap composed of 96 places in 623 ms of which 8 ms to minimize.
[2024-05-26 18:59:54] [INFO ] Deduced a trap composed of 36 places in 596 ms of which 8 ms to minimize.
[2024-05-26 18:59:54] [INFO ] Deduced a trap composed of 22 places in 641 ms of which 8 ms to minimize.
SMT process timed out in 61115ms, After SMT, problems are : Problem set: 0 solved, 1442 unsolved
Search for dead transitions found 0 dead transitions in 61150ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66732 ms. Remains : 742/742 places, 1449/1449 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1, 6] Max Struct:[7, 7]
Starting property specific reduction for Peterson-COL-6-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
[2024-05-26 18:59:54] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 18:59:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2 resets) in 37 ms. (263 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[7]
[2024-05-26 18:59:54] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 18:59:54] [INFO ] Invariant cache hit.
[2024-05-26 18:59:55] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned sat
[2024-05-26 18:59:55] [INFO ] [Real]Absence check using state equation in 685 ms returned sat
[2024-05-26 18:59:55] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 18:59:55] [INFO ] [Real]Added 330 Read/Feed constraints in 75 ms returned sat
[2024-05-26 18:59:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 18:59:56] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2024-05-26 18:59:56] [INFO ] [Nat]Absence check using state equation in 694 ms returned sat
[2024-05-26 18:59:57] [INFO ] [Nat]Added 330 Read/Feed constraints in 301 ms returned sat
[2024-05-26 18:59:57] [INFO ] Deduced a trap composed of 66 places in 715 ms of which 9 ms to minimize.
[2024-05-26 18:59:58] [INFO ] Deduced a trap composed of 12 places in 762 ms of which 9 ms to minimize.
[2024-05-26 18:59:59] [INFO ] Deduced a trap composed of 14 places in 784 ms of which 10 ms to minimize.
[2024-05-26 19:00:00] [INFO ] Deduced a trap composed of 28 places in 795 ms of which 10 ms to minimize.
[2024-05-26 19:00:01] [INFO ] Deduced a trap composed of 14 places in 622 ms of which 10 ms to minimize.
[2024-05-26 19:00:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:929)
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)
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[7]
Support contains 7 out of 742 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 742 transition count 1371
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 156 place count 664 transition count 1371
Performed 216 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 216 Pre rules applied. Total rules applied 156 place count 664 transition count 1155
Deduced a syphon composed of 216 places in 1 ms
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 2 with 432 rules applied. Total rules applied 588 place count 448 transition count 1155
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 672 place count 406 transition count 1113
Applied a total of 672 rules in 104 ms. Remains 406 /742 variables (removed 336) and now considering 1113/1449 (removed 336) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 406/742 places, 1113/1449 transitions.
[2024-05-26 19:00:01] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 406 cols
[2024-05-26 19:00:01] [INFO ] Computed 20 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[7]
RANDOM walk for 1000000 steps (2 resets) in 2366 ms. (422 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 741 ms. (1347 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[7]
[2024-05-26 19:00:04] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2024-05-26 19:00:04] [INFO ] Invariant cache hit.
[2024-05-26 19:00:04] [INFO ] [Real]Absence check using 20 positive place invariants in 15 ms returned sat
[2024-05-26 19:00:04] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2024-05-26 19:00:04] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 19:00:04] [INFO ] [Real]Added 330 Read/Feed constraints in 37 ms returned sat
[2024-05-26 19:00:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 19:00:05] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2024-05-26 19:00:05] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2024-05-26 19:00:05] [INFO ] [Nat]Added 330 Read/Feed constraints in 133 ms returned sat
[2024-05-26 19:00:06] [INFO ] Deduced a trap composed of 56 places in 361 ms of which 4 ms to minimize.
[2024-05-26 19:00:06] [INFO ] Deduced a trap composed of 10 places in 432 ms of which 5 ms to minimize.
[2024-05-26 19:00:07] [INFO ] Deduced a trap composed of 12 places in 430 ms of which 5 ms to minimize.
[2024-05-26 19:00:07] [INFO ] Deduced a trap composed of 44 places in 440 ms of which 6 ms to minimize.
[2024-05-26 19:00:08] [INFO ] Deduced a trap composed of 43 places in 440 ms of which 5 ms to minimize.
[2024-05-26 19:00:08] [INFO ] Deduced a trap composed of 40 places in 431 ms of which 5 ms to minimize.
[2024-05-26 19:00:09] [INFO ] Deduced a trap composed of 38 places in 434 ms of which 5 ms to minimize.
[2024-05-26 19:00:09] [INFO ] Deduced a trap composed of 25 places in 430 ms of which 6 ms to minimize.
[2024-05-26 19:00:10] [INFO ] Deduced a trap composed of 27 places in 421 ms of which 6 ms to minimize.
[2024-05-26 19:00:10] [INFO ] Deduced a trap composed of 12 places in 437 ms of which 6 ms to minimize.
[2024-05-26 19:00:10] [INFO ] Deduced a trap composed of 11 places in 439 ms of which 5 ms to minimize.
[2024-05-26 19:00:11] [INFO ] Deduced a trap composed of 66 places in 436 ms of which 6 ms to minimize.
[2024-05-26 19:00:11] [INFO ] Deduced a trap composed of 56 places in 424 ms of which 5 ms to minimize.
[2024-05-26 19:00:12] [INFO ] Deduced a trap composed of 12 places in 424 ms of which 5 ms to minimize.
[2024-05-26 19:00:12] [INFO ] Deduced a trap composed of 49 places in 419 ms of which 6 ms to minimize.
[2024-05-26 19:00:13] [INFO ] Deduced a trap composed of 10 places in 409 ms of which 5 ms to minimize.
[2024-05-26 19:00:13] [INFO ] Deduced a trap composed of 47 places in 425 ms of which 6 ms to minimize.
[2024-05-26 19:00:14] [INFO ] Deduced a trap composed of 14 places in 354 ms of which 5 ms to minimize.
[2024-05-26 19:00:14] [INFO ] Deduced a trap composed of 30 places in 436 ms of which 5 ms to minimize.
[2024-05-26 19:00:15] [INFO ] Deduced a trap composed of 52 places in 382 ms of which 5 ms to minimize.
[2024-05-26 19:00:15] [INFO ] Deduced a trap composed of 53 places in 414 ms of which 5 ms to minimize.
[2024-05-26 19:00:16] [INFO ] Deduced a trap composed of 34 places in 310 ms of which 5 ms to minimize.
[2024-05-26 19:00:16] [INFO ] Deduced a trap composed of 78 places in 413 ms of which 6 ms to minimize.
[2024-05-26 19:00:17] [INFO ] Deduced a trap composed of 30 places in 402 ms of which 5 ms to minimize.
[2024-05-26 19:00:17] [INFO ] Deduced a trap composed of 26 places in 396 ms of which 5 ms to minimize.
[2024-05-26 19:00:18] [INFO ] Deduced a trap composed of 44 places in 426 ms of which 6 ms to minimize.
[2024-05-26 19:00:18] [INFO ] Deduced a trap composed of 27 places in 421 ms of which 5 ms to minimize.
[2024-05-26 19:00:19] [INFO ] Deduced a trap composed of 67 places in 400 ms of which 5 ms to minimize.
[2024-05-26 19:00:19] [INFO ] Deduced a trap composed of 18 places in 426 ms of which 6 ms to minimize.
[2024-05-26 19:00:20] [INFO ] Deduced a trap composed of 43 places in 409 ms of which 5 ms to minimize.
[2024-05-26 19:00:20] [INFO ] Deduced a trap composed of 18 places in 407 ms of which 5 ms to minimize.
[2024-05-26 19:00:21] [INFO ] Deduced a trap composed of 57 places in 310 ms of which 6 ms to minimize.
[2024-05-26 19:00:21] [INFO ] Deduced a trap composed of 26 places in 398 ms of which 6 ms to minimize.
[2024-05-26 19:00:22] [INFO ] Deduced a trap composed of 36 places in 414 ms of which 6 ms to minimize.
[2024-05-26 19:00:23] [INFO ] Deduced a trap composed of 50 places in 419 ms of which 8 ms to minimize.
[2024-05-26 19:00:23] [INFO ] Deduced a trap composed of 60 places in 405 ms of which 5 ms to minimize.
[2024-05-26 19:00:24] [INFO ] Deduced a trap composed of 50 places in 390 ms of which 6 ms to minimize.
[2024-05-26 19:00:24] [INFO ] Deduced a trap composed of 39 places in 435 ms of which 5 ms to minimize.
[2024-05-26 19:00:25] [INFO ] Deduced a trap composed of 18 places in 421 ms of which 5 ms to minimize.
[2024-05-26 19:00:26] [INFO ] Deduced a trap composed of 36 places in 292 ms of which 4 ms to minimize.
[2024-05-26 19:00:27] [INFO ] Deduced a trap composed of 33 places in 458 ms of which 6 ms to minimize.
[2024-05-26 19:00:27] [INFO ] Deduced a trap composed of 48 places in 364 ms of which 5 ms to minimize.
[2024-05-26 19:00:28] [INFO ] Deduced a trap composed of 26 places in 313 ms of which 5 ms to minimize.
[2024-05-26 19:00:29] [INFO ] Deduced a trap composed of 36 places in 491 ms of which 5 ms to minimize.
[2024-05-26 19:00:29] [INFO ] Deduced a trap composed of 19 places in 449 ms of which 5 ms to minimize.
[2024-05-26 19:00:30] [INFO ] Deduced a trap composed of 13 places in 436 ms of which 6 ms to minimize.
[2024-05-26 19:00:30] [INFO ] Deduced a trap composed of 30 places in 436 ms of which 5 ms to minimize.
[2024-05-26 19:00:31] [INFO ] Deduced a trap composed of 52 places in 398 ms of which 5 ms to minimize.
[2024-05-26 19:00:31] [INFO ] Deduced a trap composed of 23 places in 398 ms of which 5 ms to minimize.
[2024-05-26 19:00:33] [INFO ] Deduced a trap composed of 29 places in 346 ms of which 4 ms to minimize.
[2024-05-26 19:00:33] [INFO ] Deduced a trap composed of 41 places in 346 ms of which 6 ms to minimize.
[2024-05-26 19:00:34] [INFO ] Deduced a trap composed of 23 places in 347 ms of which 5 ms to minimize.
[2024-05-26 19:00:35] [INFO ] Deduced a trap composed of 41 places in 236 ms of which 4 ms to minimize.
[2024-05-26 19:00:35] [INFO ] Deduced a trap composed of 27 places in 364 ms of which 5 ms to minimize.
[2024-05-26 19:00:36] [INFO ] Deduced a trap composed of 32 places in 344 ms of which 5 ms to minimize.
[2024-05-26 19:00:37] [INFO ] Deduced a trap composed of 53 places in 326 ms of which 6 ms to minimize.
[2024-05-26 19:00:37] [INFO ] Deduced a trap composed of 64 places in 403 ms of which 5 ms to minimize.
[2024-05-26 19:00:38] [INFO ] Deduced a trap composed of 51 places in 328 ms of which 5 ms to minimize.
[2024-05-26 19:00:38] [INFO ] Deduced a trap composed of 41 places in 420 ms of which 5 ms to minimize.
[2024-05-26 19:00:38] [INFO ] Deduced a trap composed of 37 places in 356 ms of which 5 ms to minimize.
[2024-05-26 19:00:39] [INFO ] Deduced a trap composed of 47 places in 441 ms of which 5 ms to minimize.
[2024-05-26 19:00:39] [INFO ] Deduced a trap composed of 45 places in 417 ms of which 5 ms to minimize.
[2024-05-26 19:00:44] [INFO ] Trap strengthening (SAT) tested/added 62/62 trap constraints in 38795 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[7]
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 17 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 406/406 places, 1113/1113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 18 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2024-05-26 19:00:44] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2024-05-26 19:00:44] [INFO ] Invariant cache hit.
[2024-05-26 19:00:45] [INFO ] Implicit Places using invariants in 496 ms returned []
[2024-05-26 19:00:45] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2024-05-26 19:00:45] [INFO ] Invariant cache hit.
[2024-05-26 19:00:45] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 19:00:47] [INFO ] Implicit Places using invariants and state equation in 1966 ms returned []
Implicit Place search using SMT with State Equation took 2463 ms to find 0 implicit places.
[2024-05-26 19:00:47] [INFO ] Redundant transitions in 24 ms returned []
Running 1106 sub problems to find dead transitions.
[2024-05-26 19:00:47] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2024-05-26 19:00:47] [INFO ] Invariant cache hit.
[2024-05-26 19:00:47] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2024-05-26 19:00:58] [INFO ] Deduced a trap composed of 21 places in 449 ms of which 6 ms to minimize.
[2024-05-26 19:00:59] [INFO ] Deduced a trap composed of 20 places in 324 ms of which 4 ms to minimize.
[2024-05-26 19:00:59] [INFO ] Deduced a trap composed of 21 places in 262 ms of which 3 ms to minimize.
[2024-05-26 19:01:00] [INFO ] Deduced a trap composed of 22 places in 442 ms of which 5 ms to minimize.
[2024-05-26 19:01:00] [INFO ] Deduced a trap composed of 19 places in 465 ms of which 6 ms to minimize.
[2024-05-26 19:01:01] [INFO ] Deduced a trap composed of 25 places in 493 ms of which 6 ms to minimize.
[2024-05-26 19:01:01] [INFO ] Deduced a trap composed of 13 places in 455 ms of which 6 ms to minimize.
[2024-05-26 19:01:01] [INFO ] Deduced a trap composed of 14 places in 433 ms of which 6 ms to minimize.
[2024-05-26 19:01:02] [INFO ] Deduced a trap composed of 23 places in 447 ms of which 5 ms to minimize.
[2024-05-26 19:01:02] [INFO ] Deduced a trap composed of 44 places in 449 ms of which 6 ms to minimize.
[2024-05-26 19:01:03] [INFO ] Deduced a trap composed of 14 places in 448 ms of which 5 ms to minimize.
[2024-05-26 19:01:03] [INFO ] Deduced a trap composed of 23 places in 430 ms of which 5 ms to minimize.
[2024-05-26 19:01:04] [INFO ] Deduced a trap composed of 23 places in 412 ms of which 6 ms to minimize.
[2024-05-26 19:01:04] [INFO ] Deduced a trap composed of 84 places in 449 ms of which 6 ms to minimize.
[2024-05-26 19:01:05] [INFO ] Deduced a trap composed of 77 places in 454 ms of which 6 ms to minimize.
[2024-05-26 19:01:05] [INFO ] Deduced a trap composed of 67 places in 445 ms of which 6 ms to minimize.
[2024-05-26 19:01:06] [INFO ] Deduced a trap composed of 81 places in 438 ms of which 5 ms to minimize.
[2024-05-26 19:01:06] [INFO ] Deduced a trap composed of 44 places in 469 ms of which 5 ms to minimize.
[2024-05-26 19:01:07] [INFO ] Deduced a trap composed of 23 places in 443 ms of which 6 ms to minimize.
[2024-05-26 19:01:07] [INFO ] Deduced a trap composed of 23 places in 437 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2024-05-26 19:01:08] [INFO ] Deduced a trap composed of 44 places in 444 ms of which 6 ms to minimize.
[2024-05-26 19:01:09] [INFO ] Deduced a trap composed of 21 places in 451 ms of which 6 ms to minimize.
[2024-05-26 19:01:09] [INFO ] Deduced a trap composed of 24 places in 415 ms of which 5 ms to minimize.
[2024-05-26 19:01:10] [INFO ] Deduced a trap composed of 46 places in 466 ms of which 6 ms to minimize.
[2024-05-26 19:01:10] [INFO ] Deduced a trap composed of 43 places in 464 ms of which 5 ms to minimize.
[2024-05-26 19:01:10] [INFO ] Deduced a trap composed of 52 places in 472 ms of which 6 ms to minimize.
[2024-05-26 19:01:11] [INFO ] Deduced a trap composed of 43 places in 478 ms of which 5 ms to minimize.
[2024-05-26 19:01:11] [INFO ] Deduced a trap composed of 13 places in 419 ms of which 6 ms to minimize.
[2024-05-26 19:01:12] [INFO ] Deduced a trap composed of 38 places in 446 ms of which 6 ms to minimize.
[2024-05-26 19:01:12] [INFO ] Deduced a trap composed of 23 places in 416 ms of which 5 ms to minimize.
[2024-05-26 19:01:13] [INFO ] Deduced a trap composed of 23 places in 389 ms of which 5 ms to minimize.
[2024-05-26 19:01:13] [INFO ] Deduced a trap composed of 39 places in 427 ms of which 5 ms to minimize.
[2024-05-26 19:01:14] [INFO ] Deduced a trap composed of 10 places in 410 ms of which 5 ms to minimize.
[2024-05-26 19:01:14] [INFO ] Deduced a trap composed of 12 places in 439 ms of which 5 ms to minimize.
[2024-05-26 19:01:14] [INFO ] Deduced a trap composed of 21 places in 434 ms of which 6 ms to minimize.
[2024-05-26 19:01:15] [INFO ] Deduced a trap composed of 15 places in 375 ms of which 5 ms to minimize.
[2024-05-26 19:01:15] [INFO ] Deduced a trap composed of 11 places in 499 ms of which 6 ms to minimize.
[2024-05-26 19:01:16] [INFO ] Deduced a trap composed of 23 places in 503 ms of which 6 ms to minimize.
[2024-05-26 19:01:16] [INFO ] Deduced a trap composed of 13 places in 460 ms of which 6 ms to minimize.
[2024-05-26 19:01:17] [INFO ] Deduced a trap composed of 38 places in 471 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 406/1309 variables, and 60 constraints, problems are : Problem set: 0 solved, 1106 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/406 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1106/1106 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 40/60 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2024-05-26 19:01:19] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 3 ms to minimize.
[2024-05-26 19:01:19] [INFO ] Deduced a trap composed of 21 places in 223 ms of which 4 ms to minimize.
[2024-05-26 19:01:19] [INFO ] Deduced a trap composed of 11 places in 323 ms of which 5 ms to minimize.
[2024-05-26 19:01:20] [INFO ] Deduced a trap composed of 72 places in 451 ms of which 6 ms to minimize.
[2024-05-26 19:01:20] [INFO ] Deduced a trap composed of 63 places in 500 ms of which 5 ms to minimize.
[2024-05-26 19:01:21] [INFO ] Deduced a trap composed of 29 places in 448 ms of which 5 ms to minimize.
[2024-05-26 19:01:21] [INFO ] Deduced a trap composed of 38 places in 412 ms of which 7 ms to minimize.
[2024-05-26 19:01:22] [INFO ] Deduced a trap composed of 32 places in 482 ms of which 6 ms to minimize.
[2024-05-26 19:01:22] [INFO ] Deduced a trap composed of 36 places in 394 ms of which 5 ms to minimize.
[2024-05-26 19:01:23] [INFO ] Deduced a trap composed of 28 places in 408 ms of which 6 ms to minimize.
[2024-05-26 19:01:23] [INFO ] Deduced a trap composed of 44 places in 396 ms of which 6 ms to minimize.
[2024-05-26 19:01:24] [INFO ] Deduced a trap composed of 36 places in 446 ms of which 5 ms to minimize.
[2024-05-26 19:01:24] [INFO ] Deduced a trap composed of 50 places in 399 ms of which 5 ms to minimize.
[2024-05-26 19:01:24] [INFO ] Deduced a trap composed of 47 places in 397 ms of which 5 ms to minimize.
[2024-05-26 19:01:25] [INFO ] Deduced a trap composed of 66 places in 380 ms of which 5 ms to minimize.
[2024-05-26 19:01:25] [INFO ] Deduced a trap composed of 60 places in 434 ms of which 5 ms to minimize.
[2024-05-26 19:01:26] [INFO ] Deduced a trap composed of 42 places in 411 ms of which 8 ms to minimize.
[2024-05-26 19:01:26] [INFO ] Deduced a trap composed of 46 places in 430 ms of which 6 ms to minimize.
[2024-05-26 19:01:26] [INFO ] Deduced a trap composed of 74 places in 406 ms of which 6 ms to minimize.
[2024-05-26 19:01:27] [INFO ] Deduced a trap composed of 42 places in 388 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2024-05-26 19:01:28] [INFO ] Deduced a trap composed of 45 places in 453 ms of which 6 ms to minimize.
[2024-05-26 19:01:29] [INFO ] Deduced a trap composed of 39 places in 465 ms of which 6 ms to minimize.
[2024-05-26 19:01:29] [INFO ] Deduced a trap composed of 42 places in 447 ms of which 6 ms to minimize.
[2024-05-26 19:01:30] [INFO ] Deduced a trap composed of 33 places in 438 ms of which 6 ms to minimize.
[2024-05-26 19:01:30] [INFO ] Deduced a trap composed of 61 places in 444 ms of which 5 ms to minimize.
[2024-05-26 19:01:30] [INFO ] Deduced a trap composed of 37 places in 454 ms of which 6 ms to minimize.
[2024-05-26 19:01:31] [INFO ] Deduced a trap composed of 29 places in 387 ms of which 5 ms to minimize.
[2024-05-26 19:01:31] [INFO ] Deduced a trap composed of 38 places in 420 ms of which 5 ms to minimize.
[2024-05-26 19:01:32] [INFO ] Deduced a trap composed of 33 places in 438 ms of which 6 ms to minimize.
[2024-05-26 19:01:32] [INFO ] Deduced a trap composed of 32 places in 463 ms of which 5 ms to minimize.
[2024-05-26 19:01:33] [INFO ] Deduced a trap composed of 25 places in 441 ms of which 6 ms to minimize.
[2024-05-26 19:01:33] [INFO ] Deduced a trap composed of 45 places in 341 ms of which 4 ms to minimize.
[2024-05-26 19:01:33] [INFO ] Deduced a trap composed of 47 places in 268 ms of which 3 ms to minimize.
[2024-05-26 19:01:34] [INFO ] Deduced a trap composed of 73 places in 343 ms of which 4 ms to minimize.
[2024-05-26 19:01:34] [INFO ] Deduced a trap composed of 87 places in 366 ms of which 4 ms to minimize.
[2024-05-26 19:01:34] [INFO ] Deduced a trap composed of 47 places in 315 ms of which 4 ms to minimize.
[2024-05-26 19:01:35] [INFO ] Deduced a trap composed of 31 places in 328 ms of which 4 ms to minimize.
[2024-05-26 19:01:35] [INFO ] Deduced a trap composed of 52 places in 306 ms of which 4 ms to minimize.
[2024-05-26 19:01:35] [INFO ] Deduced a trap composed of 28 places in 307 ms of which 4 ms to minimize.
[2024-05-26 19:01:36] [INFO ] Deduced a trap composed of 28 places in 234 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2024-05-26 19:01:37] [INFO ] Deduced a trap composed of 21 places in 339 ms of which 3 ms to minimize.
[2024-05-26 19:01:37] [INFO ] Deduced a trap composed of 52 places in 293 ms of which 4 ms to minimize.
[2024-05-26 19:01:37] [INFO ] Deduced a trap composed of 52 places in 402 ms of which 6 ms to minimize.
[2024-05-26 19:01:38] [INFO ] Deduced a trap composed of 66 places in 366 ms of which 5 ms to minimize.
[2024-05-26 19:01:38] [INFO ] Deduced a trap composed of 45 places in 316 ms of which 5 ms to minimize.
[2024-05-26 19:01:39] [INFO ] Deduced a trap composed of 38 places in 421 ms of which 5 ms to minimize.
[2024-05-26 19:01:39] [INFO ] Deduced a trap composed of 66 places in 392 ms of which 6 ms to minimize.
[2024-05-26 19:01:39] [INFO ] Deduced a trap composed of 59 places in 433 ms of which 5 ms to minimize.
[2024-05-26 19:01:40] [INFO ] Deduced a trap composed of 54 places in 412 ms of which 5 ms to minimize.
[2024-05-26 19:01:40] [INFO ] Deduced a trap composed of 55 places in 410 ms of which 5 ms to minimize.
[2024-05-26 19:01:41] [INFO ] Deduced a trap composed of 86 places in 413 ms of which 5 ms to minimize.
[2024-05-26 19:01:41] [INFO ] Deduced a trap composed of 69 places in 409 ms of which 6 ms to minimize.
[2024-05-26 19:01:42] [INFO ] Deduced a trap composed of 42 places in 491 ms of which 5 ms to minimize.
[2024-05-26 19:01:42] [INFO ] Deduced a trap composed of 48 places in 430 ms of which 6 ms to minimize.
[2024-05-26 19:01:43] [INFO ] Deduced a trap composed of 22 places in 447 ms of which 6 ms to minimize.
[2024-05-26 19:01:43] [INFO ] Deduced a trap composed of 29 places in 421 ms of which 5 ms to minimize.
[2024-05-26 19:01:43] [INFO ] Deduced a trap composed of 48 places in 440 ms of which 6 ms to minimize.
[2024-05-26 19:01:44] [INFO ] Deduced a trap composed of 31 places in 390 ms of which 5 ms to minimize.
[2024-05-26 19:01:44] [INFO ] Deduced a trap composed of 28 places in 450 ms of which 6 ms to minimize.
[2024-05-26 19:01:45] [INFO ] Deduced a trap composed of 69 places in 449 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2024-05-26 19:01:46] [INFO ] Deduced a trap composed of 41 places in 459 ms of which 5 ms to minimize.
[2024-05-26 19:01:47] [INFO ] Deduced a trap composed of 50 places in 446 ms of which 6 ms to minimize.
[2024-05-26 19:01:47] [INFO ] Deduced a trap composed of 45 places in 438 ms of which 6 ms to minimize.
[2024-05-26 19:01:48] [INFO ] Deduced a trap composed of 45 places in 428 ms of which 5 ms to minimize.
SMT process timed out in 60926ms, After SMT, problems are : Problem set: 0 solved, 1106 unsolved
Search for dead transitions found 0 dead transitions in 60942ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63458 ms. Remains : 406/406 places, 1113/1113 transitions.
RANDOM walk for 40000 steps (8 resets) in 269 ms. (148 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 287592 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 2
Probabilistic random walk after 287592 steps, saw 43518 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
[2024-05-26 19:01:51] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2024-05-26 19:01:51] [INFO ] Invariant cache hit.
[2024-05-26 19:01:51] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 350/357 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/364 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 903/1267 variables, 364/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1267 variables, 330/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1267 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 42/1309 variables, 42/750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1309 variables, 6/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1309 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1309 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 756 constraints, problems are : Problem set: 0 solved, 2 unsolved in 970 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 350/357 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/364 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 903/1267 variables, 364/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1267 variables, 330/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1267 variables, 2/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1267 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 42/1309 variables, 42/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1309 variables, 6/758 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 19:01:53] [INFO ] Deduced a trap composed of 21 places in 458 ms of which 6 ms to minimize.
[2024-05-26 19:01:54] [INFO ] Deduced a trap composed of 27 places in 450 ms of which 5 ms to minimize.
[2024-05-26 19:01:54] [INFO ] Deduced a trap composed of 20 places in 440 ms of which 5 ms to minimize.
[2024-05-26 19:01:55] [INFO ] Deduced a trap composed of 35 places in 451 ms of which 6 ms to minimize.
[2024-05-26 19:01:55] [INFO ] Deduced a trap composed of 43 places in 453 ms of which 5 ms to minimize.
[2024-05-26 19:01:56] [INFO ] Deduced a trap composed of 36 places in 434 ms of which 6 ms to minimize.
[2024-05-26 19:01:56] [INFO ] Deduced a trap composed of 21 places in 445 ms of which 6 ms to minimize.
[2024-05-26 19:01:57] [INFO ] Deduced a trap composed of 21 places in 460 ms of which 6 ms to minimize.
[2024-05-26 19:01:57] [INFO ] Deduced a trap composed of 32 places in 350 ms of which 5 ms to minimize.
SMT process timed out in 6283ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 28 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 406/406 places, 1113/1113 transitions.
RANDOM walk for 40000 steps (8 resets) in 734 ms. (54 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 344520 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 2
Probabilistic random walk after 344520 steps, saw 48927 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
[2024-05-26 19:02:00] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2024-05-26 19:02:00] [INFO ] Invariant cache hit.
[2024-05-26 19:02:00] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 350/357 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/364 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 903/1267 variables, 364/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1267 variables, 330/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1267 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 42/1309 variables, 42/750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1309 variables, 6/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1309 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1309 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 756 constraints, problems are : Problem set: 0 solved, 2 unsolved in 864 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 350/357 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/364 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 903/1267 variables, 364/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1267 variables, 330/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1267 variables, 2/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1267 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 42/1309 variables, 42/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1309 variables, 6/758 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 19:02:03] [INFO ] Deduced a trap composed of 21 places in 408 ms of which 6 ms to minimize.
[2024-05-26 19:02:03] [INFO ] Deduced a trap composed of 27 places in 439 ms of which 6 ms to minimize.
[2024-05-26 19:02:04] [INFO ] Deduced a trap composed of 20 places in 423 ms of which 6 ms to minimize.
[2024-05-26 19:02:04] [INFO ] Deduced a trap composed of 35 places in 429 ms of which 6 ms to minimize.
[2024-05-26 19:02:04] [INFO ] Deduced a trap composed of 43 places in 421 ms of which 5 ms to minimize.
[2024-05-26 19:02:05] [INFO ] Deduced a trap composed of 36 places in 419 ms of which 5 ms to minimize.
[2024-05-26 19:02:05] [INFO ] Deduced a trap composed of 21 places in 423 ms of which 6 ms to minimize.
[2024-05-26 19:02:06] [INFO ] Deduced a trap composed of 21 places in 371 ms of which 6 ms to minimize.
[2024-05-26 19:02:06] [INFO ] Deduced a trap composed of 32 places in 420 ms of which 6 ms to minimize.
[2024-05-26 19:02:07] [INFO ] Deduced a trap composed of 29 places in 466 ms of which 5 ms to minimize.
[2024-05-26 19:02:07] [INFO ] Deduced a trap composed of 60 places in 452 ms of which 5 ms to minimize.
[2024-05-26 19:02:08] [INFO ] Deduced a trap composed of 46 places in 384 ms of which 5 ms to minimize.
[2024-05-26 19:02:08] [INFO ] Deduced a trap composed of 43 places in 428 ms of which 6 ms to minimize.
[2024-05-26 19:02:09] [INFO ] Deduced a trap composed of 45 places in 421 ms of which 6 ms to minimize.
[2024-05-26 19:02:09] [INFO ] Deduced a trap composed of 28 places in 428 ms of which 5 ms to minimize.
[2024-05-26 19:02:09] [INFO ] Deduced a trap composed of 32 places in 433 ms of which 6 ms to minimize.
[2024-05-26 19:02:10] [INFO ] Deduced a trap composed of 37 places in 475 ms of which 5 ms to minimize.
[2024-05-26 19:02:10] [INFO ] Deduced a trap composed of 37 places in 460 ms of which 5 ms to minimize.
[2024-05-26 19:02:11] [INFO ] Deduced a trap composed of 47 places in 455 ms of which 5 ms to minimize.
[2024-05-26 19:02:11] [INFO ] Deduced a trap composed of 39 places in 476 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1309 variables, 20/778 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 19:02:12] [INFO ] Deduced a trap composed of 21 places in 465 ms of which 6 ms to minimize.
[2024-05-26 19:02:13] [INFO ] Deduced a trap composed of 46 places in 447 ms of which 6 ms to minimize.
[2024-05-26 19:02:13] [INFO ] Deduced a trap composed of 30 places in 461 ms of which 5 ms to minimize.
[2024-05-26 19:02:14] [INFO ] Deduced a trap composed of 19 places in 470 ms of which 6 ms to minimize.
[2024-05-26 19:02:14] [INFO ] Deduced a trap composed of 37 places in 431 ms of which 5 ms to minimize.
[2024-05-26 19:02:15] [INFO ] Deduced a trap composed of 29 places in 461 ms of which 6 ms to minimize.
[2024-05-26 19:02:15] [INFO ] Deduced a trap composed of 19 places in 455 ms of which 6 ms to minimize.
Problem MAX0 is UNSAT
[2024-05-26 19:02:16] [INFO ] Deduced a trap composed of 27 places in 448 ms of which 6 ms to minimize.
[2024-05-26 19:02:16] [INFO ] Deduced a trap composed of 27 places in 429 ms of which 5 ms to minimize.
[2024-05-26 19:02:16] [INFO ] Deduced a trap composed of 23 places in 426 ms of which 5 ms to minimize.
[2024-05-26 19:02:17] [INFO ] Deduced a trap composed of 42 places in 406 ms of which 5 ms to minimize.
[2024-05-26 19:02:17] [INFO ] Deduced a trap composed of 53 places in 383 ms of which 5 ms to minimize.
[2024-05-26 19:02:18] [INFO ] Deduced a trap composed of 71 places in 445 ms of which 6 ms to minimize.
[2024-05-26 19:02:18] [INFO ] Deduced a trap composed of 55 places in 399 ms of which 5 ms to minimize.
[2024-05-26 19:02:19] [INFO ] Deduced a trap composed of 25 places in 337 ms of which 5 ms to minimize.
[2024-05-26 19:02:19] [INFO ] Deduced a trap composed of 23 places in 404 ms of which 6 ms to minimize.
[2024-05-26 19:02:19] [INFO ] Deduced a trap composed of 31 places in 382 ms of which 5 ms to minimize.
[2024-05-26 19:02:20] [INFO ] Deduced a trap composed of 26 places in 359 ms of which 5 ms to minimize.
[2024-05-26 19:02:20] [INFO ] Deduced a trap composed of 45 places in 353 ms of which 4 ms to minimize.
[2024-05-26 19:02:21] [INFO ] Deduced a trap composed of 34 places in 358 ms of which 5 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/1309 variables, 20/798 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-26 19:02:21] [INFO ] Deduced a trap composed of 32 places in 488 ms of which 6 ms to minimize.
[2024-05-26 19:02:22] [INFO ] Deduced a trap composed of 54 places in 406 ms of which 6 ms to minimize.
[2024-05-26 19:02:22] [INFO ] Deduced a trap composed of 27 places in 465 ms of which 6 ms to minimize.
[2024-05-26 19:02:23] [INFO ] Deduced a trap composed of 35 places in 373 ms of which 5 ms to minimize.
[2024-05-26 19:02:23] [INFO ] Deduced a trap composed of 43 places in 453 ms of which 6 ms to minimize.
[2024-05-26 19:02:24] [INFO ] Deduced a trap composed of 54 places in 408 ms of which 5 ms to minimize.
[2024-05-26 19:02:24] [INFO ] Deduced a trap composed of 12 places in 441 ms of which 5 ms to minimize.
[2024-05-26 19:02:24] [INFO ] Deduced a trap composed of 38 places in 381 ms of which 5 ms to minimize.
[2024-05-26 19:02:25] [INFO ] Deduced a trap composed of 37 places in 406 ms of which 5 ms to minimize.
[2024-05-26 19:02:25] [INFO ] Deduced a trap composed of 40 places in 396 ms of which 6 ms to minimize.
[2024-05-26 19:02:26] [INFO ] Deduced a trap composed of 56 places in 406 ms of which 5 ms to minimize.
[2024-05-26 19:02:26] [INFO ] Deduced a trap composed of 36 places in 381 ms of which 5 ms to minimize.
[2024-05-26 19:02:27] [INFO ] Deduced a trap composed of 38 places in 372 ms of which 5 ms to minimize.
[2024-05-26 19:02:27] [INFO ] Deduced a trap composed of 22 places in 381 ms of which 5 ms to minimize.
[2024-05-26 19:02:27] [INFO ] Deduced a trap composed of 35 places in 355 ms of which 5 ms to minimize.
[2024-05-26 19:02:28] [INFO ] Deduced a trap composed of 39 places in 299 ms of which 5 ms to minimize.
[2024-05-26 19:02:28] [INFO ] Deduced a trap composed of 34 places in 340 ms of which 5 ms to minimize.
[2024-05-26 19:02:29] [INFO ] Deduced a trap composed of 44 places in 342 ms of which 4 ms to minimize.
[2024-05-26 19:02:29] [INFO ] Deduced a trap composed of 50 places in 328 ms of which 5 ms to minimize.
[2024-05-26 19:02:29] [INFO ] Deduced a trap composed of 57 places in 322 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 20/818 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-26 19:02:30] [INFO ] Deduced a trap composed of 30 places in 364 ms of which 5 ms to minimize.
[2024-05-26 19:02:30] [INFO ] Deduced a trap composed of 36 places in 344 ms of which 4 ms to minimize.
[2024-05-26 19:02:31] [INFO ] Deduced a trap composed of 46 places in 272 ms of which 5 ms to minimize.
[2024-05-26 19:02:31] [INFO ] Deduced a trap composed of 54 places in 328 ms of which 5 ms to minimize.
[2024-05-26 19:02:31] [INFO ] Deduced a trap composed of 41 places in 326 ms of which 5 ms to minimize.
[2024-05-26 19:02:32] [INFO ] Deduced a trap composed of 39 places in 333 ms of which 5 ms to minimize.
[2024-05-26 19:02:32] [INFO ] Deduced a trap composed of 55 places in 345 ms of which 5 ms to minimize.
[2024-05-26 19:02:33] [INFO ] Deduced a trap composed of 47 places in 330 ms of which 5 ms to minimize.
[2024-05-26 19:02:33] [INFO ] Deduced a trap composed of 60 places in 187 ms of which 4 ms to minimize.
[2024-05-26 19:02:34] [INFO ] Deduced a trap composed of 44 places in 244 ms of which 4 ms to minimize.
[2024-05-26 19:02:34] [INFO ] Deduced a trap composed of 52 places in 310 ms of which 4 ms to minimize.
[2024-05-26 19:02:34] [INFO ] Deduced a trap composed of 11 places in 308 ms of which 4 ms to minimize.
[2024-05-26 19:02:35] [INFO ] Deduced a trap composed of 54 places in 289 ms of which 5 ms to minimize.
[2024-05-26 19:02:35] [INFO ] Deduced a trap composed of 36 places in 316 ms of which 5 ms to minimize.
[2024-05-26 19:02:36] [INFO ] Deduced a trap composed of 46 places in 464 ms of which 6 ms to minimize.
[2024-05-26 19:02:36] [INFO ] Deduced a trap composed of 66 places in 379 ms of which 6 ms to minimize.
[2024-05-26 19:02:37] [INFO ] Deduced a trap composed of 11 places in 492 ms of which 7 ms to minimize.
[2024-05-26 19:02:37] [INFO ] Deduced a trap composed of 46 places in 738 ms of which 6 ms to minimize.
[2024-05-26 19:02:38] [INFO ] Deduced a trap composed of 30 places in 354 ms of which 5 ms to minimize.
[2024-05-26 19:02:38] [INFO ] Deduced a trap composed of 31 places in 348 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 20/838 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-26 19:02:39] [INFO ] Deduced a trap composed of 74 places in 270 ms of which 5 ms to minimize.
[2024-05-26 19:02:39] [INFO ] Deduced a trap composed of 13 places in 389 ms of which 5 ms to minimize.
[2024-05-26 19:02:40] [INFO ] Deduced a trap composed of 54 places in 364 ms of which 5 ms to minimize.
[2024-05-26 19:02:40] [INFO ] Deduced a trap composed of 38 places in 316 ms of which 4 ms to minimize.
[2024-05-26 19:02:40] [INFO ] Deduced a trap composed of 11 places in 305 ms of which 4 ms to minimize.
[2024-05-26 19:02:41] [INFO ] Deduced a trap composed of 54 places in 347 ms of which 4 ms to minimize.
[2024-05-26 19:02:41] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 4 ms to minimize.
[2024-05-26 19:02:41] [INFO ] Deduced a trap composed of 11 places in 301 ms of which 4 ms to minimize.
[2024-05-26 19:02:42] [INFO ] Deduced a trap composed of 35 places in 178 ms of which 3 ms to minimize.
[2024-05-26 19:02:42] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 3 ms to minimize.
[2024-05-26 19:02:43] [INFO ] Deduced a trap composed of 27 places in 236 ms of which 3 ms to minimize.
[2024-05-26 19:02:44] [INFO ] Deduced a trap composed of 24 places in 405 ms of which 6 ms to minimize.
[2024-05-26 19:02:44] [INFO ] Deduced a trap composed of 29 places in 362 ms of which 5 ms to minimize.
[2024-05-26 19:02:44] [INFO ] Deduced a trap composed of 42 places in 374 ms of which 5 ms to minimize.
[2024-05-26 19:02:45] [INFO ] Deduced a trap composed of 41 places in 371 ms of which 5 ms to minimize.
[2024-05-26 19:02:45] [INFO ] Deduced a trap composed of 53 places in 349 ms of which 5 ms to minimize.
[2024-05-26 19:02:46] [INFO ] Deduced a trap composed of 51 places in 370 ms of which 5 ms to minimize.
[2024-05-26 19:02:46] [INFO ] Deduced a trap composed of 12 places in 460 ms of which 6 ms to minimize.
[2024-05-26 19:02:47] [INFO ] Deduced a trap composed of 38 places in 380 ms of which 5 ms to minimize.
SMT process timed out in 46144ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 33 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 406/406 places, 1113/1113 transitions.
RANDOM walk for 40000 steps (8 resets) in 229 ms. (173 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 417984 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 1
Probabilistic random walk after 417984 steps, saw 60575 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
[2024-05-26 19:02:50] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2024-05-26 19:02:50] [INFO ] Invariant cache hit.
[2024-05-26 19:02:50] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 350/357 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 7/364 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 903/1267 variables, 364/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1267 variables, 330/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1267 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 42/1309 variables, 42/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1309 variables, 6/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1309 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1309 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 756 constraints, problems are : Problem set: 0 solved, 1 unsolved in 623 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 350/357 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/364 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 903/1267 variables, 364/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1267 variables, 330/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1267 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1267 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 42/1309 variables, 42/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1309 variables, 6/757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 19:02:51] [INFO ] Deduced a trap composed of 12 places in 405 ms of which 5 ms to minimize.
[2024-05-26 19:02:52] [INFO ] Deduced a trap composed of 27 places in 394 ms of which 5 ms to minimize.
[2024-05-26 19:02:52] [INFO ] Deduced a trap composed of 18 places in 465 ms of which 5 ms to minimize.
[2024-05-26 19:02:53] [INFO ] Deduced a trap composed of 11 places in 403 ms of which 5 ms to minimize.
[2024-05-26 19:02:53] [INFO ] Deduced a trap composed of 64 places in 389 ms of which 5 ms to minimize.
[2024-05-26 19:02:54] [INFO ] Deduced a trap composed of 44 places in 377 ms of which 5 ms to minimize.
[2024-05-26 19:02:54] [INFO ] Deduced a trap composed of 42 places in 410 ms of which 5 ms to minimize.
[2024-05-26 19:02:55] [INFO ] Deduced a trap composed of 44 places in 404 ms of which 5 ms to minimize.
[2024-05-26 19:02:55] [INFO ] Deduced a trap composed of 23 places in 334 ms of which 5 ms to minimize.
[2024-05-26 19:02:55] [INFO ] Deduced a trap composed of 73 places in 445 ms of which 6 ms to minimize.
[2024-05-26 19:02:56] [INFO ] Deduced a trap composed of 19 places in 381 ms of which 5 ms to minimize.
[2024-05-26 19:02:56] [INFO ] Deduced a trap composed of 15 places in 423 ms of which 5 ms to minimize.
[2024-05-26 19:02:57] [INFO ] Deduced a trap composed of 29 places in 427 ms of which 5 ms to minimize.
[2024-05-26 19:02:57] [INFO ] Deduced a trap composed of 25 places in 446 ms of which 5 ms to minimize.
[2024-05-26 19:02:58] [INFO ] Deduced a trap composed of 10 places in 444 ms of which 6 ms to minimize.
[2024-05-26 19:02:58] [INFO ] Deduced a trap composed of 17 places in 428 ms of which 6 ms to minimize.
[2024-05-26 19:02:59] [INFO ] Deduced a trap composed of 36 places in 401 ms of which 5 ms to minimize.
[2024-05-26 19:02:59] [INFO ] Deduced a trap composed of 28 places in 413 ms of which 5 ms to minimize.
[2024-05-26 19:03:00] [INFO ] Deduced a trap composed of 18 places in 420 ms of which 6 ms to minimize.
[2024-05-26 19:03:00] [INFO ] Deduced a trap composed of 28 places in 441 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1309 variables, 20/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 19:03:01] [INFO ] Deduced a trap composed of 10 places in 443 ms of which 5 ms to minimize.
[2024-05-26 19:03:01] [INFO ] Deduced a trap composed of 36 places in 399 ms of which 5 ms to minimize.
[2024-05-26 19:03:02] [INFO ] Deduced a trap composed of 27 places in 376 ms of which 6 ms to minimize.
[2024-05-26 19:03:02] [INFO ] Deduced a trap composed of 18 places in 414 ms of which 5 ms to minimize.
[2024-05-26 19:03:03] [INFO ] Deduced a trap composed of 11 places in 418 ms of which 6 ms to minimize.
[2024-05-26 19:03:03] [INFO ] Deduced a trap composed of 53 places in 380 ms of which 5 ms to minimize.
[2024-05-26 19:03:03] [INFO ] Deduced a trap composed of 53 places in 376 ms of which 5 ms to minimize.
[2024-05-26 19:03:04] [INFO ] Deduced a trap composed of 35 places in 394 ms of which 5 ms to minimize.
[2024-05-26 19:03:04] [INFO ] Deduced a trap composed of 27 places in 359 ms of which 5 ms to minimize.
[2024-05-26 19:03:05] [INFO ] Deduced a trap composed of 26 places in 362 ms of which 5 ms to minimize.
[2024-05-26 19:03:05] [INFO ] Deduced a trap composed of 31 places in 258 ms of which 4 ms to minimize.
[2024-05-26 19:03:05] [INFO ] Deduced a trap composed of 35 places in 349 ms of which 6 ms to minimize.
[2024-05-26 19:03:06] [INFO ] Deduced a trap composed of 39 places in 362 ms of which 3 ms to minimize.
[2024-05-26 19:03:06] [INFO ] Deduced a trap composed of 60 places in 240 ms of which 4 ms to minimize.
[2024-05-26 19:03:06] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 4 ms to minimize.
[2024-05-26 19:03:06] [INFO ] Deduced a trap composed of 46 places in 229 ms of which 4 ms to minimize.
[2024-05-26 19:03:07] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 3 ms to minimize.
[2024-05-26 19:03:07] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 4 ms to minimize.
[2024-05-26 19:03:07] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 3 ms to minimize.
[2024-05-26 19:03:07] [INFO ] Deduced a trap composed of 73 places in 210 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1309 variables, 20/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 19:03:08] [INFO ] Deduced a trap composed of 68 places in 213 ms of which 3 ms to minimize.
[2024-05-26 19:03:08] [INFO ] Deduced a trap composed of 39 places in 204 ms of which 3 ms to minimize.
[2024-05-26 19:03:08] [INFO ] Deduced a trap composed of 43 places in 232 ms of which 4 ms to minimize.
[2024-05-26 19:03:09] [INFO ] Deduced a trap composed of 22 places in 247 ms of which 4 ms to minimize.
[2024-05-26 19:03:09] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 3 ms to minimize.
[2024-05-26 19:03:09] [INFO ] Deduced a trap composed of 48 places in 227 ms of which 4 ms to minimize.
[2024-05-26 19:03:09] [INFO ] Deduced a trap composed of 19 places in 251 ms of which 3 ms to minimize.
[2024-05-26 19:03:10] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 3 ms to minimize.
[2024-05-26 19:03:10] [INFO ] Deduced a trap composed of 26 places in 218 ms of which 3 ms to minimize.
[2024-05-26 19:03:10] [INFO ] Deduced a trap composed of 59 places in 205 ms of which 3 ms to minimize.
[2024-05-26 19:03:10] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 3 ms to minimize.
[2024-05-26 19:03:11] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 3 ms to minimize.
[2024-05-26 19:03:11] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 3 ms to minimize.
[2024-05-26 19:03:11] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 3 ms to minimize.
[2024-05-26 19:03:12] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 4 ms to minimize.
[2024-05-26 19:03:12] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 3 ms to minimize.
[2024-05-26 19:03:12] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 3 ms to minimize.
[2024-05-26 19:03:12] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 3 ms to minimize.
[2024-05-26 19:03:13] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 3 ms to minimize.
[2024-05-26 19:03:13] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 20/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 19:03:13] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 3 ms to minimize.
[2024-05-26 19:03:13] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 3 ms to minimize.
[2024-05-26 19:03:14] [INFO ] Deduced a trap composed of 74 places in 214 ms of which 4 ms to minimize.
[2024-05-26 19:03:14] [INFO ] Deduced a trap composed of 33 places in 231 ms of which 3 ms to minimize.
[2024-05-26 19:03:14] [INFO ] Deduced a trap composed of 29 places in 209 ms of which 3 ms to minimize.
[2024-05-26 19:03:15] [INFO ] Deduced a trap composed of 30 places in 236 ms of which 3 ms to minimize.
[2024-05-26 19:03:15] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 3 ms to minimize.
[2024-05-26 19:03:15] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 3 ms to minimize.
[2024-05-26 19:03:15] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 3 ms to minimize.
[2024-05-26 19:03:16] [INFO ] Deduced a trap composed of 53 places in 199 ms of which 3 ms to minimize.
[2024-05-26 19:03:16] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 3 ms to minimize.
[2024-05-26 19:03:16] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 2 ms to minimize.
[2024-05-26 19:03:17] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 3 ms to minimize.
[2024-05-26 19:03:17] [INFO ] Deduced a trap composed of 43 places in 195 ms of which 3 ms to minimize.
[2024-05-26 19:03:17] [INFO ] Deduced a trap composed of 38 places in 197 ms of which 3 ms to minimize.
[2024-05-26 19:03:17] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 3 ms to minimize.
[2024-05-26 19:03:18] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 3 ms to minimize.
[2024-05-26 19:03:18] [INFO ] Deduced a trap composed of 54 places in 198 ms of which 3 ms to minimize.
[2024-05-26 19:03:18] [INFO ] Deduced a trap composed of 54 places in 187 ms of which 3 ms to minimize.
[2024-05-26 19:03:18] [INFO ] Deduced a trap composed of 58 places in 187 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 20/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 19:03:19] [INFO ] Deduced a trap composed of 45 places in 189 ms of which 3 ms to minimize.
[2024-05-26 19:03:19] [INFO ] Deduced a trap composed of 59 places in 190 ms of which 3 ms to minimize.
[2024-05-26 19:03:19] [INFO ] Deduced a trap composed of 29 places in 207 ms of which 3 ms to minimize.
[2024-05-26 19:03:22] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 3 ms to minimize.
[2024-05-26 19:03:22] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 3 ms to minimize.
[2024-05-26 19:03:22] [INFO ] Deduced a trap composed of 65 places in 189 ms of which 3 ms to minimize.
[2024-05-26 19:03:23] [INFO ] Deduced a trap composed of 36 places in 178 ms of which 3 ms to minimize.
[2024-05-26 19:03:23] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 3 ms to minimize.
[2024-05-26 19:03:24] [INFO ] Deduced a trap composed of 44 places in 220 ms of which 3 ms to minimize.
[2024-05-26 19:03:24] [INFO ] Deduced a trap composed of 28 places in 212 ms of which 4 ms to minimize.
[2024-05-26 19:03:24] [INFO ] Deduced a trap composed of 53 places in 212 ms of which 3 ms to minimize.
[2024-05-26 19:03:24] [INFO ] Deduced a trap composed of 67 places in 214 ms of which 4 ms to minimize.
[2024-05-26 19:03:25] [INFO ] Deduced a trap composed of 45 places in 215 ms of which 4 ms to minimize.
[2024-05-26 19:03:25] [INFO ] Deduced a trap composed of 29 places in 213 ms of which 4 ms to minimize.
[2024-05-26 19:03:25] [INFO ] Deduced a trap composed of 36 places in 176 ms of which 3 ms to minimize.
[2024-05-26 19:03:25] [INFO ] Deduced a trap composed of 53 places in 189 ms of which 4 ms to minimize.
[2024-05-26 19:03:26] [INFO ] Deduced a trap composed of 67 places in 185 ms of which 3 ms to minimize.
[2024-05-26 19:03:26] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 3 ms to minimize.
[2024-05-26 19:03:26] [INFO ] Deduced a trap composed of 61 places in 202 ms of which 3 ms to minimize.
[2024-05-26 19:03:27] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1309 variables, 20/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 19:03:27] [INFO ] Deduced a trap composed of 50 places in 183 ms of which 3 ms to minimize.
[2024-05-26 19:03:27] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 3 ms to minimize.
[2024-05-26 19:03:28] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 3 ms to minimize.
[2024-05-26 19:03:28] [INFO ] Deduced a trap composed of 26 places in 210 ms of which 3 ms to minimize.
[2024-05-26 19:03:29] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 3 ms to minimize.
[2024-05-26 19:03:29] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 3 ms to minimize.
[2024-05-26 19:03:29] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 3 ms to minimize.
[2024-05-26 19:03:30] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 2 ms to minimize.
[2024-05-26 19:03:30] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 3 ms to minimize.
[2024-05-26 19:03:30] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 3 ms to minimize.
[2024-05-26 19:03:30] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 3 ms to minimize.
[2024-05-26 19:03:30] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 3 ms to minimize.
[2024-05-26 19:03:31] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 3 ms to minimize.
[2024-05-26 19:03:31] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 3 ms to minimize.
[2024-05-26 19:03:31] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 3 ms to minimize.
[2024-05-26 19:03:31] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 2 ms to minimize.
[2024-05-26 19:03:32] [INFO ] Deduced a trap composed of 59 places in 154 ms of which 3 ms to minimize.
[2024-05-26 19:03:32] [INFO ] Deduced a trap composed of 59 places in 162 ms of which 3 ms to minimize.
[2024-05-26 19:03:32] [INFO ] Deduced a trap composed of 59 places in 159 ms of which 2 ms to minimize.
[2024-05-26 19:03:32] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1309 variables, 20/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 19:03:32] [INFO ] Deduced a trap composed of 53 places in 159 ms of which 3 ms to minimize.
[2024-05-26 19:03:33] [INFO ] Deduced a trap composed of 51 places in 157 ms of which 3 ms to minimize.
[2024-05-26 19:03:33] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 3 ms to minimize.
[2024-05-26 19:03:33] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 3 ms to minimize.
[2024-05-26 19:03:34] [INFO ] Deduced a trap composed of 29 places in 215 ms of which 3 ms to minimize.
[2024-05-26 19:03:34] [INFO ] Deduced a trap composed of 50 places in 186 ms of which 3 ms to minimize.
[2024-05-26 19:03:34] [INFO ] Deduced a trap composed of 53 places in 163 ms of which 3 ms to minimize.
[2024-05-26 19:03:34] [INFO ] Deduced a trap composed of 58 places in 168 ms of which 3 ms to minimize.
[2024-05-26 19:03:35] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 3 ms to minimize.
[2024-05-26 19:03:36] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 3 ms to minimize.
[2024-05-26 19:03:39] [INFO ] Deduced a trap composed of 51 places in 163 ms of which 2 ms to minimize.
[2024-05-26 19:03:39] [INFO ] Deduced a trap composed of 50 places in 181 ms of which 3 ms to minimize.
[2024-05-26 19:03:39] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 3 ms to minimize.
[2024-05-26 19:03:40] [INFO ] Deduced a trap composed of 36 places in 189 ms of which 3 ms to minimize.
[2024-05-26 19:03:41] [INFO ] Deduced a trap composed of 29 places in 220 ms of which 4 ms to minimize.
[2024-05-26 19:03:41] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 2 ms to minimize.
[2024-05-26 19:03:41] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 2 ms to minimize.
[2024-05-26 19:03:42] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 3 ms to minimize.
[2024-05-26 19:03:42] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 2 ms to minimize.
[2024-05-26 19:03:42] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1309 variables, 20/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 19:03:42] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 3 ms to minimize.
[2024-05-26 19:03:43] [INFO ] Deduced a trap composed of 61 places in 151 ms of which 3 ms to minimize.
[2024-05-26 19:03:43] [INFO ] Deduced a trap composed of 52 places in 160 ms of which 2 ms to minimize.
[2024-05-26 19:03:43] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 2 ms to minimize.
[2024-05-26 19:03:44] [INFO ] Deduced a trap composed of 49 places in 153 ms of which 3 ms to minimize.
[2024-05-26 19:03:45] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 2 ms to minimize.
[2024-05-26 19:03:45] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 3 ms to minimize.
[2024-05-26 19:03:45] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 3 ms to minimize.
[2024-05-26 19:03:46] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 2 ms to minimize.
[2024-05-26 19:03:46] [INFO ] Deduced a trap composed of 50 places in 133 ms of which 2 ms to minimize.
[2024-05-26 19:03:46] [INFO ] Deduced a trap composed of 52 places in 157 ms of which 2 ms to minimize.
[2024-05-26 19:03:47] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 2 ms to minimize.
[2024-05-26 19:03:47] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 2 ms to minimize.
[2024-05-26 19:03:47] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 2 ms to minimize.
[2024-05-26 19:03:48] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 2 ms to minimize.
[2024-05-26 19:03:49] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2024-05-26 19:03:50] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 3 ms to minimize.
[2024-05-26 19:03:50] [INFO ] Deduced a trap composed of 35 places in 230 ms of which 3 ms to minimize.
[2024-05-26 19:03:51] [INFO ] Deduced a trap composed of 38 places in 232 ms of which 3 ms to minimize.
[2024-05-26 19:03:51] [INFO ] Deduced a trap composed of 29 places in 234 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1309 variables, 20/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 19:03:51] [INFO ] Deduced a trap composed of 28 places in 255 ms of which 4 ms to minimize.
[2024-05-26 19:03:51] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 3 ms to minimize.
[2024-05-26 19:03:52] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 3 ms to minimize.
[2024-05-26 19:03:52] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 2 ms to minimize.
[2024-05-26 19:03:53] [INFO ] Deduced a trap composed of 50 places in 177 ms of which 2 ms to minimize.
[2024-05-26 19:03:53] [INFO ] Deduced a trap composed of 52 places in 145 ms of which 3 ms to minimize.
[2024-05-26 19:03:54] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 2 ms to minimize.
[2024-05-26 19:03:54] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2024-05-26 19:03:55] [INFO ] Deduced a trap composed of 56 places in 171 ms of which 2 ms to minimize.
[2024-05-26 19:03:55] [INFO ] Deduced a trap composed of 96 places in 247 ms of which 3 ms to minimize.
[2024-05-26 19:03:56] [INFO ] Deduced a trap composed of 43 places in 226 ms of which 3 ms to minimize.
[2024-05-26 19:03:57] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 2 ms to minimize.
[2024-05-26 19:03:57] [INFO ] Deduced a trap composed of 54 places in 136 ms of which 2 ms to minimize.
[2024-05-26 19:03:58] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 3 ms to minimize.
[2024-05-26 19:03:58] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 2 ms to minimize.
[2024-05-26 19:03:58] [INFO ] Deduced a trap composed of 54 places in 148 ms of which 2 ms to minimize.
[2024-05-26 19:03:59] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 2 ms to minimize.
[2024-05-26 19:03:59] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 2 ms to minimize.
[2024-05-26 19:04:00] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 2 ms to minimize.
[2024-05-26 19:04:00] [INFO ] Deduced a trap composed of 46 places in 153 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1309 variables, 20/937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 19:04:00] [INFO ] Deduced a trap composed of 71 places in 136 ms of which 2 ms to minimize.
[2024-05-26 19:04:01] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 2 ms to minimize.
[2024-05-26 19:04:02] [INFO ] Deduced a trap composed of 45 places in 185 ms of which 2 ms to minimize.
[2024-05-26 19:04:03] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 3 ms to minimize.
[2024-05-26 19:04:03] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 2 ms to minimize.
[2024-05-26 19:04:03] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 3 ms to minimize.
[2024-05-26 19:04:03] [INFO ] Deduced a trap composed of 46 places in 151 ms of which 3 ms to minimize.
[2024-05-26 19:04:04] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 2 ms to minimize.
[2024-05-26 19:04:04] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 2 ms to minimize.
[2024-05-26 19:04:05] [INFO ] Deduced a trap composed of 58 places in 154 ms of which 3 ms to minimize.
[2024-05-26 19:04:05] [INFO ] Deduced a trap composed of 36 places in 176 ms of which 3 ms to minimize.
[2024-05-26 19:04:05] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 2 ms to minimize.
[2024-05-26 19:04:05] [INFO ] Deduced a trap composed of 44 places in 176 ms of which 3 ms to minimize.
SMT process timed out in 75753ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 24 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 406/406 places, 1113/1113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 33 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2024-05-26 19:04:05] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2024-05-26 19:04:06] [INFO ] Invariant cache hit.
[2024-05-26 19:04:06] [INFO ] Implicit Places using invariants in 473 ms returned []
[2024-05-26 19:04:06] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2024-05-26 19:04:06] [INFO ] Invariant cache hit.
[2024-05-26 19:04:06] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 19:04:08] [INFO ] Implicit Places using invariants and state equation in 2191 ms returned []
Implicit Place search using SMT with State Equation took 2677 ms to find 0 implicit places.
[2024-05-26 19:04:08] [INFO ] Redundant transitions in 15 ms returned []
Running 1106 sub problems to find dead transitions.
[2024-05-26 19:04:08] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2024-05-26 19:04:08] [INFO ] Invariant cache hit.
[2024-05-26 19:04:08] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2024-05-26 19:04:19] [INFO ] Deduced a trap composed of 21 places in 295 ms of which 5 ms to minimize.
[2024-05-26 19:04:19] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 4 ms to minimize.
[2024-05-26 19:04:19] [INFO ] Deduced a trap composed of 21 places in 294 ms of which 4 ms to minimize.
[2024-05-26 19:04:19] [INFO ] Deduced a trap composed of 22 places in 293 ms of which 4 ms to minimize.
[2024-05-26 19:04:20] [INFO ] Deduced a trap composed of 19 places in 298 ms of which 5 ms to minimize.
[2024-05-26 19:04:20] [INFO ] Deduced a trap composed of 25 places in 298 ms of which 3 ms to minimize.
[2024-05-26 19:04:20] [INFO ] Deduced a trap composed of 13 places in 274 ms of which 3 ms to minimize.
[2024-05-26 19:04:21] [INFO ] Deduced a trap composed of 14 places in 266 ms of which 4 ms to minimize.
[2024-05-26 19:04:21] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 4 ms to minimize.
[2024-05-26 19:04:21] [INFO ] Deduced a trap composed of 44 places in 265 ms of which 4 ms to minimize.
[2024-05-26 19:04:21] [INFO ] Deduced a trap composed of 14 places in 244 ms of which 4 ms to minimize.
[2024-05-26 19:04:22] [INFO ] Deduced a trap composed of 23 places in 249 ms of which 3 ms to minimize.
[2024-05-26 19:04:22] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 3 ms to minimize.
[2024-05-26 19:04:22] [INFO ] Deduced a trap composed of 84 places in 278 ms of which 4 ms to minimize.
[2024-05-26 19:04:23] [INFO ] Deduced a trap composed of 77 places in 257 ms of which 4 ms to minimize.
[2024-05-26 19:04:23] [INFO ] Deduced a trap composed of 67 places in 289 ms of which 3 ms to minimize.
[2024-05-26 19:04:23] [INFO ] Deduced a trap composed of 81 places in 244 ms of which 3 ms to minimize.
[2024-05-26 19:04:23] [INFO ] Deduced a trap composed of 44 places in 298 ms of which 3 ms to minimize.
[2024-05-26 19:04:24] [INFO ] Deduced a trap composed of 23 places in 270 ms of which 3 ms to minimize.
[2024-05-26 19:04:24] [INFO ] Deduced a trap composed of 23 places in 281 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2024-05-26 19:04:25] [INFO ] Deduced a trap composed of 44 places in 261 ms of which 4 ms to minimize.
[2024-05-26 19:04:25] [INFO ] Deduced a trap composed of 21 places in 279 ms of which 3 ms to minimize.
[2024-05-26 19:04:25] [INFO ] Deduced a trap composed of 24 places in 308 ms of which 4 ms to minimize.
[2024-05-26 19:04:26] [INFO ] Deduced a trap composed of 46 places in 301 ms of which 4 ms to minimize.
[2024-05-26 19:04:26] [INFO ] Deduced a trap composed of 43 places in 302 ms of which 4 ms to minimize.
[2024-05-26 19:04:26] [INFO ] Deduced a trap composed of 52 places in 303 ms of which 4 ms to minimize.
[2024-05-26 19:04:26] [INFO ] Deduced a trap composed of 43 places in 294 ms of which 4 ms to minimize.
[2024-05-26 19:04:27] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 5 ms to minimize.
[2024-05-26 19:04:27] [INFO ] Deduced a trap composed of 38 places in 277 ms of which 4 ms to minimize.
[2024-05-26 19:04:27] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 3 ms to minimize.
[2024-05-26 19:04:28] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 3 ms to minimize.
[2024-05-26 19:04:28] [INFO ] Deduced a trap composed of 39 places in 249 ms of which 3 ms to minimize.
[2024-05-26 19:04:28] [INFO ] Deduced a trap composed of 10 places in 242 ms of which 4 ms to minimize.
[2024-05-26 19:04:28] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 3 ms to minimize.
[2024-05-26 19:04:29] [INFO ] Deduced a trap composed of 21 places in 281 ms of which 4 ms to minimize.
[2024-05-26 19:04:29] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 3 ms to minimize.
[2024-05-26 19:04:29] [INFO ] Deduced a trap composed of 11 places in 294 ms of which 4 ms to minimize.
[2024-05-26 19:04:29] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 3 ms to minimize.
[2024-05-26 19:04:30] [INFO ] Deduced a trap composed of 13 places in 296 ms of which 4 ms to minimize.
[2024-05-26 19:04:30] [INFO ] Deduced a trap composed of 38 places in 269 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2024-05-26 19:04:31] [INFO ] Deduced a trap composed of 28 places in 222 ms of which 4 ms to minimize.
[2024-05-26 19:04:31] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 4 ms to minimize.
[2024-05-26 19:04:31] [INFO ] Deduced a trap composed of 29 places in 272 ms of which 3 ms to minimize.
[2024-05-26 19:04:32] [INFO ] Deduced a trap composed of 39 places in 268 ms of which 3 ms to minimize.
[2024-05-26 19:04:32] [INFO ] Deduced a trap composed of 31 places in 266 ms of which 4 ms to minimize.
[2024-05-26 19:04:32] [INFO ] Deduced a trap composed of 31 places in 218 ms of which 4 ms to minimize.
[2024-05-26 19:04:32] [INFO ] Deduced a trap composed of 46 places in 234 ms of which 3 ms to minimize.
[2024-05-26 19:04:33] [INFO ] Deduced a trap composed of 75 places in 251 ms of which 3 ms to minimize.
[2024-05-26 19:04:33] [INFO ] Deduced a trap composed of 15 places in 285 ms of which 4 ms to minimize.
[2024-05-26 19:04:33] [INFO ] Deduced a trap composed of 12 places in 262 ms of which 4 ms to minimize.
[2024-05-26 19:04:33] [INFO ] Deduced a trap composed of 20 places in 293 ms of which 4 ms to minimize.
[2024-05-26 19:04:34] [INFO ] Deduced a trap composed of 38 places in 270 ms of which 4 ms to minimize.
[2024-05-26 19:04:34] [INFO ] Deduced a trap composed of 39 places in 266 ms of which 4 ms to minimize.
[2024-05-26 19:04:34] [INFO ] Deduced a trap composed of 52 places in 230 ms of which 3 ms to minimize.
[2024-05-26 19:04:35] [INFO ] Deduced a trap composed of 15 places in 258 ms of which 4 ms to minimize.
[2024-05-26 19:04:35] [INFO ] Deduced a trap composed of 34 places in 290 ms of which 4 ms to minimize.
[2024-05-26 19:04:35] [INFO ] Deduced a trap composed of 36 places in 273 ms of which 4 ms to minimize.
[2024-05-26 19:04:35] [INFO ] Deduced a trap composed of 58 places in 265 ms of which 4 ms to minimize.
[2024-05-26 19:04:36] [INFO ] Deduced a trap composed of 54 places in 282 ms of which 4 ms to minimize.
[2024-05-26 19:04:36] [INFO ] Deduced a trap composed of 52 places in 251 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 406/1309 variables, and 80 constraints, problems are : Problem set: 0 solved, 1106 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/406 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1106/1106 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 60/80 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2024-05-26 19:04:41] [INFO ] Deduced a trap composed of 82 places in 263 ms of which 4 ms to minimize.
[2024-05-26 19:04:41] [INFO ] Deduced a trap composed of 21 places in 265 ms of which 4 ms to minimize.
[2024-05-26 19:04:41] [INFO ] Deduced a trap composed of 29 places in 221 ms of which 3 ms to minimize.
[2024-05-26 19:04:41] [INFO ] Deduced a trap composed of 45 places in 228 ms of which 4 ms to minimize.
[2024-05-26 19:04:42] [INFO ] Deduced a trap composed of 49 places in 235 ms of which 4 ms to minimize.
[2024-05-26 19:04:42] [INFO ] Deduced a trap composed of 36 places in 179 ms of which 2 ms to minimize.
[2024-05-26 19:04:42] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 3 ms to minimize.
[2024-05-26 19:04:42] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 3 ms to minimize.
[2024-05-26 19:04:43] [INFO ] Deduced a trap composed of 44 places in 249 ms of which 4 ms to minimize.
[2024-05-26 19:04:43] [INFO ] Deduced a trap composed of 33 places in 267 ms of which 4 ms to minimize.
[2024-05-26 19:04:43] [INFO ] Deduced a trap composed of 39 places in 287 ms of which 4 ms to minimize.
[2024-05-26 19:04:43] [INFO ] Deduced a trap composed of 11 places in 276 ms of which 4 ms to minimize.
[2024-05-26 19:04:44] [INFO ] Deduced a trap composed of 67 places in 278 ms of which 4 ms to minimize.
[2024-05-26 19:04:44] [INFO ] Deduced a trap composed of 12 places in 267 ms of which 4 ms to minimize.
[2024-05-26 19:04:44] [INFO ] Deduced a trap composed of 43 places in 282 ms of which 4 ms to minimize.
[2024-05-26 19:04:45] [INFO ] Deduced a trap composed of 73 places in 267 ms of which 4 ms to minimize.
[2024-05-26 19:04:45] [INFO ] Deduced a trap composed of 55 places in 280 ms of which 4 ms to minimize.
[2024-05-26 19:04:45] [INFO ] Deduced a trap composed of 27 places in 274 ms of which 3 ms to minimize.
[2024-05-26 19:04:45] [INFO ] Deduced a trap composed of 27 places in 270 ms of which 4 ms to minimize.
[2024-05-26 19:04:46] [INFO ] Deduced a trap composed of 14 places in 271 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2024-05-26 19:04:47] [INFO ] Deduced a trap composed of 37 places in 250 ms of which 4 ms to minimize.
[2024-05-26 19:04:47] [INFO ] Deduced a trap composed of 45 places in 259 ms of which 4 ms to minimize.
[2024-05-26 19:04:47] [INFO ] Deduced a trap composed of 32 places in 272 ms of which 4 ms to minimize.
[2024-05-26 19:04:47] [INFO ] Deduced a trap composed of 31 places in 254 ms of which 4 ms to minimize.
[2024-05-26 19:04:48] [INFO ] Deduced a trap composed of 48 places in 248 ms of which 4 ms to minimize.
[2024-05-26 19:04:48] [INFO ] Deduced a trap composed of 60 places in 277 ms of which 4 ms to minimize.
[2024-05-26 19:04:48] [INFO ] Deduced a trap composed of 64 places in 269 ms of which 4 ms to minimize.
[2024-05-26 19:04:48] [INFO ] Deduced a trap composed of 29 places in 300 ms of which 4 ms to minimize.
[2024-05-26 19:04:49] [INFO ] Deduced a trap composed of 36 places in 300 ms of which 4 ms to minimize.
[2024-05-26 19:04:49] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 3 ms to minimize.
[2024-05-26 19:04:49] [INFO ] Deduced a trap composed of 39 places in 263 ms of which 4 ms to minimize.
[2024-05-26 19:04:50] [INFO ] Deduced a trap composed of 31 places in 260 ms of which 4 ms to minimize.
[2024-05-26 19:04:50] [INFO ] Deduced a trap composed of 37 places in 274 ms of which 3 ms to minimize.
[2024-05-26 19:04:50] [INFO ] Deduced a trap composed of 20 places in 278 ms of which 4 ms to minimize.
[2024-05-26 19:04:50] [INFO ] Deduced a trap composed of 36 places in 231 ms of which 3 ms to minimize.
[2024-05-26 19:04:51] [INFO ] Deduced a trap composed of 31 places in 232 ms of which 4 ms to minimize.
[2024-05-26 19:04:51] [INFO ] Deduced a trap composed of 47 places in 246 ms of which 3 ms to minimize.
[2024-05-26 19:04:51] [INFO ] Deduced a trap composed of 45 places in 224 ms of which 4 ms to minimize.
[2024-05-26 19:04:51] [INFO ] Deduced a trap composed of 40 places in 223 ms of which 3 ms to minimize.
[2024-05-26 19:04:52] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2024-05-26 19:04:52] [INFO ] Deduced a trap composed of 27 places in 254 ms of which 4 ms to minimize.
[2024-05-26 19:04:53] [INFO ] Deduced a trap composed of 40 places in 293 ms of which 4 ms to minimize.
[2024-05-26 19:04:53] [INFO ] Deduced a trap composed of 57 places in 256 ms of which 4 ms to minimize.
[2024-05-26 19:04:53] [INFO ] Deduced a trap composed of 60 places in 235 ms of which 4 ms to minimize.
[2024-05-26 19:04:53] [INFO ] Deduced a trap composed of 68 places in 258 ms of which 3 ms to minimize.
[2024-05-26 19:04:54] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 3 ms to minimize.
[2024-05-26 19:04:54] [INFO ] Deduced a trap composed of 39 places in 277 ms of which 4 ms to minimize.
[2024-05-26 19:04:54] [INFO ] Deduced a trap composed of 34 places in 254 ms of which 3 ms to minimize.
[2024-05-26 19:04:54] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 4 ms to minimize.
[2024-05-26 19:04:55] [INFO ] Deduced a trap composed of 48 places in 259 ms of which 3 ms to minimize.
[2024-05-26 19:04:55] [INFO ] Deduced a trap composed of 54 places in 222 ms of which 3 ms to minimize.
[2024-05-26 19:04:55] [INFO ] Deduced a trap composed of 40 places in 238 ms of which 4 ms to minimize.
[2024-05-26 19:04:55] [INFO ] Deduced a trap composed of 32 places in 215 ms of which 4 ms to minimize.
[2024-05-26 19:04:56] [INFO ] Deduced a trap composed of 46 places in 201 ms of which 4 ms to minimize.
[2024-05-26 19:04:56] [INFO ] Deduced a trap composed of 88 places in 243 ms of which 3 ms to minimize.
[2024-05-26 19:04:56] [INFO ] Deduced a trap composed of 35 places in 292 ms of which 4 ms to minimize.
[2024-05-26 19:04:56] [INFO ] Deduced a trap composed of 52 places in 245 ms of which 3 ms to minimize.
[2024-05-26 19:04:57] [INFO ] Deduced a trap composed of 39 places in 237 ms of which 3 ms to minimize.
[2024-05-26 19:04:57] [INFO ] Deduced a trap composed of 52 places in 317 ms of which 4 ms to minimize.
[2024-05-26 19:04:57] [INFO ] Deduced a trap composed of 24 places in 267 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2024-05-26 19:04:58] [INFO ] Deduced a trap composed of 39 places in 285 ms of which 4 ms to minimize.
[2024-05-26 19:04:58] [INFO ] Deduced a trap composed of 39 places in 277 ms of which 4 ms to minimize.
[2024-05-26 19:04:59] [INFO ] Deduced a trap composed of 47 places in 304 ms of which 4 ms to minimize.
[2024-05-26 19:04:59] [INFO ] Deduced a trap composed of 50 places in 282 ms of which 4 ms to minimize.
[2024-05-26 19:04:59] [INFO ] Deduced a trap composed of 39 places in 298 ms of which 4 ms to minimize.
[2024-05-26 19:05:00] [INFO ] Deduced a trap composed of 44 places in 260 ms of which 3 ms to minimize.
[2024-05-26 19:05:00] [INFO ] Deduced a trap composed of 39 places in 265 ms of which 4 ms to minimize.
[2024-05-26 19:05:00] [INFO ] Deduced a trap composed of 53 places in 244 ms of which 4 ms to minimize.
[2024-05-26 19:05:01] [INFO ] Deduced a trap composed of 64 places in 291 ms of which 4 ms to minimize.
[2024-05-26 19:05:01] [INFO ] Deduced a trap composed of 41 places in 226 ms of which 3 ms to minimize.
[2024-05-26 19:05:01] [INFO ] Deduced a trap composed of 27 places in 232 ms of which 4 ms to minimize.
[2024-05-26 19:05:01] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 2 ms to minimize.
[2024-05-26 19:05:01] [INFO ] Deduced a trap composed of 14 places in 296 ms of which 4 ms to minimize.
[2024-05-26 19:05:02] [INFO ] Deduced a trap composed of 15 places in 255 ms of which 4 ms to minimize.
[2024-05-26 19:05:02] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 2 ms to minimize.
[2024-05-26 19:05:02] [INFO ] Deduced a trap composed of 54 places in 239 ms of which 4 ms to minimize.
[2024-05-26 19:05:02] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 2 ms to minimize.
[2024-05-26 19:05:02] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 2 ms to minimize.
[2024-05-26 19:05:03] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 3 ms to minimize.
[2024-05-26 19:05:03] [INFO ] Deduced a trap composed of 35 places in 214 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2024-05-26 19:05:04] [INFO ] Deduced a trap composed of 26 places in 261 ms of which 4 ms to minimize.
[2024-05-26 19:05:04] [INFO ] Deduced a trap composed of 28 places in 290 ms of which 4 ms to minimize.
[2024-05-26 19:05:04] [INFO ] Deduced a trap composed of 47 places in 266 ms of which 4 ms to minimize.
[2024-05-26 19:05:05] [INFO ] Deduced a trap composed of 43 places in 260 ms of which 4 ms to minimize.
[2024-05-26 19:05:05] [INFO ] Deduced a trap composed of 58 places in 252 ms of which 4 ms to minimize.
[2024-05-26 19:05:05] [INFO ] Deduced a trap composed of 56 places in 271 ms of which 3 ms to minimize.
[2024-05-26 19:05:05] [INFO ] Deduced a trap composed of 22 places in 270 ms of which 4 ms to minimize.
[2024-05-26 19:05:06] [INFO ] Deduced a trap composed of 31 places in 280 ms of which 4 ms to minimize.
[2024-05-26 19:05:06] [INFO ] Deduced a trap composed of 34 places in 236 ms of which 3 ms to minimize.
[2024-05-26 19:05:06] [INFO ] Deduced a trap composed of 28 places in 183 ms of which 3 ms to minimize.
[2024-05-26 19:05:06] [INFO ] Deduced a trap composed of 34 places in 253 ms of which 4 ms to minimize.
[2024-05-26 19:05:07] [INFO ] Deduced a trap composed of 31 places in 247 ms of which 3 ms to minimize.
[2024-05-26 19:05:07] [INFO ] Deduced a trap composed of 31 places in 246 ms of which 3 ms to minimize.
[2024-05-26 19:05:07] [INFO ] Deduced a trap composed of 36 places in 266 ms of which 4 ms to minimize.
[2024-05-26 19:05:07] [INFO ] Deduced a trap composed of 45 places in 216 ms of which 4 ms to minimize.
[2024-05-26 19:05:08] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 4 ms to minimize.
[2024-05-26 19:05:08] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 3 ms to minimize.
[2024-05-26 19:05:08] [INFO ] Deduced a trap composed of 35 places in 215 ms of which 4 ms to minimize.
[2024-05-26 19:05:08] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 3 ms to minimize.
[2024-05-26 19:05:09] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/1309 variables, and 180 constraints, problems are : Problem set: 0 solved, 1106 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/406 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 0/1106 constraints, Known Traps: 160/160 constraints]
After SMT, in 60497ms problems are : Problem set: 0 solved, 1106 unsolved
Search for dead transitions found 0 dead transitions in 60513ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63247 ms. Remains : 406/406 places, 1113/1113 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[7]
Ending property specific reduction for Peterson-COL-6-UpperBounds-06 in 314404 ms.
Starting property specific reduction for Peterson-COL-6-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
[2024-05-26 19:05:09] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
// Phase 1: matrix 1239 rows 742 cols
[2024-05-26 19:05:09] [INFO ] Computed 20 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2 resets) in 76 ms. (129 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 60 ms. (163 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[7]
[2024-05-26 19:05:09] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 19:05:09] [INFO ] Invariant cache hit.
[2024-05-26 19:05:09] [INFO ] [Real]Absence check using 20 positive place invariants in 19 ms returned sat
[2024-05-26 19:05:10] [INFO ] [Real]Absence check using state equation in 495 ms returned sat
[2024-05-26 19:05:10] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 19:05:10] [INFO ] [Real]Added 330 Read/Feed constraints in 79 ms returned sat
[2024-05-26 19:05:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 19:05:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 19 ms returned sat
[2024-05-26 19:05:10] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2024-05-26 19:05:10] [INFO ] [Nat]Added 330 Read/Feed constraints in 175 ms returned sat
[2024-05-26 19:05:11] [INFO ] Computed and/alt/rep : 1148/3171/1148 causal constraints (skipped 84 transitions) in 105 ms.
[2024-05-26 19:05:11] [INFO ] Added : 15 causal constraints over 3 iterations in 469 ms. Result :sat
Minimization took 442 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[7]
Support contains 294 out of 742 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 742 transition count 1442
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 735 transition count 1442
Applied a total of 14 rules in 47 ms. Remains 735 /742 variables (removed 7) and now considering 1442/1449 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 735/742 places, 1442/1449 transitions.
[2024-05-26 19:05:12] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2024-05-26 19:05:12] [INFO ] Computed 20 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[7]
RANDOM walk for 1000000 steps (2 resets) in 7504 ms. (133 steps per ms)
BEST_FIRST walk for 848914 steps (2 resets) in 5001 ms. (169 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[7]
[2024-05-26 19:05:24] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2024-05-26 19:05:24] [INFO ] Invariant cache hit.
[2024-05-26 19:05:24] [INFO ] [Real]Absence check using 20 positive place invariants in 19 ms returned sat
[2024-05-26 19:05:25] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2024-05-26 19:05:25] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 19:05:25] [INFO ] [Real]Added 330 Read/Feed constraints in 104 ms returned sat
[2024-05-26 19:05:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 19:05:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 18 ms returned sat
[2024-05-26 19:05:26] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2024-05-26 19:05:26] [INFO ] [Nat]Added 330 Read/Feed constraints in 158 ms returned sat
[2024-05-26 19:05:27] [INFO ] Deduced a trap composed of 51 places in 598 ms of which 7 ms to minimize.
[2024-05-26 19:05:27] [INFO ] Deduced a trap composed of 18 places in 581 ms of which 7 ms to minimize.
[2024-05-26 19:05:28] [INFO ] Deduced a trap composed of 12 places in 549 ms of which 7 ms to minimize.
[2024-05-26 19:05:28] [INFO ] Deduced a trap composed of 10 places in 559 ms of which 7 ms to minimize.
[2024-05-26 19:05:29] [INFO ] Deduced a trap composed of 18 places in 607 ms of which 7 ms to minimize.
[2024-05-26 19:05:30] [INFO ] Deduced a trap composed of 51 places in 577 ms of which 7 ms to minimize.
[2024-05-26 19:05:30] [INFO ] Deduced a trap composed of 28 places in 542 ms of which 6 ms to minimize.
[2024-05-26 19:05:31] [INFO ] Deduced a trap composed of 16 places in 500 ms of which 7 ms to minimize.
[2024-05-26 19:05:31] [INFO ] Deduced a trap composed of 32 places in 578 ms of which 8 ms to minimize.
[2024-05-26 19:05:32] [INFO ] Deduced a trap composed of 70 places in 533 ms of which 6 ms to minimize.
[2024-05-26 19:05:33] [INFO ] Deduced a trap composed of 32 places in 382 ms of which 5 ms to minimize.
[2024-05-26 19:05:33] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 6645 ms
[2024-05-26 19:05:33] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 103 ms.
[2024-05-26 19:05:35] [INFO ] Deduced a trap composed of 52 places in 365 ms of which 5 ms to minimize.
[2024-05-26 19:05:36] [INFO ] Deduced a trap composed of 21 places in 544 ms of which 7 ms to minimize.
[2024-05-26 19:05:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1129 ms
[2024-05-26 19:05:36] [INFO ] Added : 119 causal constraints over 24 iterations in 3569 ms. Result :sat
Minimization took 629 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[7]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 26 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 24 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2024-05-26 19:05:37] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2024-05-26 19:05:37] [INFO ] Invariant cache hit.
[2024-05-26 19:05:38] [INFO ] Implicit Places using invariants in 610 ms returned []
[2024-05-26 19:05:38] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2024-05-26 19:05:38] [INFO ] Invariant cache hit.
[2024-05-26 19:05:38] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 19:05:41] [INFO ] Implicit Places using invariants and state equation in 3135 ms returned []
Implicit Place search using SMT with State Equation took 3746 ms to find 0 implicit places.
[2024-05-26 19:05:41] [INFO ] Redundant transitions in 25 ms returned []
Running 1435 sub problems to find dead transitions.
[2024-05-26 19:05:41] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2024-05-26 19:05:41] [INFO ] Invariant cache hit.
[2024-05-26 19:05:41] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/735 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2024-05-26 19:06:03] [INFO ] Deduced a trap composed of 77 places in 519 ms of which 7 ms to minimize.
[2024-05-26 19:06:04] [INFO ] Deduced a trap composed of 63 places in 498 ms of which 6 ms to minimize.
[2024-05-26 19:06:04] [INFO ] Deduced a trap composed of 16 places in 505 ms of which 7 ms to minimize.
[2024-05-26 19:06:05] [INFO ] Deduced a trap composed of 87 places in 488 ms of which 6 ms to minimize.
[2024-05-26 19:06:05] [INFO ] Deduced a trap composed of 78 places in 475 ms of which 6 ms to minimize.
[2024-05-26 19:06:06] [INFO ] Deduced a trap composed of 82 places in 465 ms of which 6 ms to minimize.
[2024-05-26 19:06:06] [INFO ] Deduced a trap composed of 84 places in 460 ms of which 6 ms to minimize.
[2024-05-26 19:06:07] [INFO ] Deduced a trap composed of 42 places in 493 ms of which 7 ms to minimize.
[2024-05-26 19:06:07] [INFO ] Deduced a trap composed of 50 places in 526 ms of which 7 ms to minimize.
[2024-05-26 19:06:08] [INFO ] Deduced a trap composed of 74 places in 615 ms of which 7 ms to minimize.
[2024-05-26 19:06:08] [INFO ] Deduced a trap composed of 28 places in 482 ms of which 7 ms to minimize.
[2024-05-26 19:06:09] [INFO ] Deduced a trap composed of 45 places in 534 ms of which 6 ms to minimize.
[2024-05-26 19:06:09] [INFO ] Deduced a trap composed of 83 places in 567 ms of which 6 ms to minimize.
[2024-05-26 19:06:10] [INFO ] Deduced a trap composed of 94 places in 550 ms of which 7 ms to minimize.
[2024-05-26 19:06:10] [INFO ] Deduced a trap composed of 36 places in 545 ms of which 6 ms to minimize.
[2024-05-26 19:06:11] [INFO ] Deduced a trap composed of 16 places in 522 ms of which 6 ms to minimize.
[2024-05-26 19:06:12] [INFO ] Deduced a trap composed of 22 places in 514 ms of which 6 ms to minimize.
SMT process timed out in 30593ms, After SMT, problems are : Problem set: 0 solved, 1435 unsolved
Search for dead transitions found 0 dead transitions in 30614ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34423 ms. Remains : 735/735 places, 1442/1442 transitions.
RANDOM walk for 40000 steps (8 resets) in 721 ms. (55 steps per ms) remains 2/2 properties
BEST_FIRST walk for 30243 steps (6 resets) in 299 ms. (100 steps per ms) remains 0/2 properties
FORMULA Peterson-COL-6-UpperBounds-13 7 TECHNIQUES REACHABILITY_MAX
FORMULA Peterson-COL-6-UpperBounds-08 7 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Peterson-COL-6-UpperBounds-08 in 63236 ms.
[2024-05-26 19:06:12] [INFO ] Flatten gal took : 218 ms
[2024-05-26 19:06:12] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-26 19:06:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 742 places, 1449 transitions and 5096 arcs took 16 ms.
Total runtime 998454 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Peterson-COL-6
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 742
TRANSITIONS: 1449
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.039s, Sys 0.002s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.007s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 4007
MODEL NAME: /home/mcc/execution/414/model
742 places, 1449 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
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-COL-6"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Peterson-COL-6, 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 r267-smll-171654406000237"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-6.tgz
mv Peterson-COL-6 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 ;